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-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:25:43,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:25:43,129 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:25:43,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:25:43,143 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:25:43,144 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:25:43,145 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:25:43,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:25:43,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:25:43,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:25:43,151 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:25:43,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:25:43,152 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:25:43,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:25:43,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:25:43,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:25:43,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:25:43,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:25:43,160 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:25:43,161 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:25:43,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:25:43,167 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:25:43,170 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:25:43,170 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:25:43,170 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:25:43,175 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:25:43,176 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:25:43,177 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:25:43,180 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:25:43,181 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:25:43,181 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:25:43,182 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:25:43,182 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:25:43,182 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:25:43,186 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:25:43,187 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:25:43,187 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-14 16:25:43,214 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:25:43,214 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:25:43,215 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:25:43,216 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:25:43,216 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:25:43,216 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:25:43,216 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:25:43,217 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:25:43,217 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:25:43,217 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:25:43,217 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:25:43,217 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:25:43,218 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:25:43,218 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:25:43,218 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:25:43,218 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:25:43,218 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:25:43,219 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:25:43,219 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:25:43,219 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:25:43,219 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:25:43,219 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:25:43,220 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:25:43,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:25:43,220 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:25:43,220 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:25:43,220 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:25:43,221 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:25:43,221 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:25:43,221 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:25:43,221 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:25:43,221 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:25:43,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:25:43,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:25:43,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:25:43,297 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:25:43,298 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:25:43,299 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-14 16:25:43,373 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3aecef8f6/27750de026a54d7aab0b1952eef778d0/FLAGa10acd628 [2018-11-14 16:25:43,941 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:25:43,942 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-14 16:25:43,955 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3aecef8f6/27750de026a54d7aab0b1952eef778d0/FLAGa10acd628 [2018-11-14 16:25:43,971 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3aecef8f6/27750de026a54d7aab0b1952eef778d0 [2018-11-14 16:25:43,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:25:43,983 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:25:43,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:25:43,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:25:43,988 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:25:43,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:25:43" (1/1) ... [2018-11-14 16:25:43,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b0e8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:43, skipping insertion in model container [2018-11-14 16:25:43,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:25:43" (1/1) ... [2018-11-14 16:25:44,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:25:44,059 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:25:44,498 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:25:44,515 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:25:44,591 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:25:44,739 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:25:44,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:44 WrapperNode [2018-11-14 16:25:44,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:25:44,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:25:44,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:25:44,741 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:25:44,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:44" (1/1) ... [2018-11-14 16:25:44,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:44" (1/1) ... [2018-11-14 16:25:44,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:44" (1/1) ... [2018-11-14 16:25:44,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:44" (1/1) ... [2018-11-14 16:25:44,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:44" (1/1) ... [2018-11-14 16:25:44,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:44" (1/1) ... [2018-11-14 16:25:44,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:44" (1/1) ... [2018-11-14 16:25:44,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:25:44,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:25:44,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:25:44,832 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:25:44,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:25:44,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:25:44,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:25:44,912 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:25:44,912 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 16:25:44,912 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 16:25:44,912 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 16:25:44,912 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 16:25:44,913 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 16:25:44,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 16:25:44,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 16:25:44,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 16:25:44,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 16:25:44,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 16:25:44,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 16:25:44,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 16:25:44,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 16:25:44,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 16:25:44,915 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 16:25:44,915 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 16:25:44,915 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 16:25:44,915 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 16:25:44,915 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 16:25:44,915 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 16:25:44,916 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 16:25:44,916 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 16:25:44,916 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 16:25:44,916 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 16:25:44,916 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 16:25:44,916 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 16:25:44,917 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 16:25:44,917 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 16:25:44,917 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 16:25:44,917 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 16:25:44,917 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 16:25:44,917 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 16:25:44,918 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 16:25:44,918 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 16:25:44,918 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 16:25:44,918 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 16:25:44,918 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 16:25:44,919 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 16:25:44,919 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 16:25:44,919 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 16:25:44,919 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 16:25:44,919 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 16:25:44,919 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 16:25:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 16:25:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 16:25:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 16:25:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 16:25:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 16:25:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 16:25:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 16:25:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 16:25:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 16:25:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 16:25:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 16:25:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 16:25:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 16:25:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 16:25:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 16:25:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 16:25:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 16:25:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 16:25:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 16:25:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 16:25:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 16:25:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 16:25:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 16:25:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 16:25:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 16:25:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 16:25:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 16:25:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 16:25:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 16:25:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 16:25:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 16:25:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 16:25:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 16:25:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 16:25:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 16:25:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 16:25:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 16:25:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 16:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 16:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 16:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 16:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 16:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 16:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 16:25:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 16:25:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 16:25:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 16:25:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 16:25:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 16:25:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 16:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 16:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 16:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 16:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 16:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 16:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 16:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 16:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 16:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 16:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 16:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:25:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:25:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:25:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 16:25:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:25:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 16:25:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:25:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:25:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:25:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:25:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:25:46,055 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:25:46,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:25:46 BoogieIcfgContainer [2018-11-14 16:25:46,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:25:46,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:25:46,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:25:46,060 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:25:46,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:25:43" (1/3) ... [2018-11-14 16:25:46,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7105cd70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:25:46, skipping insertion in model container [2018-11-14 16:25:46,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:44" (2/3) ... [2018-11-14 16:25:46,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7105cd70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:25:46, skipping insertion in model container [2018-11-14 16:25:46,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:25:46" (3/3) ... [2018-11-14 16:25:46,064 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-14 16:25:46,074 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:25:46,085 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-14 16:25:46,105 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-14 16:25:46,135 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:25:46,136 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:25:46,136 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:25:46,136 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:25:46,136 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:25:46,137 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:25:46,137 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:25:46,137 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:25:46,137 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:25:46,162 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-14 16:25:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 16:25:46,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:25:46,172 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:25:46,177 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:25:46,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:25:46,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1340247699, now seen corresponding path program 1 times [2018-11-14 16:25:46,187 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:25:46,188 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:25:46,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:25:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:46,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:25:46,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2018-11-14 16:25:46,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {40#true} is VALID [2018-11-14 16:25:46,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-14 16:25:46,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #124#return; {40#true} is VALID [2018-11-14 16:25:46,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret17 := main(); {40#true} is VALID [2018-11-14 16:25:46,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~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; {40#true} is VALID [2018-11-14 16:25:46,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {40#true} assume !true; {41#false} is VALID [2018-11-14 16:25:46,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#false} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {41#false} is VALID [2018-11-14 16:25:46,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {41#false} assume true; {41#false} is VALID [2018-11-14 16:25:46,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {41#false} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {41#false} is VALID [2018-11-14 16:25:46,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {41#false} assume !false; {41#false} is VALID [2018-11-14 16:25:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:25:46,446 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:25:46,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:25:46,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:25:46,456 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 16:25:46,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:25:46,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:25:46,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:25:46,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:25:46,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:25:46,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:25:46,532 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-14 16:25:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:46,847 INFO L93 Difference]: Finished difference Result 65 states and 96 transitions. [2018-11-14 16:25:46,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:25:46,848 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 16:25:46,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:25:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:25:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 96 transitions. [2018-11-14 16:25:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:25:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 96 transitions. [2018-11-14 16:25:46,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 96 transitions. [2018-11-14 16:25:47,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:25:47,736 INFO L225 Difference]: With dead ends: 65 [2018-11-14 16:25:47,736 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 16:25:47,742 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:25:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 16:25:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 16:25:47,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:25:47,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 16:25:47,797 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 16:25:47,797 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 16:25:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:47,803 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 16:25:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 16:25:47,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:47,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:47,804 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 16:25:47,804 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 16:25:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:47,808 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 16:25:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 16:25:47,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:47,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:47,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:25:47,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:25:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 16:25:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-14 16:25:47,815 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2018-11-14 16:25:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:25:47,815 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-14 16:25:47,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:25:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 16:25:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 16:25:47,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:25:47,816 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:25:47,817 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:25:47,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:25:47,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1814006705, now seen corresponding path program 1 times [2018-11-14 16:25:47,818 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:25:47,818 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:25:47,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:25:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:47,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:25:48,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2018-11-14 16:25:48,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {239#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {239#true} is VALID [2018-11-14 16:25:48,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {239#true} assume true; {239#true} is VALID [2018-11-14 16:25:48,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} #124#return; {239#true} is VALID [2018-11-14 16:25:48,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {239#true} call #t~ret17 := main(); {239#true} is VALID [2018-11-14 16:25:48,030 INFO L273 TraceCheckUtils]: 5: Hoare triple {239#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~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; {259#(not (= (_ bv0 32) main_~list~0.base))} is VALID [2018-11-14 16:25:48,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {259#(not (= (_ bv0 32) main_~list~0.base))} assume true; {259#(not (= (_ bv0 32) main_~list~0.base))} is VALID [2018-11-14 16:25:48,032 INFO L273 TraceCheckUtils]: 7: Hoare triple {259#(not (= (_ bv0 32) main_~list~0.base))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {259#(not (= (_ bv0 32) main_~list~0.base))} is VALID [2018-11-14 16:25:48,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {259#(not (= (_ bv0 32) main_~list~0.base))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {269#(not (= (_ bv0 32) main_~end~0.base))} is VALID [2018-11-14 16:25:48,033 INFO L273 TraceCheckUtils]: 9: Hoare triple {269#(not (= (_ bv0 32) main_~end~0.base))} assume true; {269#(not (= (_ bv0 32) main_~end~0.base))} is VALID [2018-11-14 16:25:48,034 INFO L273 TraceCheckUtils]: 10: Hoare triple {269#(not (= (_ bv0 32) main_~end~0.base))} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {240#false} is VALID [2018-11-14 16:25:48,034 INFO L273 TraceCheckUtils]: 11: Hoare triple {240#false} assume !false; {240#false} is VALID [2018-11-14 16:25:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:25:48,037 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:25:48,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:25:48,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:25:48,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 16:25:48,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:25:48,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:25:48,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:25:48,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:25:48,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:25:48,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:25:48,073 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 4 states. [2018-11-14 16:25:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:48,458 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-14 16:25:48,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:25:48,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 16:25:48,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:25:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:25:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-14 16:25:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:25:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-14 16:25:48,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2018-11-14 16:25:48,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:25:48,541 INFO L225 Difference]: With dead ends: 38 [2018-11-14 16:25:48,541 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 16:25:48,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:25:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 16:25:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-14 16:25:48,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:25:48,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 27 states. [2018-11-14 16:25:48,554 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 27 states. [2018-11-14 16:25:48,554 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 27 states. [2018-11-14 16:25:48,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:48,557 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 16:25:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 16:25:48,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:48,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:48,558 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 36 states. [2018-11-14 16:25:48,558 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 36 states. [2018-11-14 16:25:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:48,561 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 16:25:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 16:25:48,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:48,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:48,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:25:48,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:25:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 16:25:48,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-14 16:25:48,565 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 12 [2018-11-14 16:25:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:25:48,565 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-14 16:25:48,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:25:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 16:25:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:25:48,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:25:48,566 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:25:48,567 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:25:48,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:25:48,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1791282980, now seen corresponding path program 1 times [2018-11-14 16:25:48,568 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:25:48,568 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:25:48,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:25:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:48,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:25:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 16:25:48,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 16:25:48,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:48,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:48,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:48,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-14 16:25:49,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:25:49,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:25:49,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:49,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:49,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:49,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 16:25:49,040 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:25:49,053 INFO L256 TraceCheckUtils]: 0: Hoare triple {429#true} call ULTIMATE.init(); {429#true} is VALID [2018-11-14 16:25:49,053 INFO L273 TraceCheckUtils]: 1: Hoare triple {429#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {429#true} is VALID [2018-11-14 16:25:49,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {429#true} assume true; {429#true} is VALID [2018-11-14 16:25:49,054 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {429#true} {429#true} #124#return; {429#true} is VALID [2018-11-14 16:25:49,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {429#true} call #t~ret17 := main(); {429#true} is VALID [2018-11-14 16:25:49,057 INFO L273 TraceCheckUtils]: 5: Hoare triple {429#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~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; {449#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:25:49,058 INFO L273 TraceCheckUtils]: 6: Hoare triple {449#(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; {449#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:25:49,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {449#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {449#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:25:49,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {449#(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 := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {459#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:25:49,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {459#(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; {459#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:25:49,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {459#(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 !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {459#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:25:49,084 INFO L273 TraceCheckUtils]: 11: Hoare triple {459#(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; {459#(and (= main_~end~0.offset (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:25:49,098 INFO L273 TraceCheckUtils]: 12: Hoare triple {459#(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~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {472#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2018-11-14 16:25:49,109 INFO L273 TraceCheckUtils]: 13: Hoare triple {472#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {430#false} is VALID [2018-11-14 16:25:49,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {430#false} assume !false; {430#false} is VALID [2018-11-14 16:25:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:25:49,116 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:25:49,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:25:49,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:25:49,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:25:49,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:25:49,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:25:49,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:25:49,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:25:49,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:25:49,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:25:49,147 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2018-11-14 16:25:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:50,245 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-14 16:25:50,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:25:50,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:25:50,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:25:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:25:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2018-11-14 16:25:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:25:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2018-11-14 16:25:50,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2018-11-14 16:25:50,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:25:50,530 INFO L225 Difference]: With dead ends: 63 [2018-11-14 16:25:50,530 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 16:25:50,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:25:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 16:25:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 36. [2018-11-14 16:25:50,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:25:50,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 36 states. [2018-11-14 16:25:50,575 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 36 states. [2018-11-14 16:25:50,575 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 36 states. [2018-11-14 16:25:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:50,582 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-14 16:25:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-14 16:25:50,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:50,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:50,590 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 61 states. [2018-11-14 16:25:50,590 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 61 states. [2018-11-14 16:25:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:50,599 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-14 16:25:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-14 16:25:50,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:50,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:50,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:25:50,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:25:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 16:25:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-14 16:25:50,603 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 15 [2018-11-14 16:25:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:25:50,603 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-14 16:25:50,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:25:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-14 16:25:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:25:50,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:25:50,605 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:25:50,605 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:25:50,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:25:50,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1914673853, now seen corresponding path program 1 times [2018-11-14 16:25:50,612 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:25:50,612 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:25:50,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:25:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:50,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:25:50,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 16:25:50,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:50,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 16:25:50,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 16:25:50,915 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:50,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:50,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:50,932 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:23, output treesize:18 [2018-11-14 16:25:50,947 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:25:51,020 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:25:51,022 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:25:51,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-14 16:25:51,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:51,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:51,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-14 16:25:51,053 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:25:51,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-11-14 16:25:51,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 16:25:51,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:51,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 61 [2018-11-14 16:25:51,378 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:25:51,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-14 16:25:51,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:51,610 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:25:51,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 39 [2018-11-14 16:25:51,642 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-14 16:25:51,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-14 16:25:51,930 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:51,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:25:52,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:25:52,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-14 16:25:52,079 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:48, output treesize:58 [2018-11-14 16:25:52,159 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:25:52,336 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-11-14 16:25:52,719 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 20 [2018-11-14 16:25:52,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:25:52,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:52,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-14 16:25:52,749 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:52,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:52,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-14 16:25:52,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-14 16:25:52,810 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:52,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:25:52,826 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:52,834 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:52,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:52,859 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:55, output treesize:3 [2018-11-14 16:25:52,864 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:25:52,884 INFO L256 TraceCheckUtils]: 0: Hoare triple {721#true} call ULTIMATE.init(); {721#true} is VALID [2018-11-14 16:25:52,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {721#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {721#true} is VALID [2018-11-14 16:25:52,885 INFO L273 TraceCheckUtils]: 2: Hoare triple {721#true} assume true; {721#true} is VALID [2018-11-14 16:25:52,886 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {721#true} {721#true} #124#return; {721#true} is VALID [2018-11-14 16:25:52,886 INFO L256 TraceCheckUtils]: 4: Hoare triple {721#true} call #t~ret17 := main(); {721#true} is VALID [2018-11-14 16:25:52,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {721#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~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; {741#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:25:52,889 INFO L273 TraceCheckUtils]: 6: Hoare triple {741#(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; {741#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:25:52,890 INFO L273 TraceCheckUtils]: 7: Hoare triple {741#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32); {748#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:25:52,898 INFO L273 TraceCheckUtils]: 8: Hoare triple {748#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {752#(or (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (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))) (and (exists ((v_main_~end~0.base_22 (_ BitVec 32)) (v_main_~end~0.offset_22 (_ BitVec 32))) (and (not (= v_main_~end~0.base_22 main_~list~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_22) (bvadd v_main_~end~0.offset_22 (_ bv4 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-14 16:25:52,899 INFO L273 TraceCheckUtils]: 9: Hoare triple {752#(or (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (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))) (and (exists ((v_main_~end~0.base_22 (_ BitVec 32)) (v_main_~end~0.offset_22 (_ BitVec 32))) (and (not (= v_main_~end~0.base_22 main_~list~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_22) (bvadd v_main_~end~0.offset_22 (_ bv4 32)))))) (= ~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; {752#(or (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (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))) (and (exists ((v_main_~end~0.base_22 (_ BitVec 32)) (v_main_~end~0.offset_22 (_ BitVec 32))) (and (not (= v_main_~end~0.base_22 main_~list~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_22) (bvadd v_main_~end~0.offset_22 (_ bv4 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-14 16:25:52,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {752#(or (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (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))) (and (exists ((v_main_~end~0.base_22 (_ BitVec 32)) (v_main_~end~0.offset_22 (_ BitVec 32))) (and (not (= v_main_~end~0.base_22 main_~list~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_22) (bvadd v_main_~end~0.offset_22 (_ bv4 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {752#(or (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (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))) (and (exists ((v_main_~end~0.base_22 (_ BitVec 32)) (v_main_~end~0.offset_22 (_ BitVec 32))) (and (not (= v_main_~end~0.base_22 main_~list~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_22) (bvadd v_main_~end~0.offset_22 (_ bv4 32)))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32))))} is VALID [2018-11-14 16:25:52,904 INFO L273 TraceCheckUtils]: 11: Hoare triple {752#(or (and (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (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))) (and (exists ((v_main_~end~0.base_22 (_ BitVec 32)) (v_main_~end~0.offset_22 (_ BitVec 32))) (and (not (= v_main_~end~0.base_22 main_~list~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_22) (bvadd v_main_~end~0.offset_22 (_ bv4 32)))))) (= ~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 := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {762#(or (and (exists ((v_main_~end~0.base_22 (_ BitVec 32)) (v_main_~end~0.offset_22 (_ BitVec 32))) (and (not (= v_main_~end~0.base_22 main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_22) (bvadd v_main_~end~0.offset_22 (_ bv4 32)))))) (= 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)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} is VALID [2018-11-14 16:25:52,905 INFO L273 TraceCheckUtils]: 12: Hoare triple {762#(or (and (exists ((v_main_~end~0.base_22 (_ BitVec 32)) (v_main_~end~0.offset_22 (_ BitVec 32))) (and (not (= v_main_~end~0.base_22 main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_22) (bvadd v_main_~end~0.offset_22 (_ bv4 32)))))) (= 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)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} assume true; {762#(or (and (exists ((v_main_~end~0.base_22 (_ BitVec 32)) (v_main_~end~0.offset_22 (_ BitVec 32))) (and (not (= v_main_~end~0.base_22 main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_22) (bvadd v_main_~end~0.offset_22 (_ bv4 32)))))) (= 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)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} is VALID [2018-11-14 16:25:52,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {762#(or (and (exists ((v_main_~end~0.base_22 (_ BitVec 32)) (v_main_~end~0.offset_22 (_ BitVec 32))) (and (not (= v_main_~end~0.base_22 main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_22) (bvadd v_main_~end~0.offset_22 (_ bv4 32)))))) (= 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)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {762#(or (and (exists ((v_main_~end~0.base_22 (_ BitVec 32)) (v_main_~end~0.offset_22 (_ BitVec 32))) (and (not (= v_main_~end~0.base_22 main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_22) (bvadd v_main_~end~0.offset_22 (_ bv4 32)))))) (= 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)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} is VALID [2018-11-14 16:25:52,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {762#(or (and (exists ((v_main_~end~0.base_22 (_ BitVec 32)) (v_main_~end~0.offset_22 (_ BitVec 32))) (and (not (= v_main_~end~0.base_22 main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_22) (bvadd v_main_~end~0.offset_22 (_ bv4 32)))))) (= 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)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} assume true; {762#(or (and (exists ((v_main_~end~0.base_22 (_ BitVec 32)) (v_main_~end~0.offset_22 (_ BitVec 32))) (and (not (= v_main_~end~0.base_22 main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_22) (bvadd v_main_~end~0.offset_22 (_ bv4 32)))))) (= 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)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} is VALID [2018-11-14 16:25:52,911 INFO L273 TraceCheckUtils]: 15: Hoare triple {762#(or (and (exists ((v_main_~end~0.base_22 (_ BitVec 32)) (v_main_~end~0.offset_22 (_ BitVec 32))) (and (not (= v_main_~end~0.base_22 main_~end~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_22) (bvadd v_main_~end~0.offset_22 (_ bv4 32)))))) (= 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)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))) (exists ((v_prenex_3 (_ BitVec 32))) (and (= ~unnamed1~0~BLACK (select (select |#memory_int| v_prenex_3) (_ bv4 32))) (not (= main_~end~0.base v_prenex_3))))))} assume true;call #t~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {775#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2018-11-14 16:25:52,912 INFO L273 TraceCheckUtils]: 16: Hoare triple {775#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {722#false} is VALID [2018-11-14 16:25:52,912 INFO L273 TraceCheckUtils]: 17: Hoare triple {722#false} assume !false; {722#false} is VALID [2018-11-14 16:25:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:25:52,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:25:59,560 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:59,560 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:77, output treesize:1 [2018-11-14 16:25:59,572 INFO L273 TraceCheckUtils]: 17: Hoare triple {722#false} assume !false; {722#false} is VALID [2018-11-14 16:25:59,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {775#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {722#false} is VALID [2018-11-14 16:25:59,573 INFO L273 TraceCheckUtils]: 15: Hoare triple {788#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true;call #t~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {775#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2018-11-14 16:25:59,574 INFO L273 TraceCheckUtils]: 14: Hoare triple {788#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {788#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:25:59,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {788#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {788#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:25:59,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {788#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {788#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:25:59,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {801#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {788#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:25:59,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {801#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {801#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:25:59,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {801#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} assume true; {801#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:25:59,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {811#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc5.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~malloc5.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~malloc5.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {801#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:25:59,597 INFO L273 TraceCheckUtils]: 7: Hoare triple {815#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc5.base_2| (_ BitVec 32)) (|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2| (store (select (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1)))))} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32); {811#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc5.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~malloc5.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~malloc5.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:25:59,598 INFO L273 TraceCheckUtils]: 6: Hoare triple {815#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc5.base_2| (_ BitVec 32)) (|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2| (store (select (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1)))))} assume true; {815#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc5.base_2| (_ BitVec 32)) (|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2| (store (select (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1)))))} is VALID [2018-11-14 16:25:59,602 INFO L273 TraceCheckUtils]: 5: Hoare triple {721#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~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; {815#(forall ((main_~end~0.offset (_ BitVec 32)) (|v_main_#t~malloc5.base_2| (_ BitVec 32)) (|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2| (store (select (store |#memory_int| |v_main_#t~malloc2.base_2| (store (select |#memory_int| |v_main_#t~malloc2.base_2|) (bvadd main_~end~0.offset (_ bv4 32)) ~unnamed1~0~RED)) |v_main_#t~malloc5.base_2|) (_ bv4 32) ~unnamed1~0~BLACK)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1)))))} is VALID [2018-11-14 16:25:59,602 INFO L256 TraceCheckUtils]: 4: Hoare triple {721#true} call #t~ret17 := main(); {721#true} is VALID [2018-11-14 16:25:59,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {721#true} {721#true} #124#return; {721#true} is VALID [2018-11-14 16:25:59,603 INFO L273 TraceCheckUtils]: 2: Hoare triple {721#true} assume true; {721#true} is VALID [2018-11-14 16:25:59,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {721#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {721#true} is VALID [2018-11-14 16:25:59,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {721#true} call ULTIMATE.init(); {721#true} is VALID [2018-11-14 16:25:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 16:25:59,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:25:59,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-14 16:25:59,609 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-14 16:25:59,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:25:59,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:25:59,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:25:59,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:25:59,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:25:59,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=82, Unknown=2, NotChecked=0, Total=110 [2018-11-14 16:25:59,717 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 11 states. [2018-11-14 16:26:05,311 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-11-14 16:26:05,642 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-11-14 16:26:11,019 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2018-11-14 16:26:12,073 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-14 16:26:12,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:12,478 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-14 16:26:12,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:26:12,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-14 16:26:12,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:26:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:26:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2018-11-14 16:26:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:26:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2018-11-14 16:26:12,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 77 transitions. [2018-11-14 16:26:12,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:26:12,670 INFO L225 Difference]: With dead ends: 76 [2018-11-14 16:26:12,670 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 16:26:12,671 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=112, Invalid=266, Unknown=2, NotChecked=0, Total=380 [2018-11-14 16:26:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 16:26:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 25. [2018-11-14 16:26:12,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:26:12,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 25 states. [2018-11-14 16:26:12,736 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 25 states. [2018-11-14 16:26:12,736 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 25 states. [2018-11-14 16:26:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:12,740 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-14 16:26:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-11-14 16:26:12,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:26:12,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:26:12,741 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 74 states. [2018-11-14 16:26:12,741 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 74 states. [2018-11-14 16:26:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:12,747 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-14 16:26:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-11-14 16:26:12,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:26:12,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:26:12,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:26:12,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:26:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 16:26:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-14 16:26:12,750 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2018-11-14 16:26:12,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:26:12,750 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-14 16:26:12,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:26:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-14 16:26:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:26:12,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:26:12,751 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:26:12,751 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:26:12,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:26:12,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1594530548, now seen corresponding path program 1 times [2018-11-14 16:26:12,752 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:26:12,752 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:26:12,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:26:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:26:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:26:12,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:26:12,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 16:26:12,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-14 16:26:12,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:12,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:26:12,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:26:12,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-14 16:26:12,884 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:26:12,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {1123#true} call ULTIMATE.init(); {1123#true} is VALID [2018-11-14 16:26:12,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {1123#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1123#true} is VALID [2018-11-14 16:26:12,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {1123#true} assume true; {1123#true} is VALID [2018-11-14 16:26:12,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1123#true} {1123#true} #124#return; {1123#true} is VALID [2018-11-14 16:26:12,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {1123#true} call #t~ret17 := main(); {1123#true} is VALID [2018-11-14 16:26:12,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {1123#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32);call write~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; {1123#true} is VALID [2018-11-14 16:26:12,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {1123#true} assume true; {1123#true} is VALID [2018-11-14 16:26:12,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {1123#true} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {1123#true} is VALID [2018-11-14 16:26:12,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {1123#true} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1123#true} is VALID [2018-11-14 16:26:12,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {1123#true} assume true; {1123#true} is VALID [2018-11-14 16:26:12,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {1123#true} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {1123#true} is VALID [2018-11-14 16:26:12,904 INFO L273 TraceCheckUtils]: 11: Hoare triple {1123#true} assume true; {1123#true} is VALID [2018-11-14 16:26:12,905 INFO L273 TraceCheckUtils]: 12: Hoare triple {1123#true} assume true;call #t~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1164#(= |main_#t~mem7| (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:26:12,905 INFO L273 TraceCheckUtils]: 13: Hoare triple {1164#(= |main_#t~mem7| (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {1168#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:26:12,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {1168#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {1168#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:26:12,906 INFO L273 TraceCheckUtils]: 15: Hoare triple {1168#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume true; {1168#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2018-11-14 16:26:12,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {1168#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset);call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); {1178#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2018-11-14 16:26:12,907 INFO L273 TraceCheckUtils]: 17: Hoare triple {1178#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume ~unnamed1~0~RED == #t~mem8;havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;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; {1124#false} is VALID [2018-11-14 16:26:12,908 INFO L273 TraceCheckUtils]: 18: Hoare triple {1124#false} assume true;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); {1124#false} is VALID [2018-11-14 16:26:12,908 INFO L273 TraceCheckUtils]: 19: Hoare triple {1124#false} assume #t~mem11.base == 0bv32 && #t~mem11.offset == 0bv32;havoc #t~mem11.base, #t~mem11.offset; {1124#false} is VALID [2018-11-14 16:26:12,908 INFO L273 TraceCheckUtils]: 20: Hoare triple {1124#false} assume !false; {1124#false} is VALID [2018-11-14 16:26:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:26:12,910 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:26:12,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:26:12,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:26:12,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 16:26:12,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:26:12,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:26:12,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:26:12,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:26:12,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:26:12,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:26:12,936 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-14 16:26:13,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:13,501 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-14 16:26:13,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:26:13,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 16:26:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:26:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:26:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-14 16:26:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:26:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-14 16:26:13,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2018-11-14 16:26:13,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:26:13,619 INFO L225 Difference]: With dead ends: 43 [2018-11-14 16:26:13,619 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 16:26:13,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:26:13,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 16:26:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-14 16:26:13,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:26:13,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 28 states. [2018-11-14 16:26:13,636 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 28 states. [2018-11-14 16:26:13,636 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 28 states. [2018-11-14 16:26:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:13,638 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 16:26:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 16:26:13,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:26:13,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:26:13,639 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 34 states. [2018-11-14 16:26:13,639 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 34 states. [2018-11-14 16:26:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:13,641 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 16:26:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 16:26:13,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:26:13,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:26:13,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:26:13,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:26:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:26:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-14 16:26:13,643 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 21 [2018-11-14 16:26:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:26:13,643 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-14 16:26:13,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:26:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 16:26:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:26:13,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:26:13,644 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:26:13,645 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:26:13,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:26:13,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1594470966, now seen corresponding path program 1 times [2018-11-14 16:26:13,645 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:26:13,645 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:26:13,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:26:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 16:26:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 16:26:13,765 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 16:26:13,802 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 16:26:13,802 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 16:26:13,803 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 16:26:13,803 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 16:26:13,803 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 16:26:13,803 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 16:26:13,803 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 16:26:13,803 WARN L170 areAnnotationChecker]: L1009-2 has no Hoare annotation [2018-11-14 16:26:13,803 WARN L170 areAnnotationChecker]: L1009-2 has no Hoare annotation [2018-11-14 16:26:13,803 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:26:13,804 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:26:13,804 WARN L170 areAnnotationChecker]: L1002-1 has no Hoare annotation [2018-11-14 16:26:13,804 WARN L170 areAnnotationChecker]: L1002-1 has no Hoare annotation [2018-11-14 16:26:13,804 WARN L170 areAnnotationChecker]: L1002-3 has no Hoare annotation [2018-11-14 16:26:13,804 WARN L170 areAnnotationChecker]: L1009 has no Hoare annotation [2018-11-14 16:26:13,804 WARN L170 areAnnotationChecker]: L1009 has no Hoare annotation [2018-11-14 16:26:13,804 WARN L170 areAnnotationChecker]: L1027-6 has no Hoare annotation [2018-11-14 16:26:13,804 WARN L170 areAnnotationChecker]: L1027-6 has no Hoare annotation [2018-11-14 16:26:13,804 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2018-11-14 16:26:13,804 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2018-11-14 16:26:13,805 WARN L170 areAnnotationChecker]: L1028-5 has no Hoare annotation [2018-11-14 16:26:13,805 WARN L170 areAnnotationChecker]: L1028-5 has no Hoare annotation [2018-11-14 16:26:13,805 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2018-11-14 16:26:13,805 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2018-11-14 16:26:13,805 WARN L170 areAnnotationChecker]: L1027-4 has no Hoare annotation [2018-11-14 16:26:13,805 WARN L170 areAnnotationChecker]: L1027-4 has no Hoare annotation [2018-11-14 16:26:13,805 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2018-11-14 16:26:13,805 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2018-11-14 16:26:13,805 WARN L170 areAnnotationChecker]: L1030-2 has no Hoare annotation [2018-11-14 16:26:13,805 WARN L170 areAnnotationChecker]: L1030-2 has no Hoare annotation [2018-11-14 16:26:13,806 WARN L170 areAnnotationChecker]: L1028-1 has no Hoare annotation [2018-11-14 16:26:13,806 WARN L170 areAnnotationChecker]: L1028-1 has no Hoare annotation [2018-11-14 16:26:13,806 WARN L170 areAnnotationChecker]: L1028-3 has no Hoare annotation [2018-11-14 16:26:13,806 WARN L170 areAnnotationChecker]: L1028-3 has no Hoare annotation [2018-11-14 16:26:13,806 WARN L170 areAnnotationChecker]: L1030 has no Hoare annotation [2018-11-14 16:26:13,806 WARN L170 areAnnotationChecker]: L1030 has no Hoare annotation [2018-11-14 16:26:13,806 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2018-11-14 16:26:13,806 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2018-11-14 16:26:13,806 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2018-11-14 16:26:13,807 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2018-11-14 16:26:13,807 WARN L170 areAnnotationChecker]: L1043 has no Hoare annotation [2018-11-14 16:26:13,807 WARN L170 areAnnotationChecker]: L1043 has no Hoare annotation [2018-11-14 16:26:13,807 WARN L170 areAnnotationChecker]: L1043-2 has no Hoare annotation [2018-11-14 16:26:13,807 WARN L170 areAnnotationChecker]: L1038-5 has no Hoare annotation [2018-11-14 16:26:13,807 WARN L170 areAnnotationChecker]: L1038-5 has no Hoare annotation [2018-11-14 16:26:13,807 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2018-11-14 16:26:13,807 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2018-11-14 16:26:13,807 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:26:13,807 WARN L170 areAnnotationChecker]: L1038 has no Hoare annotation [2018-11-14 16:26:13,808 WARN L170 areAnnotationChecker]: L1038 has no Hoare annotation [2018-11-14 16:26:13,808 WARN L170 areAnnotationChecker]: L1038-6 has no Hoare annotation [2018-11-14 16:26:13,808 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:26:13,808 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2018-11-14 16:26:13,808 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2018-11-14 16:26:13,808 WARN L170 areAnnotationChecker]: L1038-3 has no Hoare annotation [2018-11-14 16:26:13,808 WARN L170 areAnnotationChecker]: L1038-3 has no Hoare annotation [2018-11-14 16:26:13,808 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 16:26:13,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:26:13 BoogieIcfgContainer [2018-11-14 16:26:13,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:26:13,814 INFO L168 Benchmark]: Toolchain (without parser) took 29831.24 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 876.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.9 MB). Peak memory consumption was 98.2 MB. Max. memory is 7.1 GB. [2018-11-14 16:26:13,815 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:26:13,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.5 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2018-11-14 16:26:13,816 INFO L168 Benchmark]: Boogie Preprocessor took 91.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2018-11-14 16:26:13,817 INFO L168 Benchmark]: RCFGBuilder took 1223.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. [2018-11-14 16:26:13,817 INFO L168 Benchmark]: TraceAbstraction took 27755.41 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 120.6 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -42.3 MB). Peak memory consumption was 78.3 MB. Max. memory is 7.1 GB. [2018-11-14 16:26:13,822 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.5 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 91.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1223.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27755.41 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 120.6 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -42.3 MB). Peak memory consumption was 78.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L995] EXPR, FCALL malloc(sizeof(SLL)) [L995] SLL* list = malloc(sizeof(SLL)); [L996] FCALL list->next = ((void*)0) [L997] FCALL list->colour = BLACK [L999] SLL* end = list; VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1027] COND FALSE !(0) VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1028] EXPR, FCALL end->colour VAL [end={1:0}, end->colour=1, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1028] COND FALSE !(0) VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1030] COND TRUE ((void*)0) != end [L1032] EXPR, FCALL end->colour VAL [end={1:0}, end->colour=1, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR, FCALL end->next VAL [end={1:0}, end->next={0:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 37 locations, 3 error locations. UNSAFE Result, 27.6s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 16.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 155 SDtfs, 169 SDslu, 264 SDs, 0 SdLazy, 186 SolverSat, 46 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 89 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 89 ConstructedInterpolants, 10 QuantifiedInterpolants, 13865 SizeOfPredicates, 27 NumberOfNonLiveVariables, 263 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...