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.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 21:56:04,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 21:56:04,611 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 21:56:04,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 21:56:04,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 21:56:04,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 21:56:04,632 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 21:56:04,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 21:56:04,637 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 21:56:04,638 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 21:56:04,640 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 21:56:04,640 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 21:56:04,641 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 21:56:04,644 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 21:56:04,654 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 21:56:04,654 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 21:56:04,655 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 21:56:04,657 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 21:56:04,659 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 21:56:04,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 21:56:04,661 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 21:56:04,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 21:56:04,664 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 21:56:04,664 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 21:56:04,665 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 21:56:04,665 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 21:56:04,666 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 21:56:04,667 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 21:56:04,668 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 21:56:04,669 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 21:56:04,669 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 21:56:04,670 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 21:56:04,670 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 21:56:04,670 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 21:56:04,671 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 21:56:04,671 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 21:56:04,672 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 21:56:04,691 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 21:56:04,691 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 21:56:04,692 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 21:56:04,692 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 21:56:04,693 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 21:56:04,693 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 21:56:04,693 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 21:56:04,693 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 21:56:04,694 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 21:56:04,694 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 21:56:04,694 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 21:56:04,694 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 21:56:04,694 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 21:56:04,695 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 21:56:04,695 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 21:56:04,695 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 21:56:04,695 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 21:56:04,695 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 21:56:04,696 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 21:56:04,696 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 21:56:04,696 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 21:56:04,696 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 21:56:04,696 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 21:56:04,697 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 21:56:04,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:56:04,697 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 21:56:04,697 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 21:56:04,698 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 21:56:04,698 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 21:56:04,698 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 21:56:04,698 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 21:56:04,698 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 21:56:04,699 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 21:56:04,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 21:56:04,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 21:56:04,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 21:56:04,794 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 21:56:04,794 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 21:56:04,795 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-11-18 21:56:04,856 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2acc009/38cffe89094b4e9684ed210edb98d59f/FLAG1073a4ebc [2018-11-18 21:56:05,334 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 21:56:05,337 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-11-18 21:56:05,350 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2acc009/38cffe89094b4e9684ed210edb98d59f/FLAG1073a4ebc [2018-11-18 21:56:05,658 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2acc009/38cffe89094b4e9684ed210edb98d59f [2018-11-18 21:56:05,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 21:56:05,669 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 21:56:05,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 21:56:05,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 21:56:05,674 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 21:56:05,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:56:05" (1/1) ... [2018-11-18 21:56:05,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7ae460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:05, skipping insertion in model container [2018-11-18 21:56:05,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:56:05" (1/1) ... [2018-11-18 21:56:05,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 21:56:05,753 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 21:56:06,176 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:56:06,191 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 21:56:06,265 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:56:06,407 INFO L195 MainTranslator]: Completed translation [2018-11-18 21:56:06,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:06 WrapperNode [2018-11-18 21:56:06,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 21:56:06,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 21:56:06,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 21:56:06,409 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 21:56:06,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:06" (1/1) ... [2018-11-18 21:56:06,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:06" (1/1) ... [2018-11-18 21:56:06,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:06" (1/1) ... [2018-11-18 21:56:06,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:06" (1/1) ... [2018-11-18 21:56:06,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:06" (1/1) ... [2018-11-18 21:56:06,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:06" (1/1) ... [2018-11-18 21:56:06,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:06" (1/1) ... [2018-11-18 21:56:06,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 21:56:06,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 21:56:06,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 21:56:06,496 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 21:56:06,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56: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-18 21:56:06,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 21:56:06,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 21:56:06,563 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 21:56:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 21:56:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 21:56:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 21:56:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 21:56:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 21:56:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 21:56:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 21:56:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 21:56:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 21:56:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 21:56:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 21:56:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 21:56:06,566 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 21:56:06,566 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 21:56:06,566 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 21:56:06,566 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 21:56:06,566 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 21:56:06,566 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 21:56:06,567 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 21:56:06,567 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 21:56:06,567 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 21:56:06,567 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 21:56:06,567 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 21:56:06,567 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 21:56:06,567 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 21:56:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 21:56:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 21:56:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 21:56:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 21:56:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 21:56:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 21:56:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 21:56:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 21:56:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 21:56:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 21:56:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 21:56:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 21:56:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 21:56:06,570 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 21:56:06,570 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 21:56:06,570 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 21:56:06,570 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 21:56:06,570 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 21:56:06,570 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 21:56:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 21:56:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 21:56:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 21:56:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 21:56:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 21:56:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 21:56:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 21:56:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 21:56:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 21:56:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 21:56:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 21:56:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 21:56:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 21:56:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 21:56:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 21:56:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 21:56:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 21:56:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 21:56:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 21:56:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 21:56:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 21:56:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 21:56:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 21:56:06,575 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 21:56:06,575 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 21:56:06,575 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 21:56:06,575 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 21:56:06,575 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 21:56:06,576 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 21:56:06,576 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 21:56:06,576 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 21:56:06,576 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 21:56:06,576 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 21:56:06,576 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 21:56:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 21:56:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 21:56:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 21:56:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 21:56:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 21:56:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 21:56:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 21:56:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 21:56:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 21:56:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 21:56:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 21:56:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 21:56:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 21:56:06,579 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 21:56:06,579 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 21:56:06,579 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 21:56:06,579 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 21:56:06,579 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 21:56:06,579 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 21:56:06,580 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 21:56:06,580 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 21:56:06,580 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 21:56:06,580 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 21:56:06,580 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 21:56:06,580 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 21:56:06,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 21:56:06,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 21:56:06,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 21:56:06,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 21:56:06,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 21:56:06,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 21:56:06,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 21:56:06,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 21:56:06,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 21:56:06,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 21:56:06,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 21:56:06,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 21:56:07,940 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 21:56:07,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:56:07 BoogieIcfgContainer [2018-11-18 21:56:07,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 21:56:07,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 21:56:07,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 21:56:07,947 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 21:56:07,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:56:05" (1/3) ... [2018-11-18 21:56:07,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c5a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:56:07, skipping insertion in model container [2018-11-18 21:56:07,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:06" (2/3) ... [2018-11-18 21:56:07,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c5a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:56:07, skipping insertion in model container [2018-11-18 21:56:07,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:56:07" (3/3) ... [2018-11-18 21:56:07,951 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-11-18 21:56:07,962 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 21:56:07,976 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-18 21:56:07,994 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-18 21:56:08,040 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 21:56:08,042 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 21:56:08,042 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 21:56:08,042 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 21:56:08,042 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 21:56:08,042 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 21:56:08,043 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 21:56:08,043 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 21:56:08,043 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 21:56:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-18 21:56:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 21:56:08,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:56:08,083 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:56:08,088 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:56:08,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:56:08,098 INFO L82 PathProgramCache]: Analyzing trace with hash 827631655, now seen corresponding path program 1 times [2018-11-18 21:56:08,103 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:56:08,105 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-18 21:56:08,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:56:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:08,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:56:08,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-18 21:56:08,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-18 21:56:08,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-18 21:56:08,322 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #144#return; {45#true} is VALID [2018-11-18 21:56:08,322 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret17 := main(); {45#true} is VALID [2018-11-18 21:56:08,323 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {45#true} is VALID [2018-11-18 21:56:08,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-18 21:56:08,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {46#false} is VALID [2018-11-18 21:56:08,324 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-18 21:56:08,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {46#false} is VALID [2018-11-18 21:56:08,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-18 21:56:08,328 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-18 21:56:08,328 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:56:08,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:56:08,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 21:56:08,339 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 21:56:08,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:56:08,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 21:56:08,441 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-18 21:56:08,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 21:56:08,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 21:56:08,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 21:56:08,453 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-18 21:56:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:09,137 INFO L93 Difference]: Finished difference Result 75 states and 112 transitions. [2018-11-18 21:56:09,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 21:56:09,137 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 21:56:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:56:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:56:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2018-11-18 21:56:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:56:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2018-11-18 21:56:09,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2018-11-18 21:56:09,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:56:09,940 INFO L225 Difference]: With dead ends: 75 [2018-11-18 21:56:09,941 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 21:56:09,945 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-18 21:56:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 21:56:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-18 21:56:09,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:56:09,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-18 21:56:09,987 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-18 21:56:09,987 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-18 21:56:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:09,994 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-18 21:56:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-18 21:56:09,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:09,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:09,997 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-18 21:56:09,997 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-18 21:56:10,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:10,004 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-18 21:56:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-18 21:56:10,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:10,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:10,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:56:10,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:56:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 21:56:10,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-18 21:56:10,012 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 11 [2018-11-18 21:56:10,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:56:10,013 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-18 21:56:10,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 21:56:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-18 21:56:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 21:56:10,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:56:10,014 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:56:10,014 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:56:10,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:56:10,015 INFO L82 PathProgramCache]: Analyzing trace with hash -525234885, now seen corresponding path program 1 times [2018-11-18 21:56:10,015 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:56:10,016 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-18 21:56:10,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:56:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:10,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:56:10,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 21:56:10,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:10,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:10,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-18 21:56:10,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {272#true} call ULTIMATE.init(); {272#true} is VALID [2018-11-18 21:56:10,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {272#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {272#true} is VALID [2018-11-18 21:56:10,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {272#true} assume true; {272#true} is VALID [2018-11-18 21:56:10,269 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {272#true} {272#true} #144#return; {272#true} is VALID [2018-11-18 21:56:10,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {272#true} call #t~ret17 := main(); {272#true} is VALID [2018-11-18 21:56:10,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {272#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {292#(not (= main_~list~0.base main_~null~0.base))} is VALID [2018-11-18 21:56:10,272 INFO L273 TraceCheckUtils]: 6: Hoare triple {292#(not (= main_~list~0.base main_~null~0.base))} assume true; {292#(not (= main_~list~0.base main_~null~0.base))} is VALID [2018-11-18 21:56:10,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#(not (= main_~list~0.base main_~null~0.base))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {292#(not (= main_~list~0.base main_~null~0.base))} is VALID [2018-11-18 21:56:10,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#(not (= main_~list~0.base main_~null~0.base))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {302#(not (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-18 21:56:10,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {302#(not (= main_~end~0.base main_~null~0.base))} assume true; {302#(not (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-18 21:56:10,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {302#(not (= main_~end~0.base main_~null~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {273#false} is VALID [2018-11-18 21:56:10,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {273#false} assume !false; {273#false} is VALID [2018-11-18 21:56:10,279 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-18 21:56:10,279 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:56:10,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:56:10,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 21:56:10,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-18 21:56:10,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:56:10,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 21:56:10,357 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-18 21:56:10,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 21:56:10,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 21:56:10,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 21:56:10,358 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2018-11-18 21:56:10,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:10,867 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-18 21:56:10,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 21:56:10,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-18 21:56:10,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:56:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:56:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2018-11-18 21:56:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:56:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2018-11-18 21:56:10,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2018-11-18 21:56:11,030 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-18 21:56:11,034 INFO L225 Difference]: With dead ends: 41 [2018-11-18 21:56:11,034 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 21:56:11,035 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-18 21:56:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 21:56:11,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-11-18 21:56:11,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:56:11,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 32 states. [2018-11-18 21:56:11,059 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 32 states. [2018-11-18 21:56:11,059 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 32 states. [2018-11-18 21:56:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:11,063 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-18 21:56:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 21:56:11,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:11,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:11,064 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 39 states. [2018-11-18 21:56:11,064 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 39 states. [2018-11-18 21:56:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:11,068 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-18 21:56:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 21:56:11,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:11,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:11,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:56:11,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:56:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 21:56:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-18 21:56:11,072 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2018-11-18 21:56:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:56:11,072 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-18 21:56:11,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 21:56:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-18 21:56:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 21:56:11,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:56:11,073 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:56:11,074 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:56:11,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:56:11,074 INFO L82 PathProgramCache]: Analyzing trace with hash -702652304, now seen corresponding path program 1 times [2018-11-18 21:56:11,075 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:56:11,075 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-18 21:56:11,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:56:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:11,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:56:11,214 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-18 21:56:11,224 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-18 21:56:11,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:11,300 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-18 21:56:11,364 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-18 21:56:11,374 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:11,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:11,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:11,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 21:56:11,459 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2018-11-18 21:56:13,494 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:13,752 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-18 21:56:13,783 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-18 21:56:13,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:13,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:13,791 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-18 21:56:13,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 21:56:13,794 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:13,806 INFO L256 TraceCheckUtils]: 0: Hoare triple {479#true} call ULTIMATE.init(); {479#true} is VALID [2018-11-18 21:56:13,807 INFO L273 TraceCheckUtils]: 1: Hoare triple {479#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {479#true} is VALID [2018-11-18 21:56:13,807 INFO L273 TraceCheckUtils]: 2: Hoare triple {479#true} assume true; {479#true} is VALID [2018-11-18 21:56:13,807 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {479#true} {479#true} #144#return; {479#true} is VALID [2018-11-18 21:56:13,808 INFO L256 TraceCheckUtils]: 4: Hoare triple {479#true} call #t~ret17 := main(); {479#true} is VALID [2018-11-18 21:56:13,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {479#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {499#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-18 21:56:13,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {499#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true; {499#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-18 21:56:13,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {499#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {499#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-18 21:56:13,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {499#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-18 21:56:13,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume true; {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-18 21:56:13,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-18 21:56:13,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume true; {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-18 21:56:13,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {509#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume true;call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {522#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2018-11-18 21:56:13,820 INFO L273 TraceCheckUtils]: 13: Hoare triple {522#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {480#false} is VALID [2018-11-18 21:56:13,820 INFO L273 TraceCheckUtils]: 14: Hoare triple {480#false} assume !false; {480#false} is VALID [2018-11-18 21:56:13,823 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-18 21:56:13,823 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:56:13,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:56:13,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 21:56:13,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-18 21:56:13,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:56:13,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 21:56:13,857 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-18 21:56:13,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 21:56:13,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 21:56:13,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 21:56:13,858 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2018-11-18 21:56:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:14,860 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2018-11-18 21:56:14,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 21:56:14,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-18 21:56:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:56:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:56:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-18 21:56:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:56:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-18 21:56:14,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2018-11-18 21:56:15,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:56:15,013 INFO L225 Difference]: With dead ends: 68 [2018-11-18 21:56:15,013 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 21:56:15,014 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-18 21:56:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 21:56:15,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2018-11-18 21:56:15,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:56:15,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 41 states. [2018-11-18 21:56:15,077 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 41 states. [2018-11-18 21:56:15,077 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 41 states. [2018-11-18 21:56:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:15,082 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-18 21:56:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-18 21:56:15,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:15,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:15,084 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 66 states. [2018-11-18 21:56:15,084 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 66 states. [2018-11-18 21:56:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:15,088 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-18 21:56:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-18 21:56:15,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:15,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:15,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:56:15,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:56:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 21:56:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-18 21:56:15,092 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 15 [2018-11-18 21:56:15,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:56:15,093 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-18 21:56:15,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 21:56:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-18 21:56:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 21:56:15,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:56:15,094 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:56:15,094 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:56:15,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:56:15,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2013090473, now seen corresponding path program 1 times [2018-11-18 21:56:15,095 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:56:15,096 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-18 21:56:15,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:56:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:15,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:56:15,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-18 21:56:15,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 21:56:15,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:15,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:15,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 33 treesize of output 24 [2018-11-18 21:56:15,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 21:56:15,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:15,588 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-18 21:56:15,608 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-18 21:56:15,611 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:15,665 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:15,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:15,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 21:56:15,706 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:46, output treesize:32 [2018-11-18 21:56:16,017 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:16,117 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:16,118 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:16,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 21:56:16,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:16,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:16,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-18 21:56:16,141 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:16,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-11-18 21:56:16,241 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-18 21:56:16,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:16,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 61 [2018-11-18 21:56:16,545 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:16,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-18 21:56:16,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:16,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-18 21:56:16,902 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:16,968 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:17,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 39 [2018-11-18 21:56:17,054 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 21:56:17,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:56:17,163 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-18 21:56:17,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-18 21:56:17,231 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:48, output treesize:58 [2018-11-18 21:56:17,303 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:17,444 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-11-18 21:56:17,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-18 21:56:17,789 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-18 21:56:17,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:17,811 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-18 21:56:17,812 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:17,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:17,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-18 21:56:17,865 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-18 21:56:17,866 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:17,882 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-18 21:56:17,883 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:17,891 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:17,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:17,917 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:55, output treesize:3 [2018-11-18 21:56:17,925 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:17,943 INFO L256 TraceCheckUtils]: 0: Hoare triple {794#true} call ULTIMATE.init(); {794#true} is VALID [2018-11-18 21:56:17,944 INFO L273 TraceCheckUtils]: 1: Hoare triple {794#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {794#true} is VALID [2018-11-18 21:56:17,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {794#true} assume true; {794#true} is VALID [2018-11-18 21:56:17,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {794#true} {794#true} #144#return; {794#true} is VALID [2018-11-18 21:56:17,945 INFO L256 TraceCheckUtils]: 4: Hoare triple {794#true} call #t~ret17 := main(); {794#true} is VALID [2018-11-18 21:56:17,948 INFO L273 TraceCheckUtils]: 5: Hoare triple {794#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {814#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-18 21:56:17,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {814#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true; {814#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-18 21:56:17,951 INFO L273 TraceCheckUtils]: 7: Hoare triple {814#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32); {821#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-18 21:56:17,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {821#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {825#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-18 21:56:17,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {825#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} assume true; {825#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-18 21:56:17,965 INFO L273 TraceCheckUtils]: 10: Hoare triple {825#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {825#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-18 21:56:17,969 INFO L273 TraceCheckUtils]: 11: Hoare triple {825#(or (and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~list~0.base)))) (= main_~list~0.offset (_ bv0 32))) (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= v_prenex_3 main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} is VALID [2018-11-18 21:56:17,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} assume true; {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} is VALID [2018-11-18 21:56:17,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} is VALID [2018-11-18 21:56:17,974 INFO L273 TraceCheckUtils]: 14: Hoare triple {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} assume true; {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} is VALID [2018-11-18 21:56:17,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {835#(or (and (exists ((v_main_~end~0.base_23 (_ BitVec 32)) (v_main_~end~0.offset_23 (_ BitVec 32))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (bvadd v_main_~end~0.offset_23 (_ bv4 32)))) (not (= v_main_~end~0.base_23 main_~end~0.base)))) (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= main_~end~0.offset (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (= (select (select |#memory_int| v_prenex_3) (_ bv4 32)) ~unnamed1~0~BLACK) (not (= main_~end~0.base v_prenex_3)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))))} assume true;call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {848#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2018-11-18 21:56:17,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {848#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {795#false} is VALID [2018-11-18 21:56:17,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {795#false} assume !false; {795#false} is VALID [2018-11-18 21:56:17,982 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-18 21:56:17,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:56:24,558 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-18 21:56:24,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:24,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:24,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:160, output treesize:1 [2018-11-18 21:56:24,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {795#false} assume !false; {795#false} is VALID [2018-11-18 21:56:24,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {848#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {795#false} is VALID [2018-11-18 21:56:24,580 INFO L273 TraceCheckUtils]: 15: Hoare triple {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true;call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {848#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2018-11-18 21:56:24,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-18 21:56:24,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-18 21:56:24,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-18 21:56:24,586 INFO L273 TraceCheckUtils]: 11: Hoare triple {874#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {861#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-18 21:56:24,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {874#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {874#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2018-11-18 21:56:24,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {874#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} assume true; {874#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2018-11-18 21:56:24,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {884#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc6.base_2| (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2| (store (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {874#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2018-11-18 21:56:24,601 INFO L273 TraceCheckUtils]: 7: Hoare triple {888#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc6.base_2| (_ BitVec 32)) (v_main_~end~0.base_26 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~end~0.base_26) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2| (store (select (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32); {884#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc6.base_2| (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2| (store (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))))} is VALID [2018-11-18 21:56:24,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {888#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc6.base_2| (_ BitVec 32)) (v_main_~end~0.base_26 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~end~0.base_26) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2| (store (select (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))} assume true; {888#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc6.base_2| (_ BitVec 32)) (v_main_~end~0.base_26 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~end~0.base_26) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2| (store (select (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))} is VALID [2018-11-18 21:56:24,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {794#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {888#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc6.base_2| (_ BitVec 32)) (v_main_~end~0.base_26 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~end~0.base_26) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2| (store (select (store |#memory_int| v_main_~end~0.base_26 (store (select |#memory_int| v_main_~end~0.base_26) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc6.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))} is VALID [2018-11-18 21:56:24,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {794#true} call #t~ret17 := main(); {794#true} is VALID [2018-11-18 21:56:24,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {794#true} {794#true} #144#return; {794#true} is VALID [2018-11-18 21:56:24,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {794#true} assume true; {794#true} is VALID [2018-11-18 21:56:24,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {794#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {794#true} is VALID [2018-11-18 21:56:24,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {794#true} call ULTIMATE.init(); {794#true} is VALID [2018-11-18 21:56:24,610 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-18 21:56:24,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:56:24,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-18 21:56:24,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-18 21:56:24,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:56:24,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 21:56:24,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:56:24,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 21:56:24,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 21:56:24,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=82, Unknown=2, NotChecked=0, Total=110 [2018-11-18 21:56:24,691 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 11 states. [2018-11-18 21:56:25,307 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2018-11-18 21:56:25,789 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-11-18 21:56:26,841 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 26 [2018-11-18 21:56:36,346 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-11-18 21:56:36,901 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-18 21:56:37,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:37,696 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2018-11-18 21:56:37,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 21:56:37,696 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-18 21:56:37,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:56:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 21:56:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2018-11-18 21:56:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 21:56:37,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2018-11-18 21:56:37,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 77 transitions. [2018-11-18 21:56:38,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:56:38,055 INFO L225 Difference]: With dead ends: 82 [2018-11-18 21:56:38,055 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 21:56:38,056 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=112, Invalid=266, Unknown=2, NotChecked=0, Total=380 [2018-11-18 21:56:38,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 21:56:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 30. [2018-11-18 21:56:38,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:56:38,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 30 states. [2018-11-18 21:56:38,112 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 30 states. [2018-11-18 21:56:38,112 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 30 states. [2018-11-18 21:56:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:38,116 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-11-18 21:56:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2018-11-18 21:56:38,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:38,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:38,117 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 80 states. [2018-11-18 21:56:38,117 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 80 states. [2018-11-18 21:56:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:38,121 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-11-18 21:56:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2018-11-18 21:56:38,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:38,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:38,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:56:38,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:56:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 21:56:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-18 21:56:38,124 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2018-11-18 21:56:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:56:38,125 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-18 21:56:38,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 21:56:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-18 21:56:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 21:56:38,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:56:38,126 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-18 21:56:38,126 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:56:38,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:56:38,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1167298014, now seen corresponding path program 1 times [2018-11-18 21:56:38,127 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:56:38,127 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-18 21:56:38,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:56:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:38,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:56:38,253 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-18 21:56:38,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-18 21:56:38,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:38,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:38,261 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-18 21:56:38,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-18 21:56:38,264 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:38,277 INFO L256 TraceCheckUtils]: 0: Hoare triple {1223#true} call ULTIMATE.init(); {1223#true} is VALID [2018-11-18 21:56:38,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {1223#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1223#true} is VALID [2018-11-18 21:56:38,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {1223#true} assume true; {1223#true} is VALID [2018-11-18 21:56:38,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1223#true} {1223#true} #144#return; {1223#true} is VALID [2018-11-18 21:56:38,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {1223#true} call #t~ret17 := main(); {1223#true} is VALID [2018-11-18 21:56:38,279 INFO L273 TraceCheckUtils]: 5: Hoare triple {1223#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1223#true} is VALID [2018-11-18 21:56:38,279 INFO L273 TraceCheckUtils]: 6: Hoare triple {1223#true} assume true; {1223#true} is VALID [2018-11-18 21:56:38,279 INFO L273 TraceCheckUtils]: 7: Hoare triple {1223#true} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1223#true} is VALID [2018-11-18 21:56:38,280 INFO L273 TraceCheckUtils]: 8: Hoare triple {1223#true} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1223#true} is VALID [2018-11-18 21:56:38,280 INFO L273 TraceCheckUtils]: 9: Hoare triple {1223#true} assume true; {1223#true} is VALID [2018-11-18 21:56:38,280 INFO L273 TraceCheckUtils]: 10: Hoare triple {1223#true} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1223#true} is VALID [2018-11-18 21:56:38,280 INFO L273 TraceCheckUtils]: 11: Hoare triple {1223#true} assume true; {1223#true} is VALID [2018-11-18 21:56:38,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {1223#true} assume true;call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1264#(= |main_#t~mem8| (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-18 21:56:38,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {1264#(= |main_#t~mem8| (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1268#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-18 21:56:38,318 INFO L273 TraceCheckUtils]: 14: Hoare triple {1268#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {1268#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-18 21:56:38,318 INFO L273 TraceCheckUtils]: 15: Hoare triple {1268#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {1268#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-18 21:56:38,320 INFO L273 TraceCheckUtils]: 16: Hoare triple {1268#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1278#(= ~unnamed1~0~BLACK |main_#t~mem9|)} is VALID [2018-11-18 21:56:38,320 INFO L273 TraceCheckUtils]: 17: Hoare triple {1278#(= ~unnamed1~0~BLACK |main_#t~mem9|)} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1224#false} is VALID [2018-11-18 21:56:38,320 INFO L273 TraceCheckUtils]: 18: Hoare triple {1224#false} assume true; {1224#false} is VALID [2018-11-18 21:56:38,321 INFO L273 TraceCheckUtils]: 19: Hoare triple {1224#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1224#false} is VALID [2018-11-18 21:56:38,321 INFO L273 TraceCheckUtils]: 20: Hoare triple {1224#false} assume !false; {1224#false} is VALID [2018-11-18 21:56:38,322 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-18 21:56:38,322 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:56:38,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:56:38,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 21:56:38,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-18 21:56:38,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:56:38,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 21:56:38,352 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-18 21:56:38,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 21:56:38,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 21:56:38,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 21:56:38,353 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-11-18 21:56:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:39,375 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-18 21:56:39,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 21:56:39,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-18 21:56:39,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:56:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:56:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-18 21:56:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:56:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-18 21:56:39,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-18 21:56:39,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:56:39,450 INFO L225 Difference]: With dead ends: 48 [2018-11-18 21:56:39,450 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 21:56:39,451 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-18 21:56:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 21:56:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-18 21:56:39,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:56:39,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-18 21:56:39,533 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-18 21:56:39,533 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-18 21:56:39,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:39,535 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-18 21:56:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-18 21:56:39,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:39,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:39,536 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-18 21:56:39,536 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-18 21:56:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:39,538 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-18 21:56:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-18 21:56:39,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:39,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:39,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:56:39,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:56:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 21:56:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-18 21:56:39,541 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2018-11-18 21:56:39,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:56:39,541 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-18 21:56:39,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 21:56:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-18 21:56:39,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 21:56:39,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:56:39,542 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-18 21:56:39,542 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:56:39,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:56:39,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1449495770, now seen corresponding path program 1 times [2018-11-18 21:56:39,543 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:56:39,543 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-18 21:56:39,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:56:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:39,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:56:39,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 21:56:39,784 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-18 21:56:39,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:39,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-18 21:56:39,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-18 21:56:39,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:40,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:40,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:40,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 21:56:40,236 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-18 21:56:40,238 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:40,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-18 21:56:40,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-18 21:56:40,313 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:40,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2018-11-18 21:56:40,389 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:40,415 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:56:40,541 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:56:40,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:56:40,579 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:67 [2018-11-18 21:56:42,716 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:43,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 52 [2018-11-18 21:56:43,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-11-18 21:56:43,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:43,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-11-18 21:56:43,193 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:43,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-18 21:56:43,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:43,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:43,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2018-11-18 21:56:43,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-18 21:56:43,402 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:43,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-11-18 21:56:43,450 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:43,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-18 21:56:43,502 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:43,531 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:56:43,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-11-18 21:56:43,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-18 21:56:43,610 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:43,625 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:43,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-18 21:56:43,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-18 21:56:43,694 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:43,703 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:43,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:43,728 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:79, output treesize:10 [2018-11-18 21:56:43,739 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:43,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2018-11-18 21:56:43,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {1456#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1456#true} is VALID [2018-11-18 21:56:43,768 INFO L273 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2018-11-18 21:56:43,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #144#return; {1456#true} is VALID [2018-11-18 21:56:43,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret17 := main(); {1456#true} is VALID [2018-11-18 21:56:43,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {1456#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1476#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~null~0.offset) main_~null~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-18 21:56:43,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {1476#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~null~0.offset) main_~null~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset (_ bv0 32))))} assume true; {1476#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~null~0.offset) main_~null~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-18 21:56:43,775 INFO L273 TraceCheckUtils]: 7: Hoare triple {1476#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~null~0.offset) main_~null~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset (_ bv0 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1476#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~null~0.offset) main_~null~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-18 21:56:43,776 INFO L273 TraceCheckUtils]: 8: Hoare triple {1476#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~null~0.offset) main_~null~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset (_ bv0 32))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-18 21:56:43,777 INFO L273 TraceCheckUtils]: 9: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume true; {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-18 21:56:43,781 INFO L273 TraceCheckUtils]: 10: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-18 21:56:43,782 INFO L273 TraceCheckUtils]: 11: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume true; {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-18 21:56:43,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume true;call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-18 21:56:43,783 INFO L273 TraceCheckUtils]: 13: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-18 21:56:43,783 INFO L273 TraceCheckUtils]: 14: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume true; {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-18 21:56:43,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume true; {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-18 21:56:43,784 INFO L273 TraceCheckUtils]: 16: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-18 21:56:43,785 INFO L273 TraceCheckUtils]: 17: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} is VALID [2018-11-18 21:56:43,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {1486#(or (and (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~null~0.offset) main_~null~0.offset)) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~null~0.offset))))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1517#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-18 21:56:43,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {1517#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} assume true; {1517#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-18 21:56:43,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {1517#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1457#false} is VALID [2018-11-18 21:56:43,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {1457#false} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1457#false} is VALID [2018-11-18 21:56:43,791 INFO L273 TraceCheckUtils]: 22: Hoare triple {1457#false} assume true; {1457#false} is VALID [2018-11-18 21:56:43,791 INFO L273 TraceCheckUtils]: 23: Hoare triple {1457#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1457#false} is VALID [2018-11-18 21:56:43,792 INFO L273 TraceCheckUtils]: 24: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2018-11-18 21:56:43,796 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-18 21:56:43,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:56:44,001 INFO L273 TraceCheckUtils]: 24: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2018-11-18 21:56:44,001 INFO L273 TraceCheckUtils]: 23: Hoare triple {1457#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1457#false} is VALID [2018-11-18 21:56:44,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {1457#false} assume true; {1457#false} is VALID [2018-11-18 21:56:44,002 INFO L273 TraceCheckUtils]: 21: Hoare triple {1457#false} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1457#false} is VALID [2018-11-18 21:56:44,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {1548#(and (= main_~end~0.offset main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1457#false} is VALID [2018-11-18 21:56:44,018 INFO L273 TraceCheckUtils]: 19: Hoare triple {1548#(and (= main_~end~0.offset main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} assume true; {1548#(and (= main_~end~0.offset main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-18 21:56:44,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1548#(and (= main_~end~0.offset main_~null~0.offset) (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-18 21:56:44,019 INFO L273 TraceCheckUtils]: 17: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-18 21:56:44,023 INFO L273 TraceCheckUtils]: 16: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-18 21:56:44,029 INFO L273 TraceCheckUtils]: 15: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-18 21:56:44,029 INFO L273 TraceCheckUtils]: 14: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-18 21:56:44,030 INFO L273 TraceCheckUtils]: 13: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-18 21:56:44,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true;call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-18 21:56:44,031 INFO L273 TraceCheckUtils]: 11: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-18 21:56:44,036 INFO L273 TraceCheckUtils]: 10: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-18 21:56:44,037 INFO L273 TraceCheckUtils]: 9: Hoare triple {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-18 21:56:44,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {1586#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1555#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-18 21:56:44,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {1586#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1586#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset))} is VALID [2018-11-18 21:56:44,039 INFO L273 TraceCheckUtils]: 6: Hoare triple {1586#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset))} assume true; {1586#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset))} is VALID [2018-11-18 21:56:44,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {1456#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1586#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset))} is VALID [2018-11-18 21:56:44,043 INFO L256 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret17 := main(); {1456#true} is VALID [2018-11-18 21:56:44,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #144#return; {1456#true} is VALID [2018-11-18 21:56:44,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2018-11-18 21:56:44,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {1456#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1456#true} is VALID [2018-11-18 21:56:44,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2018-11-18 21:56:44,046 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-18 21:56:44,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:56:44,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 21:56:44,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-18 21:56:44,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:56:44,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 21:56:44,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:56:44,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 21:56:44,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 21:56:44,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-18 21:56:44,114 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-11-18 21:56:44,664 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2018-11-18 21:56:45,788 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-11-18 21:56:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:45,955 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-11-18 21:56:45,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 21:56:45,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-18 21:56:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:56:45,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 21:56:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2018-11-18 21:56:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 21:56:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2018-11-18 21:56:45,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2018-11-18 21:56:46,128 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-18 21:56:46,129 INFO L225 Difference]: With dead ends: 62 [2018-11-18 21:56:46,130 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 21:56:46,130 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-18 21:56:46,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 21:56:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-18 21:56:46,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:56:46,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-18 21:56:46,213 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-18 21:56:46,213 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-18 21:56:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:46,215 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-18 21:56:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-18 21:56:46,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:46,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:46,222 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-18 21:56:46,222 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-18 21:56:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:56:46,224 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-18 21:56:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-18 21:56:46,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:56:46,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:56:46,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:56:46,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:56:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 21:56:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-18 21:56:46,231 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 25 [2018-11-18 21:56:46,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:56:46,231 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-18 21:56:46,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 21:56:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-18 21:56:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 21:56:46,232 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:56:46,232 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:56:46,232 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:56:46,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:56:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1709093407, now seen corresponding path program 1 times [2018-11-18 21:56:46,233 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:56:46,233 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-18 21:56:46,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:56:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:56:46,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:56:46,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-18 21:56:46,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 21:56:46,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:46,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:46,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:46,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:23 [2018-11-18 21:56:46,526 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:46,625 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:46,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:46,698 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:46,699 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-11-18 21:56:46,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-11-18 21:56:46,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:46,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 21:56:47,007 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-18 21:56:47,008 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:47,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 21:56:47,079 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-18 21:56:47,082 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:47,098 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:47,117 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-18 21:56:47,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 21:56:47,227 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-18 21:56:47,258 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:47,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:47,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-11-18 21:56:47,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-18 21:56:47,325 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:47,343 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:47,354 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-18 21:56:47,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:47,408 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:85, output treesize:57 [2018-11-18 21:56:48,536 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:48,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:48,709 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:48,774 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:48,794 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:48,818 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:48,819 INFO L303 Elim1Store]: Index analysis took 167 ms [2018-11-18 21:56:48,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-11-18 21:56:48,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:49,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:49,105 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:56:49,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2018-11-18 21:56:49,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-18 21:56:49,120 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:49,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:49,408 INFO L303 Elim1Store]: Index analysis took 190 ms [2018-11-18 21:56:49,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-11-18 21:56:49,462 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-18 21:56:49,487 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:49,590 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:49,611 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-18 21:56:49,708 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:49,711 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:49,714 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:49,717 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:49,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 88 [2018-11-18 21:56:49,818 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 59 [2018-11-18 21:56:49,829 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 21:56:49,908 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:49,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:49,920 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:49,934 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:49,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2018-11-18 21:56:49,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-18 21:56:49,954 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:49,993 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:50,013 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-18 21:56:50,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:50,071 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:156, output treesize:75 [2018-11-18 21:56:50,213 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:50,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:50,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:50,539 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:50,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 57 [2018-11-18 21:56:50,561 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-18 21:56:50,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:50,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-18 21:56:50,597 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:50,629 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-18 21:56:50,630 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:50,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:50,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:56:50,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:49 [2018-11-18 21:56:50,687 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:50,906 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:50,907 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:50,909 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:50,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:50,914 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:50,920 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:56:50,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-11-18 21:56:51,026 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 51 [2018-11-18 21:56:51,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:51,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-18 21:56:51,184 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:51,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 5 treesize of output 1 [2018-11-18 21:56:51,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:51,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:56:51,235 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-18 21:56:51,236 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:4 [2018-11-18 21:56:51,243 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:56:51,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {1802#true} call ULTIMATE.init(); {1802#true} is VALID [2018-11-18 21:56:51,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {1802#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1802#true} is VALID [2018-11-18 21:56:51,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {1802#true} assume true; {1802#true} is VALID [2018-11-18 21:56:51,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1802#true} {1802#true} #144#return; {1802#true} is VALID [2018-11-18 21:56:51,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {1802#true} call #t~ret17 := main(); {1802#true} is VALID [2018-11-18 21:56:51,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {1802#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1822#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-18 21:56:51,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {1822#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset (_ bv0 32)))} assume true; {1822#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-18 21:56:51,286 INFO L273 TraceCheckUtils]: 7: Hoare triple {1822#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= (_ bv0 32) main_~null~0.offset) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset (_ bv0 32)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32); {1829#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (not (= main_~end~0.base main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~end~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~end~0.offset)) (= main_~list~0.offset (_ bv0 32)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-18 21:56:51,294 INFO L273 TraceCheckUtils]: 8: Hoare triple {1829#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (not (= main_~end~0.base main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= main_~end~0.offset (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~end~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= (_ bv0 32) main_~null~0.offset) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~end~0.offset)) (= main_~list~0.offset (_ bv0 32)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1833#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) main_~null~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32)))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (_ bv0 32))))} is VALID [2018-11-18 21:56:51,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {1833#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) main_~null~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32)))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (_ bv0 32))))} assume true; {1833#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) main_~null~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32)))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (_ bv0 32))))} is VALID [2018-11-18 21:56:51,297 INFO L273 TraceCheckUtils]: 10: Hoare triple {1833#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) main_~null~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32)))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (_ bv0 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1833#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) main_~null~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32)))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (_ bv0 32))))} is VALID [2018-11-18 21:56:51,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {1833#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) main_~null~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (_ bv0 32)))) (= main_~list~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (_ bv0 32))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-18 21:56:51,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume true; {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-18 21:56:51,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-18 21:56:51,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume true; {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-18 21:56:51,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume true;call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-18 21:56:51,315 INFO L273 TraceCheckUtils]: 16: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-18 21:56:51,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume true; {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-18 21:56:51,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume true; {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-18 21:56:51,323 INFO L273 TraceCheckUtils]: 19: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-18 21:56:51,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-18 21:56:51,327 INFO L273 TraceCheckUtils]: 21: Hoare triple {1843#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32)) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) main_~null~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset) (_ bv0 32)) (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (_ bv0 32)) (_ bv0 32)))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1874#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32)) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~null~0.base)))))} is VALID [2018-11-18 21:56:51,328 INFO L273 TraceCheckUtils]: 22: Hoare triple {1874#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32)) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~null~0.base)))))} assume true; {1874#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32)) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~null~0.base)))))} is VALID [2018-11-18 21:56:51,329 INFO L273 TraceCheckUtils]: 23: Hoare triple {1874#(and (= main_~end~0.offset (_ bv0 32)) (= (_ bv0 32) main_~null~0.offset) (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32)) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~null~0.base)))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1881#(and (= main_~end~0.offset (_ bv0 32)) (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32)) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~null~0.base)))))} is VALID [2018-11-18 21:56:51,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {1881#(and (= main_~end~0.offset (_ bv0 32)) (exists ((v_main_~end~0.base_35 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~end~0.base) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32))) (_ bv0 32)) main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32))) (_ bv0 32)) main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_35) (_ bv0 32)) main_~null~0.base)))))} assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1885#(not (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-18 21:56:51,332 INFO L273 TraceCheckUtils]: 25: Hoare triple {1885#(not (= main_~end~0.base main_~null~0.base))} assume true; {1885#(not (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-18 21:56:51,333 INFO L273 TraceCheckUtils]: 26: Hoare triple {1885#(not (= main_~end~0.base main_~null~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1803#false} is VALID [2018-11-18 21:56:51,333 INFO L273 TraceCheckUtils]: 27: Hoare triple {1803#false} assume !false; {1803#false} is VALID [2018-11-18 21:56:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:56:51,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:56:56,798 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 62 [2018-11-18 21:56:58,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 208 [2018-11-18 21:56:58,971 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-18 21:56:58,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:56:59,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 186 [2018-11-18 21:57:00,711 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-11-18 21:57:00,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 158 [2018-11-18 21:57:00,730 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:00,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 158 [2018-11-18 21:57:00,741 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:01,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 0 case distinctions, treesize of input 158 treesize of output 159 [2018-11-18 21:57:01,580 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:01,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 159 [2018-11-18 21:57:01,605 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:02,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 166 [2018-11-18 21:57:02,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 142 [2018-11-18 21:57:02,772 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:03,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 147 [2018-11-18 21:57:03,468 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:04,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 146 [2018-11-18 21:57:04,114 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:57:04,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 140 [2018-11-18 21:57:04,650 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:05,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 137 [2018-11-18 21:57:05,110 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:57:05,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 145 [2018-11-18 21:57:05,693 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:06,170 INFO L267 ElimStorePlain]: Start of recursive call 9: 6 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-18 21:57:06,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 166 [2018-11-18 21:57:06,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 146 [2018-11-18 21:57:06,368 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:57:06,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 145 [2018-11-18 21:57:06,969 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:07,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 150 [2018-11-18 21:57:07,657 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:08,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 140 [2018-11-18 21:57:08,405 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:09,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 147 [2018-11-18 21:57:09,015 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:09,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 145 [2018-11-18 21:57:09,571 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:10,164 INFO L267 ElimStorePlain]: Start of recursive call 16: 6 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-18 21:57:12,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 159 [2018-11-18 21:57:12,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 150 [2018-11-18 21:57:12,569 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:57:12,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 143 [2018-11-18 21:57:12,889 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:13,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 138 [2018-11-18 21:57:13,199 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:13,450 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 21:57:13,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 159 [2018-11-18 21:57:13,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 150 [2018-11-18 21:57:13,559 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:57:13,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 151 [2018-11-18 21:57:13,881 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:14,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 138 [2018-11-18 21:57:14,230 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:14,501 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 21:57:18,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 172 [2018-11-18 21:57:20,206 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 134 [2018-11-18 21:57:20,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 146 [2018-11-18 21:57:20,237 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:57:21,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 140 [2018-11-18 21:57:21,600 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:23,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 150 [2018-11-18 21:57:23,111 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:25,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 147 [2018-11-18 21:57:25,154 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:26,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 148 [2018-11-18 21:57:26,923 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:28,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 149 [2018-11-18 21:57:28,347 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:57:29,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 150 [2018-11-18 21:57:29,874 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:31,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 145 [2018-11-18 21:57:31,129 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:32,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 150 [2018-11-18 21:57:32,666 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:33,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 137 [2018-11-18 21:57:33,821 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:34,899 INFO L267 ElimStorePlain]: Start of recursive call 31: 10 dim-1 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-11-18 21:57:35,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 172 [2018-11-18 21:57:38,579 WARN L180 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2018-11-18 21:57:38,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 139 [2018-11-18 21:57:38,689 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:40,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 142 [2018-11-18 21:57:40,173 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:41,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 146 [2018-11-18 21:57:41,566 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:57:42,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 142 [2018-11-18 21:57:42,999 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:44,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 140 [2018-11-18 21:57:44,418 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:46,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 142 [2018-11-18 21:57:46,394 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:47,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 145 [2018-11-18 21:57:47,473 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:48,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 145 [2018-11-18 21:57:48,616 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:57:49,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 149 [2018-11-18 21:57:49,609 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:57:51,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 137 [2018-11-18 21:57:51,094 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-18 21:57:52,058 INFO L267 ElimStorePlain]: Start of recursive call 42: 10 dim-1 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-11-18 21:58:03,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 28 dim-0 vars, and 30 xjuncts. [2018-11-18 21:58:17,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 28 dim-0 vars, and 30 xjuncts. [2018-11-18 21:58:41,795 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 155 treesize of output 100 [2018-11-18 21:58:41,805 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 9 treesize of output 8 [2018-11-18 21:58:41,807 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:41,921 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 69 treesize of output 49 [2018-11-18 21:58:42,041 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-11-18 21:58:42,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-18 21:58:42,070 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:42,173 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:42,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 37 treesize of output 82 [2018-11-18 21:58:42,385 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 49 treesize of output 50 [2018-11-18 21:58:42,397 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:43,476 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 3 case distinctions, treesize of input 42 treesize of output 58 [2018-11-18 21:58:43,482 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 4 xjuncts. [2018-11-18 21:58:44,782 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 47 treesize of output 53 [2018-11-18 21:58:44,785 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-11-18 21:58:45,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, 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 47 [2018-11-18 21:58:45,962 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:47,053 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:47,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 84 [2018-11-18 21:58:47,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 51 [2018-11-18 21:58:47,820 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-11-18 21:58:51,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 33 [2018-11-18 21:58:51,008 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-11-18 21:58:53,578 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 37 treesize of output 31 [2018-11-18 21:58:53,580 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:56,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2018-11-18 21:58:56,131 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 2 xjuncts. [2018-11-18 21:58:56,140 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:56,141 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:58:56,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-18 21:58:56,143 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-18 21:58:58,806 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 1 case distinctions, treesize of input 31 treesize of output 27 [2018-11-18 21:58:58,808 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 2 xjuncts. [2018-11-18 21:59:01,606 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 1 case distinctions, treesize of input 37 treesize of output 33 [2018-11-18 21:59:01,609 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 2 xjuncts. [2018-11-18 21:59:04,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 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-18 21:59:04,500 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:04,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-18 21:59:04,512 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:06,569 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 29 treesize of output 23 [2018-11-18 21:59:06,570 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:06,581 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 28 treesize of output 22 [2018-11-18 21:59:06,583 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:08,388 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 32 treesize of output 26 [2018-11-18 21:59:08,390 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:10,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 29 [2018-11-18 21:59:10,264 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 3 xjuncts. [2018-11-18 21:59:12,067 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 16 treesize of output 10 [2018-11-18 21:59:12,070 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:12,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-11-18 21:59:12,079 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:12,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-18 21:59:12,091 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:14,114 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 1 case distinctions, treesize of input 35 treesize of output 31 [2018-11-18 21:59:14,117 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 2 xjuncts. [2018-11-18 21:59:15,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-18 21:59:15,259 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:16,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-18 21:59:16,295 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:16,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-18 21:59:16,309 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:18,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2018-11-18 21:59:18,023 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 2 xjuncts. [2018-11-18 21:59:18,034 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:18,035 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:18,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-18 21:59:18,038 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:19,636 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 19 treesize of output 13 [2018-11-18 21:59:19,643 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:19,653 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 19 treesize of output 13 [2018-11-18 21:59:19,654 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:20,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2018-11-18 21:59:20,103 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-11-18 21:59:20,477 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 42 treesize of output 36 [2018-11-18 21:59:20,479 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:21,403 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 36 treesize of output 30 [2018-11-18 21:59:21,404 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:21,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-18 21:59:21,694 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:21,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-18 21:59:21,703 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:21,956 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 30 treesize of output 24 [2018-11-18 21:59:21,958 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:22,390 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 32 treesize of output 26 [2018-11-18 21:59:22,392 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:22,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-18 21:59:22,617 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:23,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-18 21:59:23,058 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:23,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-11-18 21:59:23,239 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:23,354 INFO L267 ElimStorePlain]: Start of recursive call 62: 40 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:59:24,149 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:24,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-18 21:59:24,178 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-18 21:59:24,179 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:24,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-11-18 21:59:24,226 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:24,245 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-18 21:59:24,246 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:24,252 INFO L267 ElimStorePlain]: Start of recursive call 97: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:59:24,380 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:24,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 55 [2018-11-18 21:59:24,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-18 21:59:24,491 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:24,724 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 23 treesize of output 17 [2018-11-18 21:59:24,727 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:24,915 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 34 treesize of output 28 [2018-11-18 21:59:24,919 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:25,086 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 28 treesize of output 22 [2018-11-18 21:59:25,088 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:25,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-18 21:59:25,244 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:25,365 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 22 treesize of output 16 [2018-11-18 21:59:25,366 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:25,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2018-11-18 21:59:25,512 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 2 xjuncts. [2018-11-18 21:59:25,632 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 19 treesize of output 13 [2018-11-18 21:59:25,633 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:25,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-18 21:59:25,734 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:25,752 INFO L267 ElimStorePlain]: Start of recursive call 101: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:59:25,766 INFO L267 ElimStorePlain]: Start of recursive call 57: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:59:25,789 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:25,867 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 61 [2018-11-18 21:59:25,900 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 47 treesize of output 46 [2018-11-18 21:59:25,902 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:26,129 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 40 treesize of output 46 [2018-11-18 21:59:26,133 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 2 xjuncts. [2018-11-18 21:59:26,357 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:26,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 53 [2018-11-18 21:59:26,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-11-18 21:59:26,420 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:26,525 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 20 treesize of output 14 [2018-11-18 21:59:26,527 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:26,595 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 29 treesize of output 23 [2018-11-18 21:59:26,596 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:26,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-11-18 21:59:26,654 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:26,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 21:59:26,723 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 2 xjuncts. [2018-11-18 21:59:26,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-11-18 21:59:26,780 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:26,786 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 9 [2018-11-18 21:59:26,789 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:26,828 INFO L267 ElimStorePlain]: Start of recursive call 114: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:59:26,993 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:27,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-11-18 21:59:27,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-18 21:59:27,019 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:27,046 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-18 21:59:27,047 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:27,065 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-18 21:59:27,066 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:27,073 INFO L267 ElimStorePlain]: Start of recursive call 122: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:59:27,087 INFO L267 ElimStorePlain]: Start of recursive call 111: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:59:27,091 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:59:27,122 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:59:27,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 97 [2018-11-18 21:59:27,153 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 9 treesize of output 8 [2018-11-18 21:59:27,154 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:27,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 63 [2018-11-18 21:59:27,960 WARN L180 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2018-11-18 21:59:27,971 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 41 treesize of output 40 [2018-11-18 21:59:27,974 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:27,980 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 41 treesize of output 40 [2018-11-18 21:59:27,982 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:28,319 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:28,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 49 [2018-11-18 21:59:28,348 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 2 xjuncts. [2018-11-18 21:59:28,363 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:28,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 49 [2018-11-18 21:59:28,391 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 2 xjuncts. [2018-11-18 21:59:28,784 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:28,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 66 [2018-11-18 21:59:28,897 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 52 treesize of output 51 [2018-11-18 21:59:28,899 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:29,170 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 44 treesize of output 45 [2018-11-18 21:59:29,172 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:29,362 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:29,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 74 [2018-11-18 21:59:39,371 WARN L180 SmtUtils]: Spent 9.72 s on a formula simplification. DAG size of input: 286 DAG size of output: 279 [2018-11-18 21:59:39,372 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 21:59:39,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-11-18 21:59:39,404 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:42,200 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:42,200 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:42,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-11-18 21:59:42,205 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:44,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-18 21:59:44,364 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:46,432 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 17 treesize of output 11 [2018-11-18 21:59:46,435 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:47,262 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:47,263 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:47,266 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:59:47,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-18 21:59:47,276 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-11-18 21:59:47,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2018-11-18 21:59:47,797 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 2 xjuncts.