java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:16:04,447 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:16:04,449 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:16:04,464 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:16:04,465 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:16:04,466 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:16:04,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:16:04,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:16:04,476 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:16:04,478 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:16:04,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:16:04,479 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:16:04,482 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:16:04,483 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:16:04,484 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:16:04,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:16:04,493 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:16:04,496 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:16:04,498 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:16:04,503 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:16:04,505 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:16:04,506 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:16:04,509 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:16:04,509 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:16:04,510 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:16:04,513 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:16:04,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:16:04,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:16:04,518 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:16:04,520 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:16:04,521 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:16:04,522 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:16:04,522 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:16:04,522 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:16:04,523 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:16:04,525 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:16:04,526 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:16:04,554 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:16:04,554 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:16:04,555 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:16:04,555 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:16:04,555 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:16:04,556 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:16:04,557 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:16:04,557 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:16:04,557 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:16:04,557 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:16:04,557 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:16:04,558 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:16:04,558 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:16:04,558 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:16:04,558 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:16:04,558 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:16:04,559 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:16:04,560 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:16:04,560 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:16:04,560 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:16:04,560 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:16:04,561 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:16:04,561 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:16:04,561 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:16:04,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:16:04,561 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:16:04,562 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:16:04,562 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:16:04,562 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:16:04,562 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:16:04,562 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:16:04,563 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:16:04,563 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:16:04,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:16:04,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:16:04,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:16:04,632 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:16:04,632 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:16:04,633 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:16:04,701 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3717d95/6c72a1f4f6464bd2a1c0524e8bebc6ae/FLAG1c89c880e [2018-11-14 18:16:05,215 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:16:05,216 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:16:05,230 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3717d95/6c72a1f4f6464bd2a1c0524e8bebc6ae/FLAG1c89c880e [2018-11-14 18:16:05,245 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3717d95/6c72a1f4f6464bd2a1c0524e8bebc6ae [2018-11-14 18:16:05,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:16:05,259 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:16:05,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:16:05,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:16:05,264 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:16:05,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:16:05" (1/1) ... [2018-11-14 18:16:05,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@586c2beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:16:05, skipping insertion in model container [2018-11-14 18:16:05,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:16:05" (1/1) ... [2018-11-14 18:16:05,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:16:05,329 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:16:05,764 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:16:05,780 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:16:05,944 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:16:06,007 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:16:06,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:16:06 WrapperNode [2018-11-14 18:16:06,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:16:06,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:16:06,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:16:06,009 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:16:06,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:16:06" (1/1) ... [2018-11-14 18:16:06,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:16:06" (1/1) ... [2018-11-14 18:16:06,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:16:06" (1/1) ... [2018-11-14 18:16:06,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:16:06" (1/1) ... [2018-11-14 18:16:06,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:16:06" (1/1) ... [2018-11-14 18:16:06,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:16:06" (1/1) ... [2018-11-14 18:16:06,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:16:06" (1/1) ... [2018-11-14 18:16:06,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:16:06,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:16:06,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:16:06,109 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:16:06,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:16:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:16:06,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:16:06,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:16:06,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:16:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:16:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:16:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:16:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:16:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:16:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:16:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:16:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:16:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:16:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:16:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:16:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:16:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:16:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:16:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:16:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:16:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:16:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:16:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:16:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:16:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:16:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:16:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:16:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:16:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:16:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:16:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:16:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:16:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:16:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:16:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:16:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:16:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:16:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:16:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:16:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:16:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:16:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:16:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:16:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:16:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:16:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:16:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:16:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:16:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:16:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:16:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:16:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:16:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:16:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:16:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:16:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:16:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:16:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:16:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:16:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:16:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:16:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:16:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 18:16:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:16:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:16:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 18:16:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:16:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:16:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 18:16:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:16:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:16:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:16:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:16:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:16:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:16:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:16:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:16:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:16:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:16:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:16:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:16:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:16:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:16:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:16:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:16:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:16:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:16:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:16:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:16:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:16:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:16:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:16:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:16:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:16:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:16:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:16:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:16:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:16:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:16:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:16:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:16:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:16:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:16:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:16:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:16:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:16:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:16:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:16:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:16:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:16:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:16:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:16:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:16:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:16:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:16:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:16:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:16:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:16:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:16:07,444 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:16:07,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:16:07 BoogieIcfgContainer [2018-11-14 18:16:07,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:16:07,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:16:07,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:16:07,450 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:16:07,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:16:05" (1/3) ... [2018-11-14 18:16:07,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2a1164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:16:07, skipping insertion in model container [2018-11-14 18:16:07,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:16:06" (2/3) ... [2018-11-14 18:16:07,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2a1164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:16:07, skipping insertion in model container [2018-11-14 18:16:07,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:16:07" (3/3) ... [2018-11-14 18:16:07,454 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:16:07,465 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:16:07,475 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-14 18:16:07,493 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-14 18:16:07,528 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:16:07,529 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:16:07,529 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:16:07,529 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:16:07,530 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:16:07,530 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:16:07,530 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:16:07,530 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:16:07,531 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:16:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-14 18:16:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 18:16:07,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:16:07,568 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:16:07,571 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:16:07,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:16:07,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1139058233, now seen corresponding path program 1 times [2018-11-14 18:16:07,583 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:16:07,583 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:16:07,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:16:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:07,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:16:07,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {60#true} is VALID [2018-11-14 18:16:07,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {60#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {60#true} is VALID [2018-11-14 18:16:07,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2018-11-14 18:16:07,876 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #201#return; {60#true} is VALID [2018-11-14 18:16:07,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret20 := main(); {60#true} is VALID [2018-11-14 18:16:07,877 INFO L273 TraceCheckUtils]: 5: Hoare triple {60#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {60#true} is VALID [2018-11-14 18:16:07,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {60#true} assume !true; {61#false} is VALID [2018-11-14 18:16:07,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {61#false} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {61#false} is VALID [2018-11-14 18:16:07,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {61#false} assume true; {61#false} is VALID [2018-11-14 18:16:07,892 INFO L273 TraceCheckUtils]: 9: Hoare triple {61#false} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {61#false} is VALID [2018-11-14 18:16:07,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {61#false} assume !false; {61#false} is VALID [2018-11-14 18:16:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:16:07,896 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 18:16:07,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:16:07,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:16:07,907 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 18:16:07,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:16:07,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:16:08,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:16:08,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:16:08,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:16:08,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:16:08,060 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-11-14 18:16:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:08,861 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2018-11-14 18:16:08,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:16:08,865 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 18:16:08,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:16:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:16:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2018-11-14 18:16:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:16:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2018-11-14 18:16:08,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 166 transitions. [2018-11-14 18:16:09,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:16:09,333 INFO L225 Difference]: With dead ends: 108 [2018-11-14 18:16:09,333 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 18:16:09,337 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:16:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 18:16:09,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-14 18:16:09,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:16:09,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-14 18:16:09,380 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-14 18:16:09,380 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-14 18:16:09,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:09,386 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-14 18:16:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-14 18:16:09,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:16:09,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:16:09,387 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-14 18:16:09,387 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-14 18:16:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:09,393 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-14 18:16:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-14 18:16:09,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:16:09,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:16:09,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:16:09,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:16:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 18:16:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-14 18:16:09,400 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-11-14 18:16:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:16:09,401 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-14 18:16:09,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:16:09,401 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-14 18:16:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 18:16:09,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:16:09,402 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:16:09,402 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:16:09,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:16:09,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1145447806, now seen corresponding path program 1 times [2018-11-14 18:16:09,403 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:16:09,403 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:16:09,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:16:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:09,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:16:09,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {366#true} call ULTIMATE.init(); {366#true} is VALID [2018-11-14 18:16:09,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {366#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {366#true} is VALID [2018-11-14 18:16:09,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-14 18:16:09,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} #201#return; {366#true} is VALID [2018-11-14 18:16:09,821 INFO L256 TraceCheckUtils]: 4: Hoare triple {366#true} call #t~ret20 := main(); {366#true} is VALID [2018-11-14 18:16:09,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {366#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {386#(not (= (_ bv0 32) main_~list~0.base))} is VALID [2018-11-14 18:16:09,845 INFO L273 TraceCheckUtils]: 6: Hoare triple {386#(not (= (_ bv0 32) main_~list~0.base))} assume true; {386#(not (= (_ bv0 32) main_~list~0.base))} is VALID [2018-11-14 18:16:09,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {386#(not (= (_ bv0 32) main_~list~0.base))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {386#(not (= (_ bv0 32) main_~list~0.base))} is VALID [2018-11-14 18:16:09,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {386#(not (= (_ bv0 32) main_~list~0.base))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {396#(not (= (_ bv0 32) main_~end~0.base))} is VALID [2018-11-14 18:16:09,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {396#(not (= (_ bv0 32) main_~end~0.base))} assume true; {396#(not (= (_ bv0 32) main_~end~0.base))} is VALID [2018-11-14 18:16:09,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {396#(not (= (_ bv0 32) main_~end~0.base))} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {367#false} is VALID [2018-11-14 18:16:09,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {367#false} assume !false; {367#false} is VALID [2018-11-14 18:16:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:16:09,882 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:16:09,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:16:09,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:16:09,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 18:16:09,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:16:09,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:16:09,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:16:09,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:16:09,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:16:09,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:16:09,911 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 4 states. [2018-11-14 18:16:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:10,498 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-14 18:16:10,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:16:10,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 18:16:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:16:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:16:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2018-11-14 18:16:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:16:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2018-11-14 18:16:10,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2018-11-14 18:16:10,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:16:10,632 INFO L225 Difference]: With dead ends: 53 [2018-11-14 18:16:10,632 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 18:16:10,633 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:16:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 18:16:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-14 18:16:10,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:16:10,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 45 states. [2018-11-14 18:16:10,699 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 45 states. [2018-11-14 18:16:10,699 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 45 states. [2018-11-14 18:16:10,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:10,703 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 18:16:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 18:16:10,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:16:10,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:16:10,705 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 49 states. [2018-11-14 18:16:10,705 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 49 states. [2018-11-14 18:16:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:10,708 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 18:16:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 18:16:10,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:16:10,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:16:10,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:16:10,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:16:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 18:16:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-14 18:16:10,713 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 12 [2018-11-14 18:16:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:16:10,714 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-14 18:16:10,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:16:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-14 18:16:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 18:16:10,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:16:10,715 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:16:10,715 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:16:10,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:16:10,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1145509372, now seen corresponding path program 1 times [2018-11-14 18:16:10,717 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:16:10,717 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:16:10,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:16:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:10,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:16:10,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-14 18:16:10,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 18:16:10,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:11,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-14 18:16:11,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-14 18:16:11,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:11,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:16:11,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 34 [2018-11-14 18:16:11,338 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-14 18:16:11,402 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:16:11,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:16:11,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-14 18:16:11,511 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 [2018-11-14 18:16:11,541 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:16:11,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 18:16:11,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-14 18:16:11,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:11,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:11,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:11,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-14 18:16:11,756 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:16:11,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {617#true} call ULTIMATE.init(); {617#true} is VALID [2018-11-14 18:16:11,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {617#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {617#true} is VALID [2018-11-14 18:16:11,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {617#true} assume true; {617#true} is VALID [2018-11-14 18:16:11,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {617#true} {617#true} #201#return; {617#true} is VALID [2018-11-14 18:16:11,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {617#true} call #t~ret20 := main(); {617#true} is VALID [2018-11-14 18:16:11,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {617#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {617#true} is VALID [2018-11-14 18:16:11,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {617#true} assume true; {617#true} is VALID [2018-11-14 18:16:11,767 INFO L273 TraceCheckUtils]: 7: Hoare triple {617#true} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32); {617#true} is VALID [2018-11-14 18:16:11,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {617#true} assume !(#t~nondet5 != 0bv32);havoc #t~nondet5;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {646#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:16:11,777 INFO L273 TraceCheckUtils]: 9: Hoare triple {646#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} assume true;call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {650#(= ~unnamed1~0~BLACK |main_#t~mem9|)} is VALID [2018-11-14 18:16:11,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {650#(= ~unnamed1~0~BLACK |main_#t~mem9|)} assume !(~unnamed1~0~BLACK == #t~mem9);havoc #t~mem9; {618#false} is VALID [2018-11-14 18:16:11,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {618#false} assume !false; {618#false} is VALID [2018-11-14 18:16:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:16:11,779 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:16:11,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:16:11,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:16:11,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 18:16:11,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:16:11,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:16:11,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:16:11,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:16:11,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:16:11,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:16:11,812 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2018-11-14 18:16:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:12,453 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-14 18:16:12,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:16:12,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 18:16:12,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:16:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:16:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2018-11-14 18:16:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:16:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2018-11-14 18:16:12,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2018-11-14 18:16:12,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:16:12,560 INFO L225 Difference]: With dead ends: 45 [2018-11-14 18:16:12,561 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 18:16:12,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:16:12,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 18:16:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-14 18:16:12,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:16:12,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-14 18:16:12,591 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 18:16:12,591 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 18:16:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:12,594 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-14 18:16:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-14 18:16:12,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:16:12,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:16:12,595 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 18:16:12,596 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 18:16:12,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:12,600 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-14 18:16:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-14 18:16:12,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:16:12,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:16:12,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:16:12,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:16:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 18:16:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-14 18:16:12,604 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 12 [2018-11-14 18:16:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:16:12,605 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-14 18:16:12,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:16:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-14 18:16:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 18:16:12,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:16:12,606 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:16:12,607 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:16:12,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:16:12,607 INFO L82 PathProgramCache]: Analyzing trace with hash -516417822, now seen corresponding path program 1 times [2018-11-14 18:16:12,607 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:16:12,608 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:16:12,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:16:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:12,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:16:12,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 18:16:12,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 18:16:12,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:12,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:12,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:12,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-14 18:16:12,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:16:12,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:16:12,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:12,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:12,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:12,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 18:16:12,928 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:16:12,938 INFO L256 TraceCheckUtils]: 0: Hoare triple {846#true} call ULTIMATE.init(); {846#true} is VALID [2018-11-14 18:16:12,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {846#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {846#true} is VALID [2018-11-14 18:16:12,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {846#true} assume true; {846#true} is VALID [2018-11-14 18:16:12,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {846#true} {846#true} #201#return; {846#true} is VALID [2018-11-14 18:16:12,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {846#true} call #t~ret20 := main(); {846#true} is VALID [2018-11-14 18:16:12,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {846#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {866#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:12,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {866#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true; {866#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:12,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {866#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {866#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:12,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {866#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {876#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:12,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {876#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} assume true; {876#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:12,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {876#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {876#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:12,950 INFO L273 TraceCheckUtils]: 11: Hoare triple {876#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} assume true; {876#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:12,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {876#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} assume true;call #t~mem11 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {889#(= ~unnamed1~0~BLACK |main_#t~mem11|)} is VALID [2018-11-14 18:16:12,952 INFO L273 TraceCheckUtils]: 13: Hoare triple {889#(= ~unnamed1~0~BLACK |main_#t~mem11|)} assume !(~unnamed1~0~BLACK == #t~mem11);havoc #t~mem11; {847#false} is VALID [2018-11-14 18:16:12,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {847#false} assume !false; {847#false} is VALID [2018-11-14 18:16:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:16:12,956 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:16:12,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:16:12,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:16:12,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 18:16:12,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:16:12,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:16:12,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:16:12,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:16:12,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:16:12,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:16:12,977 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 5 states. [2018-11-14 18:16:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:14,479 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2018-11-14 18:16:14,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:16:14,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 18:16:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:16:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:16:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-14 18:16:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:16:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-14 18:16:14,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2018-11-14 18:16:14,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:16:14,677 INFO L225 Difference]: With dead ends: 87 [2018-11-14 18:16:14,677 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 18:16:14,678 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:16:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 18:16:14,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2018-11-14 18:16:14,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:16:14,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 61 states. [2018-11-14 18:16:14,710 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 61 states. [2018-11-14 18:16:14,710 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 61 states. [2018-11-14 18:16:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:14,714 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-11-14 18:16:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2018-11-14 18:16:14,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:16:14,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:16:14,716 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 85 states. [2018-11-14 18:16:14,716 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 85 states. [2018-11-14 18:16:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:14,720 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-11-14 18:16:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2018-11-14 18:16:14,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:16:14,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:16:14,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:16:14,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:16:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-14 18:16:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-11-14 18:16:14,725 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 15 [2018-11-14 18:16:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:16:14,726 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-11-14 18:16:14,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:16:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-11-14 18:16:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 18:16:14,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:16:14,727 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:16:14,728 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:16:14,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:16:14,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1944375202, now seen corresponding path program 1 times [2018-11-14 18:16:14,729 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:16:14,729 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:16:14,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:16:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:14,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:16:14,978 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-11-14 18:16:14,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 40 [2018-11-14 18:16:15,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:16:15,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:15,560 INFO L303 Elim1Store]: Index analysis took 426 ms [2018-11-14 18:16:15,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2018-11-14 18:16:15,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-11-14 18:16:15,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:17,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-11-14 18:16:17,580 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-14 18:16:19,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 41 [2018-11-14 18:16:19,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-14 18:16:19,152 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:19,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 34 [2018-11-14 18:16:19,604 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-14 18:16:19,986 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:16:20,117 INFO L303 Elim1Store]: Index analysis took 129 ms [2018-11-14 18:16:20,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-11-14 18:16:20,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-14 18:16:20,195 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:20,583 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:16:20,612 INFO L303 Elim1Store]: Index analysis took 110 ms [2018-11-14 18:16:20,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 46 [2018-11-14 18:16:20,833 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-11-14 18:16:21,365 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:16:24,488 INFO L303 Elim1Store]: Index analysis took 251 ms [2018-11-14 18:16:24,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 case distinctions, treesize of input 28 treesize of output 55 [2018-11-14 18:16:24,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-11-14 18:16:24,650 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:25,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-11-14 18:16:25,839 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-14 18:16:26,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:16:26,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 46 [2018-11-14 18:16:26,855 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-11-14 18:16:31,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 47 [2018-11-14 18:16:31,347 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-14 18:16:32,293 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-14 18:16:34,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-14 18:16:34,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-14 18:16:35,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 40 [2018-11-14 18:16:35,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:16:35,199 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:35,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2018-11-14 18:16:35,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-11-14 18:16:35,387 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:35,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-14 18:16:35,803 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:36,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-11-14 18:16:36,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-14 18:16:36,235 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:36,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 40 [2018-11-14 18:16:36,619 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-11-14 18:16:36,937 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:16:37,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 case distinctions, treesize of input 28 treesize of output 55 [2018-11-14 18:16:37,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 35 [2018-11-14 18:16:37,589 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-14 18:16:38,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-11-14 18:16:38,258 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-11-14 18:16:38,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-14 18:16:38,561 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:38,819 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:16:38,827 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-11-14 18:16:38,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 43 [2018-11-14 18:16:38,925 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 4 xjuncts. [2018-11-14 18:16:39,118 INFO L267 ElimStorePlain]: Start of recursive call 26: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:16:39,478 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:16:39,624 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:16:40,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 18 xjuncts. [2018-11-14 18:16:40,207 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 6 variables, input treesize:127, output treesize:631 [2018-11-14 18:16:42,319 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:16:42,591 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 12 [2018-11-14 18:16:42,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:16:42,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:16:42,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:42,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:42,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:16:42,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:16:42,646 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:42,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:42,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:42,655 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-14 18:16:42,660 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:16:42,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {1237#true} call ULTIMATE.init(); {1237#true} is VALID [2018-11-14 18:16:42,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {1237#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1237#true} is VALID [2018-11-14 18:16:42,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {1237#true} assume true; {1237#true} is VALID [2018-11-14 18:16:42,675 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1237#true} {1237#true} #201#return; {1237#true} is VALID [2018-11-14 18:16:42,675 INFO L256 TraceCheckUtils]: 4: Hoare triple {1237#true} call #t~ret20 := main(); {1237#true} is VALID [2018-11-14 18:16:42,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {1237#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1237#true} is VALID [2018-11-14 18:16:42,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {1237#true} assume true; {1237#true} is VALID [2018-11-14 18:16:42,676 INFO L273 TraceCheckUtils]: 7: Hoare triple {1237#true} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32); {1237#true} is VALID [2018-11-14 18:16:42,696 INFO L273 TraceCheckUtils]: 8: Hoare triple {1237#true} assume !(#t~nondet5 != 0bv32);havoc #t~nondet5;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1266#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:16:42,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {1266#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume true;call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1266#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:16:42,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {1266#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(~unnamed1~0~BLACK == #t~mem9);havoc #t~mem9; {1266#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:16:42,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {1266#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume true; {1266#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:16:42,722 INFO L273 TraceCheckUtils]: 12: Hoare triple {1266#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume true;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); {1279#(and (= |main_#t~mem10.offset| (_ bv0 32)) (= |main_#t~mem10.base| (_ bv0 32)))} is VALID [2018-11-14 18:16:42,723 INFO L273 TraceCheckUtils]: 13: Hoare triple {1279#(and (= |main_#t~mem10.offset| (_ bv0 32)) (= |main_#t~mem10.base| (_ bv0 32)))} assume !(0bv32 == #t~mem10.base && 0bv32 == #t~mem10.offset);havoc #t~mem10.base, #t~mem10.offset; {1238#false} is VALID [2018-11-14 18:16:42,723 INFO L273 TraceCheckUtils]: 14: Hoare triple {1238#false} assume !false; {1238#false} is VALID [2018-11-14 18:16:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:16:42,724 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:16:42,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:16:42,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:16:42,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 18:16:42,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:16:42,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:16:42,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:16:42,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:16:42,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:16:42,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:16:42,833 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 4 states. [2018-11-14 18:16:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:43,800 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-11-14 18:16:43,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:16:43,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 18:16:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:16:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:16:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2018-11-14 18:16:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:16:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2018-11-14 18:16:43,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2018-11-14 18:16:43,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:16:43,864 INFO L225 Difference]: With dead ends: 61 [2018-11-14 18:16:43,864 INFO L226 Difference]: Without dead ends: 59 [2018-11-14 18:16:43,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:16:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-14 18:16:43,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-14 18:16:43,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:16:43,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-14 18:16:43,971 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-14 18:16:43,971 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-14 18:16:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:43,974 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-11-14 18:16:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-11-14 18:16:43,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:16:43,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:16:43,975 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-14 18:16:43,975 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-14 18:16:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:43,977 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-11-14 18:16:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-11-14 18:16:43,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:16:43,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:16:43,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:16:43,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:16:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 18:16:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-11-14 18:16:43,981 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 15 [2018-11-14 18:16:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:16:43,981 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-11-14 18:16:43,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:16:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-11-14 18:16:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 18:16:43,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:16:43,982 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:16:43,983 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:16:43,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:16:43,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2064999472, now seen corresponding path program 1 times [2018-11-14 18:16:43,983 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:16:43,984 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:16:44,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:16:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:44,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:16:44,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 18:16:44,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-14 18:16:44,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:44,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:44,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:44,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-14 18:16:44,152 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:16:44,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {1543#true} call ULTIMATE.init(); {1543#true} is VALID [2018-11-14 18:16:44,163 INFO L273 TraceCheckUtils]: 1: Hoare triple {1543#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1543#true} is VALID [2018-11-14 18:16:44,163 INFO L273 TraceCheckUtils]: 2: Hoare triple {1543#true} assume true; {1543#true} is VALID [2018-11-14 18:16:44,164 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1543#true} {1543#true} #201#return; {1543#true} is VALID [2018-11-14 18:16:44,164 INFO L256 TraceCheckUtils]: 4: Hoare triple {1543#true} call #t~ret20 := main(); {1543#true} is VALID [2018-11-14 18:16:44,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {1543#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1543#true} is VALID [2018-11-14 18:16:44,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {1543#true} assume true; {1543#true} is VALID [2018-11-14 18:16:44,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {1543#true} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1543#true} is VALID [2018-11-14 18:16:44,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {1543#true} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1543#true} is VALID [2018-11-14 18:16:44,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {1543#true} assume true; {1543#true} is VALID [2018-11-14 18:16:44,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {1543#true} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1543#true} is VALID [2018-11-14 18:16:44,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {1543#true} assume true; {1543#true} is VALID [2018-11-14 18:16:44,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {1543#true} assume true;call #t~mem11 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1584#(= |main_#t~mem11| (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:16:44,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {1584#(= |main_#t~mem11| (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} assume !!(~unnamed1~0~BLACK == #t~mem11);havoc #t~mem11; {1588#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:16:44,172 INFO L273 TraceCheckUtils]: 14: Hoare triple {1588#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} assume true; {1588#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:16:44,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {1588#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} assume true; {1588#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:16:44,172 INFO L273 TraceCheckUtils]: 16: Hoare triple {1588#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset);call #t~mem12 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1598#(= ~unnamed1~0~BLACK |main_#t~mem12|)} is VALID [2018-11-14 18:16:44,173 INFO L273 TraceCheckUtils]: 17: Hoare triple {1598#(= ~unnamed1~0~BLACK |main_#t~mem12|)} assume ~unnamed1~0~RED == #t~mem12;havoc #t~mem12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {1544#false} is VALID [2018-11-14 18:16:44,173 INFO L273 TraceCheckUtils]: 18: Hoare triple {1544#false} assume true; {1544#false} is VALID [2018-11-14 18:16:44,174 INFO L273 TraceCheckUtils]: 19: Hoare triple {1544#false} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1544#false} is VALID [2018-11-14 18:16:44,174 INFO L273 TraceCheckUtils]: 20: Hoare triple {1544#false} assume !false; {1544#false} is VALID [2018-11-14 18:16:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:16:44,175 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:16:44,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:16:44,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:16:44,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 18:16:44,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:16:44,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:16:44,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:16:44,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:16:44,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:16:44,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:16:44,233 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 5 states. [2018-11-14 18:16:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:45,604 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-11-14 18:16:45,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:16:45,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 18:16:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:16:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:16:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-14 18:16:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:16:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-14 18:16:45,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-14 18:16:45,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:16:45,684 INFO L225 Difference]: With dead ends: 77 [2018-11-14 18:16:45,685 INFO L226 Difference]: Without dead ends: 63 [2018-11-14 18:16:45,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:16:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-14 18:16:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-14 18:16:45,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:16:45,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2018-11-14 18:16:45,750 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2018-11-14 18:16:45,750 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2018-11-14 18:16:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:45,754 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-14 18:16:45,754 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-14 18:16:45,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:16:45,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:16:45,755 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2018-11-14 18:16:45,755 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2018-11-14 18:16:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:45,758 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-14 18:16:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-14 18:16:45,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:16:45,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:16:45,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:16:45,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:16:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 18:16:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-11-14 18:16:45,762 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 21 [2018-11-14 18:16:45,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:16:45,762 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-11-14 18:16:45,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:16:45,762 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-11-14 18:16:45,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:16:45,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:16:45,763 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:16:45,763 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:16:45,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:16:45,763 INFO L82 PathProgramCache]: Analyzing trace with hash 48207544, now seen corresponding path program 1 times [2018-11-14 18:16:45,763 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:16:45,764 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:16:45,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:16:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:45,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:16:45,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 18:16:45,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-14 18:16:45,896 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:16:45,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-14 18:16:45,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:45,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:45,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:45,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 18:16:45,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-14 18:16:45,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:16:45,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-14 18:16:45,981 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:45,990 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:45,997 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:46,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:46,015 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:36, output treesize:36 [2018-11-14 18:16:46,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-14 18:16:46,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-14 18:16:46,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:46,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:46,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-14 18:16:46,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-14 18:16:46,298 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:46,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:46,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:46,310 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-14 18:16:46,316 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:16:46,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {1896#true} call ULTIMATE.init(); {1896#true} is VALID [2018-11-14 18:16:46,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {1896#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1896#true} is VALID [2018-11-14 18:16:46,336 INFO L273 TraceCheckUtils]: 2: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-14 18:16:46,337 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1896#true} {1896#true} #201#return; {1896#true} is VALID [2018-11-14 18:16:46,337 INFO L256 TraceCheckUtils]: 4: Hoare triple {1896#true} call #t~ret20 := main(); {1896#true} is VALID [2018-11-14 18:16:46,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {1896#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1916#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:46,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {1916#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume true; {1916#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:46,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {1916#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1916#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:46,345 INFO L273 TraceCheckUtils]: 8: Hoare triple {1916#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:16:46,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} assume true; {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:16:46,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:16:46,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} assume true; {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:16:46,349 INFO L273 TraceCheckUtils]: 12: Hoare triple {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} assume true;call #t~mem11 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:16:46,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!(~unnamed1~0~BLACK == #t~mem11);havoc #t~mem11; {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:16:46,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} assume true; {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:16:46,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} assume true; {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:16:46,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset);call #t~mem12 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:16:46,354 INFO L273 TraceCheckUtils]: 17: Hoare triple {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} assume !(~unnamed1~0~RED == #t~mem12);havoc #t~mem12; {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:16:46,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {1926#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))) (_ bv0 32)))} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1957#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:46,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {1957#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} assume true; {1957#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:46,364 INFO L273 TraceCheckUtils]: 20: Hoare triple {1957#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset);call #t~mem12 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1897#false} is VALID [2018-11-14 18:16:46,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {1897#false} assume ~unnamed1~0~RED == #t~mem12;havoc #t~mem12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {1897#false} is VALID [2018-11-14 18:16:46,364 INFO L273 TraceCheckUtils]: 22: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 18:16:46,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {1897#false} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1897#false} is VALID [2018-11-14 18:16:46,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {1897#false} assume !false; {1897#false} is VALID [2018-11-14 18:16:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:16:46,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:16:46,639 INFO L273 TraceCheckUtils]: 24: Hoare triple {1897#false} assume !false; {1897#false} is VALID [2018-11-14 18:16:46,639 INFO L273 TraceCheckUtils]: 23: Hoare triple {1897#false} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1897#false} is VALID [2018-11-14 18:16:46,640 INFO L273 TraceCheckUtils]: 22: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 18:16:46,640 INFO L273 TraceCheckUtils]: 21: Hoare triple {1897#false} assume ~unnamed1~0~RED == #t~mem12;havoc #t~mem12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {1897#false} is VALID [2018-11-14 18:16:46,648 INFO L273 TraceCheckUtils]: 20: Hoare triple {1957#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset);call #t~mem12 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1897#false} is VALID [2018-11-14 18:16:46,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {1957#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} assume true; {1957#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:46,649 INFO L273 TraceCheckUtils]: 18: Hoare triple {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1957#(and (= (_ bv0 32) main_~end~0.base) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:46,650 INFO L273 TraceCheckUtils]: 17: Hoare triple {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !(~unnamed1~0~RED == #t~mem12);havoc #t~mem12; {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:16:46,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset);call #t~mem12 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:16:46,651 INFO L273 TraceCheckUtils]: 15: Hoare triple {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume true; {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:16:46,660 INFO L273 TraceCheckUtils]: 14: Hoare triple {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume true; {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:16:46,673 INFO L273 TraceCheckUtils]: 13: Hoare triple {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(~unnamed1~0~BLACK == #t~mem11);havoc #t~mem11; {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:16:46,686 INFO L273 TraceCheckUtils]: 12: Hoare triple {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume true;call #t~mem11 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:16:46,699 INFO L273 TraceCheckUtils]: 11: Hoare triple {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume true; {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:16:46,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:16:46,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume true; {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:16:46,708 INFO L273 TraceCheckUtils]: 8: Hoare triple {2025#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1994#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 18:16:46,714 INFO L273 TraceCheckUtils]: 7: Hoare triple {2025#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {2025#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 18:16:46,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {2025#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} assume true; {2025#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 18:16:46,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {1896#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2025#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 18:16:46,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {1896#true} call #t~ret20 := main(); {1896#true} is VALID [2018-11-14 18:16:46,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1896#true} {1896#true} #201#return; {1896#true} is VALID [2018-11-14 18:16:46,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-14 18:16:46,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {1896#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1896#true} is VALID [2018-11-14 18:16:46,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {1896#true} call ULTIMATE.init(); {1896#true} is VALID [2018-11-14 18:16:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:16:46,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:16:46,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-14 18:16:46,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-14 18:16:46,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:16:46,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:16:46,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:16:46,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:16:46,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:16:46,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:16:46,795 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 7 states. [2018-11-14 18:16:48,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:48,839 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-11-14 18:16:48,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:16:48,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-14 18:16:48,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:16:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:16:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2018-11-14 18:16:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:16:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2018-11-14 18:16:48,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2018-11-14 18:16:48,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:16:48,958 INFO L225 Difference]: With dead ends: 91 [2018-11-14 18:16:48,958 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 18:16:48,959 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:16:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 18:16:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-14 18:16:48,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:16:48,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-14 18:16:48,995 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-14 18:16:48,995 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-14 18:16:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:48,998 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-11-14 18:16:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-11-14 18:16:48,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:16:48,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:16:48,999 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-14 18:16:48,999 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-14 18:16:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:16:49,001 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-11-14 18:16:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-11-14 18:16:49,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:16:49,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:16:49,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:16:49,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:16:49,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 18:16:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-11-14 18:16:49,004 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 25 [2018-11-14 18:16:49,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:16:49,005 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-11-14 18:16:49,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:16:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-11-14 18:16:49,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:16:49,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:16:49,005 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:16:49,006 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:16:49,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:16:49,006 INFO L82 PathProgramCache]: Analyzing trace with hash 256789345, now seen corresponding path program 1 times [2018-11-14 18:16:49,007 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:16:49,007 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:16:49,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:16:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:16:49,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:16:49,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 18:16:49,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:49,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 18:16:49,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 18:16:49,207 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:49,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:49,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:49,225 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2018-11-14 18:16:49,241 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:16:49,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:16:49,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:16:49,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-14 18:16:49,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:49,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-14 18:16:49,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:16:49,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:49,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:16:49,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:16:49,504 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:49,508 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:49,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:49,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:49,536 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:62, output treesize:27 [2018-11-14 18:16:49,548 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:16:49,687 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:16:49,730 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:16:49,774 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:16:49,775 INFO L303 Elim1Store]: Index analysis took 171 ms [2018-11-14 18:16:49,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 18:16:49,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:49,970 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 110 [2018-11-14 18:16:50,975 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-14 18:16:50,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:16:51,002 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:51,087 INFO L477 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 101 treesize of output 97 [2018-11-14 18:16:51,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2018-11-14 18:16:51,133 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:51,144 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:51,157 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:51,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 91 [2018-11-14 18:16:51,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 18:16:51,368 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:51,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:16:51,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:16:51,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 123 [2018-11-14 18:16:51,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-14 18:16:51,458 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:51,484 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:51,503 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:51,562 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-11-14 18:16:51,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:16:51,702 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:51,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 18:16:51,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-14 18:16:51,740 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:51,747 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:51,756 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:51,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-14 18:16:51,801 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:149, output treesize:41 [2018-11-14 18:16:51,944 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:16:52,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2018-11-14 18:16:52,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:16:52,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:52,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-14 18:16:52,988 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:53,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-14 18:16:53,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:53,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:53,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:53,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2018-11-14 18:16:53,043 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:16:53,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {2361#true} call ULTIMATE.init(); {2361#true} is VALID [2018-11-14 18:16:53,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {2361#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2361#true} is VALID [2018-11-14 18:16:53,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {2361#true} assume true; {2361#true} is VALID [2018-11-14 18:16:53,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2361#true} {2361#true} #201#return; {2361#true} is VALID [2018-11-14 18:16:53,087 INFO L256 TraceCheckUtils]: 4: Hoare triple {2361#true} call #t~ret20 := main(); {2361#true} is VALID [2018-11-14 18:16:53,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {2361#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2381#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,091 INFO L273 TraceCheckUtils]: 6: Hoare triple {2381#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.offset (_ bv0 32)))} assume true; {2381#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {2381#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.offset (_ bv0 32)))} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32); {2388#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= (_ bv1 1) (select |#valid| main_~end~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,106 INFO L273 TraceCheckUtils]: 8: Hoare triple {2388#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= (_ bv1 1) (select |#valid| main_~end~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.offset (_ bv0 32)))} assume !(#t~nondet5 != 0bv32);havoc #t~nondet5;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true;call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,109 INFO L273 TraceCheckUtils]: 10: Hoare triple {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !!(~unnamed1~0~BLACK == #t~mem9);havoc #t~mem9; {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true; {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !!(0bv32 == #t~mem10.base && 0bv32 == #t~mem10.offset);havoc #t~mem10.base, #t~mem10.offset; {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,118 INFO L273 TraceCheckUtils]: 14: Hoare triple {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true; {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,120 INFO L273 TraceCheckUtils]: 15: Hoare triple {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true; {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,122 INFO L273 TraceCheckUtils]: 16: Hoare triple {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,124 INFO L273 TraceCheckUtils]: 17: Hoare triple {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true; {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,126 INFO L273 TraceCheckUtils]: 18: Hoare triple {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true; {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,128 INFO L273 TraceCheckUtils]: 19: Hoare triple {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:16:53,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {2392#(and (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~list~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2429#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)) (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~end~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))))} is VALID [2018-11-14 18:16:53,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {2429#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)) (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~end~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))))} assume true; {2429#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)) (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~end~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))))} is VALID [2018-11-14 18:16:53,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {2429#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)) (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~end~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {2429#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)) (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~end~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))))} is VALID [2018-11-14 18:16:53,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {2429#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)) (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~end~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))))} assume true; {2429#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)) (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~end~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))))} is VALID [2018-11-14 18:16:53,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {2429#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)) (exists ((v_main_~end~0.base_35 (_ BitVec 32)) (|main_#t~malloc6.base| (_ BitVec 32)) (v_main_~end~0.offset_35 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc6.base|) (_ bv8 32)) ~unnamed1~0~BLACK) (not (= v_main_~end~0.base_35 main_~end~0.base)) (not (= |main_#t~malloc6.base| v_main_~end~0.base_35)) (not (= |main_#t~malloc6.base| main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_35) (bvadd v_main_~end~0.offset_35 (_ bv8 32)))))))} assume true;call #t~mem11 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {2442#(= ~unnamed1~0~BLACK |main_#t~mem11|)} is VALID [2018-11-14 18:16:53,146 INFO L273 TraceCheckUtils]: 25: Hoare triple {2442#(= ~unnamed1~0~BLACK |main_#t~mem11|)} assume !(~unnamed1~0~BLACK == #t~mem11);havoc #t~mem11; {2362#false} is VALID [2018-11-14 18:16:53,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {2362#false} assume !false; {2362#false} is VALID [2018-11-14 18:16:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:16:53,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:16:55,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 117 [2018-11-14 18:16:57,705 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-14 18:16:57,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:16:57,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:57,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-14 18:16:57,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-14 18:16:57,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:58,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:58,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 104 [2018-11-14 18:16:58,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 93 [2018-11-14 18:16:58,057 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:58,075 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:58,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:16:58,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 74 [2018-11-14 18:16:58,731 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2018-11-14 18:16:58,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:16:58,740 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:58,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-14 18:16:58,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-11-14 18:16:58,787 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:58,796 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:58,817 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:58,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-11-14 18:16:58,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:16:58,961 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:58,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-14 18:16:59,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-11-14 18:16:59,007 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:59,016 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:59,040 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:59,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 83 [2018-11-14 18:16:59,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:16:59,162 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:59,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-14 18:16:59,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-14 18:16:59,209 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-14 18:16:59,214 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:59,234 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:16:59,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-14 18:16:59,335 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:130, output treesize:121 [2018-11-14 18:16:59,519 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:28,081 WARN L179 SmtUtils]: Spent 17.48 s on a formula simplification that was a NOOP. DAG size: 59 [2018-11-14 18:17:28,582 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 18:17:28,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:28,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 118 [2018-11-14 18:17:29,144 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2018-11-14 18:17:29,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:17:29,153 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:29,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-11-14 18:17:29,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2018-11-14 18:17:29,203 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:29,210 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:29,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:29,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 123 [2018-11-14 18:17:29,780 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-11-14 18:17:29,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:17:29,790 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:29,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-11-14 18:17:29,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2018-11-14 18:17:29,860 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:29,871 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:29,911 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:17:30,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-11-14 18:17:30,018 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 16 variables, input treesize:508, output treesize:112 [2018-11-14 18:17:32,063 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:17:43,005 WARN L179 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2018-11-14 18:17:43,057 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-14 18:17:43,057 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:89, output treesize:1 [2018-11-14 18:17:43,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {2362#false} assume !false; {2362#false} is VALID [2018-11-14 18:17:43,068 INFO L273 TraceCheckUtils]: 25: Hoare triple {2442#(= ~unnamed1~0~BLACK |main_#t~mem11|)} assume !(~unnamed1~0~BLACK == #t~mem11);havoc #t~mem11; {2362#false} is VALID [2018-11-14 18:17:43,068 INFO L273 TraceCheckUtils]: 24: Hoare triple {2455#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} assume true;call #t~mem11 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {2442#(= ~unnamed1~0~BLACK |main_#t~mem11|)} is VALID [2018-11-14 18:17:43,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {2455#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} assume true; {2455#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {2455#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {2455#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {2455#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} assume true; {2455#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2455#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} assume true; {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,072 INFO L273 TraceCheckUtils]: 17: Hoare triple {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} assume true; {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,072 INFO L273 TraceCheckUtils]: 16: Hoare triple {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,073 INFO L273 TraceCheckUtils]: 15: Hoare triple {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} assume true; {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} assume true; {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} assume !!(0bv32 == #t~mem10.base && 0bv32 == #t~mem10.offset);havoc #t~mem10.base, #t~mem10.offset; {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,075 INFO L273 TraceCheckUtils]: 12: Hoare triple {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} assume true;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} assume true; {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,083 INFO L273 TraceCheckUtils]: 10: Hoare triple {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} assume !!(~unnamed1~0~BLACK == #t~mem9);havoc #t~mem9; {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,084 INFO L273 TraceCheckUtils]: 9: Hoare triple {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} assume true;call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {2505#(and (forall ((v_prenex_20 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd v_prenex_19 (_ bv8 32)) ~unnamed1~0~RED)) v_prenex_20 (store (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd v_prenex_19 (_ bv8 32)) ~unnamed1~0~RED)) v_prenex_20) (_ bv8 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (not (= (select |#valid| v_prenex_20) (_ bv0 1))) (= v_prenex_20 main_~end~0.base))) (forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc6.base_2| (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2| (store (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2|) (_ bv8 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (not (= (select |#valid| |v_main_#t~malloc6.base_2|) (_ bv0 1))) (= (bvadd main_~end~0.offset (_ bv4294967292 32)) (_ bv0 32)))) (or (not (= (_ bv0 1) (select |#valid| main_~end~0.base))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (_ bv12 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))))} assume !(#t~nondet5 != 0bv32);havoc #t~nondet5;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {2468#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))} is VALID [2018-11-14 18:17:43,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {2509#(forall ((v_prenex_20 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| v_prenex_25 (store (select |#memory_int| v_prenex_25) (bvadd v_prenex_19 (_ bv8 32)) ~unnamed1~0~RED)) v_prenex_20 (store (select (store |#memory_int| v_prenex_25 (store (select |#memory_int| v_prenex_25) (bvadd v_prenex_19 (_ bv8 32)) ~unnamed1~0~RED)) v_prenex_20) (_ bv8 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (not (= (select |#valid| v_prenex_25) (_ bv0 1))) (not (= (select (store |#valid| v_prenex_25 (_ bv1 1)) v_prenex_20) (_ bv0 1)))))} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32); {2505#(and (forall ((v_prenex_20 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd v_prenex_19 (_ bv8 32)) ~unnamed1~0~RED)) v_prenex_20 (store (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd v_prenex_19 (_ bv8 32)) ~unnamed1~0~RED)) v_prenex_20) (_ bv8 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (not (= (select |#valid| v_prenex_20) (_ bv0 1))) (= v_prenex_20 main_~end~0.base))) (forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc6.base_2| (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2| (store (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2|) (_ bv8 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (not (= (select |#valid| |v_main_#t~malloc6.base_2|) (_ bv0 1))) (= (bvadd main_~end~0.offset (_ bv4294967292 32)) (_ bv0 32)))) (or (not (= (_ bv0 1) (select |#valid| main_~end~0.base))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (_ bv12 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))))} is VALID [2018-11-14 18:17:43,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {2509#(forall ((v_prenex_20 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| v_prenex_25 (store (select |#memory_int| v_prenex_25) (bvadd v_prenex_19 (_ bv8 32)) ~unnamed1~0~RED)) v_prenex_20 (store (select (store |#memory_int| v_prenex_25 (store (select |#memory_int| v_prenex_25) (bvadd v_prenex_19 (_ bv8 32)) ~unnamed1~0~RED)) v_prenex_20) (_ bv8 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (not (= (select |#valid| v_prenex_25) (_ bv0 1))) (not (= (select (store |#valid| v_prenex_25 (_ bv1 1)) v_prenex_20) (_ bv0 1)))))} assume true; {2509#(forall ((v_prenex_20 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| v_prenex_25 (store (select |#memory_int| v_prenex_25) (bvadd v_prenex_19 (_ bv8 32)) ~unnamed1~0~RED)) v_prenex_20 (store (select (store |#memory_int| v_prenex_25 (store (select |#memory_int| v_prenex_25) (bvadd v_prenex_19 (_ bv8 32)) ~unnamed1~0~RED)) v_prenex_20) (_ bv8 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (not (= (select |#valid| v_prenex_25) (_ bv0 1))) (not (= (select (store |#valid| v_prenex_25 (_ bv1 1)) v_prenex_20) (_ bv0 1)))))} is VALID [2018-11-14 18:17:43,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {2361#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2509#(forall ((v_prenex_20 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| v_prenex_25 (store (select |#memory_int| v_prenex_25) (bvadd v_prenex_19 (_ bv8 32)) ~unnamed1~0~RED)) v_prenex_20 (store (select (store |#memory_int| v_prenex_25 (store (select |#memory_int| v_prenex_25) (bvadd v_prenex_19 (_ bv8 32)) ~unnamed1~0~RED)) v_prenex_20) (_ bv8 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (not (= (select |#valid| v_prenex_25) (_ bv0 1))) (not (= (select (store |#valid| v_prenex_25 (_ bv1 1)) v_prenex_20) (_ bv0 1)))))} is VALID [2018-11-14 18:17:43,155 INFO L256 TraceCheckUtils]: 4: Hoare triple {2361#true} call #t~ret20 := main(); {2361#true} is VALID [2018-11-14 18:17:43,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2361#true} {2361#true} #201#return; {2361#true} is VALID [2018-11-14 18:17:43,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {2361#true} assume true; {2361#true} is VALID [2018-11-14 18:17:43,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {2361#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2361#true} is VALID [2018-11-14 18:17:43,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {2361#true} call ULTIMATE.init(); {2361#true} is VALID [2018-11-14 18:17:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:17:43,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:17:43,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-14 18:17:43,160 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-14 18:17:43,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:17:43,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:17:43,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:17:43,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:17:43,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:17:43,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=75, Unknown=9, NotChecked=0, Total=110 [2018-11-14 18:17:43,376 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 11 states. [2018-11-14 18:17:48,870 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39