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/heap-data/min_max_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:34:14,139 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:34:14,141 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:34:14,154 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:34:14,154 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:34:14,155 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:34:14,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:34:14,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:34:14,160 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:34:14,161 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:34:14,162 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:34:14,162 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:34:14,163 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:34:14,164 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:34:14,165 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:34:14,166 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:34:14,167 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:34:14,169 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:34:14,171 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:34:14,173 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:34:14,174 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:34:14,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:34:14,177 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:34:14,177 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:34:14,178 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:34:14,179 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:34:14,180 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:34:14,180 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:34:14,181 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:34:14,182 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:34:14,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:34:14,183 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:34:14,184 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:34:14,184 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:34:14,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:34:14,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:34:14,186 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:34:14,201 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:34:14,201 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:34:14,202 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:34:14,203 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:34:14,203 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:34:14,203 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:34:14,204 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:34:14,204 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:34:14,204 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:34:14,204 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:34:14,204 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:34:14,205 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:34:14,205 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:34:14,205 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:34:14,205 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:34:14,205 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:34:14,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:34:14,206 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:34:14,206 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:34:14,206 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:34:14,206 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:34:14,207 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:34:14,207 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:34:14,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:34:14,207 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:34:14,207 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:34:14,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:34:14,208 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:34:14,208 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:34:14,209 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:34:14,209 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:34:14,209 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:34:14,272 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:34:14,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:34:14,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:34:14,298 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:34:14,298 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:34:14,299 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/min_max_true-unreach-call.i [2018-11-14 16:34:14,365 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7c349d6/7c02d907d653493ab2665c43d2c4f2e1/FLAGcd66dbde0 [2018-11-14 16:34:14,935 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:34:14,936 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/min_max_true-unreach-call.i [2018-11-14 16:34:14,952 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7c349d6/7c02d907d653493ab2665c43d2c4f2e1/FLAGcd66dbde0 [2018-11-14 16:34:14,971 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7c349d6/7c02d907d653493ab2665c43d2c4f2e1 [2018-11-14 16:34:14,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:34:14,984 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:34:14,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:34:14,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:34:14,989 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:34:14,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:34:14" (1/1) ... [2018-11-14 16:34:14,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4289dc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:14, skipping insertion in model container [2018-11-14 16:34:14,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:34:14" (1/1) ... [2018-11-14 16:34:15,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:34:15,062 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:34:15,435 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:34:15,456 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:34:15,540 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:34:15,712 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:34:15,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:15 WrapperNode [2018-11-14 16:34:15,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:34:15,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:34:15,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:34:15,714 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:34:15,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:15" (1/1) ... [2018-11-14 16:34:15,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:15" (1/1) ... [2018-11-14 16:34:15,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:15" (1/1) ... [2018-11-14 16:34:15,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:15" (1/1) ... [2018-11-14 16:34:15,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:15" (1/1) ... [2018-11-14 16:34:15,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:15" (1/1) ... [2018-11-14 16:34:15,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:15" (1/1) ... [2018-11-14 16:34:15,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:34:15,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:34:15,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:34:15,835 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:34:15,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:15" (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:34:15,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:34:15,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:34:15,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 16:34:15,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 16:34:15,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:34:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:34:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:34:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 16:34:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 16:34:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 16:34:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 16:34:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 16:34:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 16:34:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 16:34:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 16:34:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 16:34:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 16:34:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 16:34:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 16:34:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 16:34:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 16:34:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 16:34:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 16:34:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 16:34:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 16:34:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 16:34:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 16:34:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 16:34:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 16:34:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 16:34:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 16:34:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 16:34:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 16:34:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 16:34:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 16:34:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 16:34:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 16:34:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 16:34:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 16:34:15,899 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 16:34:15,899 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 16:34:15,899 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 16:34:15,899 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 16:34:15,899 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 16:34:15,899 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 16:34:15,899 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 16:34:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 16:34:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 16:34:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 16:34:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 16:34:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 16:34:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 16:34:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 16:34:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 16:34:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 16:34:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 16:34:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 16:34:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 16:34:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 16:34:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 16:34:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 16:34:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 16:34:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 16:34:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 16:34:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 16:34:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 16:34:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 16:34:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 16:34:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 16:34:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 16:34:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 16:34:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 16:34:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 16:34:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 16:34:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 16:34:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 16:34:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 16:34:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 16:34:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 16:34:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 16:34:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 16:34:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 16:34:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 16:34:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 16:34:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 16:34:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 16:34:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 16:34:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 16:34:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 16:34:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 16:34:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 16:34:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 16:34:15,907 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 16:34:15,907 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 16:34:15,907 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 16:34:15,907 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 16:34:15,907 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 16:34:15,907 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 16:34:15,908 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 16:34:15,908 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 16:34:15,908 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 16:34:15,908 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 16:34:15,908 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 16:34:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 16:34:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 16:34:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 16:34:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 16:34:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 16:34:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 16:34:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 16:34:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 16:34:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 16:34:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:34:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:34:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:34:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 16:34:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:34:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 16:34:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:34:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:34:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:34:15,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:34:16,595 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:34:16,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:34:16 BoogieIcfgContainer [2018-11-14 16:34:16,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:34:16,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:34:16,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:34:16,601 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:34:16,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:34:14" (1/3) ... [2018-11-14 16:34:16,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2798f89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:34:16, skipping insertion in model container [2018-11-14 16:34:16,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:15" (2/3) ... [2018-11-14 16:34:16,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2798f89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:34:16, skipping insertion in model container [2018-11-14 16:34:16,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:34:16" (3/3) ... [2018-11-14 16:34:16,604 INFO L112 eAbstractionObserver]: Analyzing ICFG min_max_true-unreach-call.i [2018-11-14 16:34:16,615 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:34:16,626 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-14 16:34:16,648 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-14 16:34:16,681 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:34:16,682 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:34:16,682 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:34:16,683 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:34:16,683 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:34:16,683 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:34:16,683 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:34:16,683 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:34:16,684 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:34:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-14 16:34:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 16:34:16,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:34:16,719 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:34:16,722 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:34:16,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:34:16,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1762588199, now seen corresponding path program 1 times [2018-11-14 16:34:16,731 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:34:16,732 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:34:16,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:34:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:16,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:34:16,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-14 16:34:16,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {29#true} is VALID [2018-11-14 16:34:16,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-14 16:34:16,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #70#return; {29#true} is VALID [2018-11-14 16:34:16,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret12 := main(); {29#true} is VALID [2018-11-14 16:34:16,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {29#true} is VALID [2018-11-14 16:34:16,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-14 16:34:16,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {30#false} is VALID [2018-11-14 16:34:16,920 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#false} assume true; {30#false} is VALID [2018-11-14 16:34:16,920 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {30#false} is VALID [2018-11-14 16:34:16,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {30#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {30#false} is VALID [2018-11-14 16:34:16,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-14 16:34:16,924 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:34:16,924 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:34:16,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:34:16,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:34:16,933 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-14 16:34:16,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:34:16,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:34:17,062 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:34:17,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:34:17,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:34:17,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:34:17,076 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-14 16:34:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:17,180 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-11-14 16:34:17,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:34:17,180 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-14 16:34:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:34:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:34:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-14 16:34:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:34:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-14 16:34:17,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2018-11-14 16:34:17,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:17,437 INFO L225 Difference]: With dead ends: 41 [2018-11-14 16:34:17,437 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 16:34:17,441 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:34:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 16:34:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 16:34:17,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:34:17,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 16:34:17,561 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 16:34:17,561 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 16:34:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:17,566 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-14 16:34:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-14 16:34:17,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:17,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:17,567 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 16:34:17,568 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 16:34:17,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:17,572 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-14 16:34:17,572 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-14 16:34:17,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:17,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:17,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:34:17,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:34:17,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 16:34:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-14 16:34:17,579 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2018-11-14 16:34:17,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:34:17,580 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-14 16:34:17,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:34:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-14 16:34:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 16:34:17,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:34:17,581 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:34:17,581 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:34:17,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:34:17,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1095088932, now seen corresponding path program 1 times [2018-11-14 16:34:17,583 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:34:17,583 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:34:17,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:34:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:17,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:34:18,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {186#true} is VALID [2018-11-14 16:34:18,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {186#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {186#true} is VALID [2018-11-14 16:34:18,121 INFO L273 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2018-11-14 16:34:18,121 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} #70#return; {186#true} is VALID [2018-11-14 16:34:18,121 INFO L256 TraceCheckUtils]: 4: Hoare triple {186#true} call #t~ret12 := main(); {186#true} is VALID [2018-11-14 16:34:18,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {186#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {206#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-14 16:34:18,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {206#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume true; {206#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-14 16:34:18,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {206#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {206#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-14 16:34:18,141 INFO L273 TraceCheckUtils]: 8: Hoare triple {206#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {216#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:34:18,142 INFO L273 TraceCheckUtils]: 9: Hoare triple {216#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume true; {216#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:34:18,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {216#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {187#false} is VALID [2018-11-14 16:34:18,143 INFO L273 TraceCheckUtils]: 11: Hoare triple {187#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {187#false} is VALID [2018-11-14 16:34:18,143 INFO L273 TraceCheckUtils]: 12: Hoare triple {187#false} assume !false; {187#false} is VALID [2018-11-14 16:34:18,145 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:34:18,145 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:34:18,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:34:18,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:34:18,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-14 16:34:18,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:34:18,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:34:18,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:18,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:34:18,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:34:18,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:34:18,217 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 4 states. [2018-11-14 16:34:18,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:18,816 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 16:34:18,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:34:18,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-14 16:34:18,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:34:18,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:34:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-14 16:34:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:34:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-14 16:34:18,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2018-11-14 16:34:19,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:19,045 INFO L225 Difference]: With dead ends: 37 [2018-11-14 16:34:19,045 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 16:34:19,047 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:34:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 16:34:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 16:34:19,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:34:19,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 16:34:19,070 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:34:19,070 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:34:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:19,072 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-14 16:34:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 16:34:19,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:19,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:19,073 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:34:19,073 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:34:19,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:19,076 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-14 16:34:19,076 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 16:34:19,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:19,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:19,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:34:19,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:34:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:34:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-14 16:34:19,080 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 13 [2018-11-14 16:34:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:34:19,080 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-14 16:34:19,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:34:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 16:34:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:34:19,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:34:19,082 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:34:19,082 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:34:19,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:34:19,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1051583410, now seen corresponding path program 1 times [2018-11-14 16:34:19,083 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:34:19,083 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:34:19,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:34:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:19,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:34:19,388 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:34:19,430 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:34:19,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:19,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:19,474 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:34:19,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:10 [2018-11-14 16:34:19,484 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:19,823 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:34:19,842 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:34:19,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:19,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:19,854 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:34:19,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 16:34:19,858 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:19,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {355#true} call ULTIMATE.init(); {355#true} is VALID [2018-11-14 16:34:19,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {355#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {355#true} is VALID [2018-11-14 16:34:19,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-14 16:34:19,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} #70#return; {355#true} is VALID [2018-11-14 16:34:19,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {355#true} call #t~ret12 := main(); {355#true} is VALID [2018-11-14 16:34:19,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {355#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {355#true} is VALID [2018-11-14 16:34:19,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-14 16:34:19,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {355#true} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {381#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-14 16:34:19,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {381#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:34:19,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:34:19,927 INFO L273 TraceCheckUtils]: 10: Hoare triple {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:34:19,930 INFO L273 TraceCheckUtils]: 11: Hoare triple {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume true; {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:34:19,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:34:19,932 INFO L273 TraceCheckUtils]: 13: Hoare triple {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {401#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:34:19,934 INFO L273 TraceCheckUtils]: 14: Hoare triple {401#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume true; {401#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:34:19,935 INFO L273 TraceCheckUtils]: 15: Hoare triple {401#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {408#(= main_~min~0 |main_#t~mem9|)} is VALID [2018-11-14 16:34:19,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {408#(= main_~min~0 |main_#t~mem9|)} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {356#false} is VALID [2018-11-14 16:34:19,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {356#false} assume !false; {356#false} is VALID [2018-11-14 16:34:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:34:19,940 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:34:19,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:34:19,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:34:19,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 16:34:19,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:34:19,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:34:19,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:19,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:34:19,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:34:19,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:34:19,985 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2018-11-14 16:34:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:21,012 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-14 16:34:21,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:34:21,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 16:34:21,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:34:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:34:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-14 16:34:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:34:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-14 16:34:21,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2018-11-14 16:34:21,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:21,145 INFO L225 Difference]: With dead ends: 49 [2018-11-14 16:34:21,145 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 16:34:21,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:34:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 16:34:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-11-14 16:34:21,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:34:21,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 32 states. [2018-11-14 16:34:21,209 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 32 states. [2018-11-14 16:34:21,209 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 32 states. [2018-11-14 16:34:21,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:21,212 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-14 16:34:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-14 16:34:21,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:21,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:21,214 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 47 states. [2018-11-14 16:34:21,214 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 47 states. [2018-11-14 16:34:21,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:21,218 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-14 16:34:21,218 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-14 16:34:21,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:21,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:21,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:34:21,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:34:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:34:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-14 16:34:21,221 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 18 [2018-11-14 16:34:21,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:34:21,222 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-14 16:34:21,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:34:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 16:34:21,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:34:21,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:34:21,223 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:34:21,223 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:34:21,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:34:21,224 INFO L82 PathProgramCache]: Analyzing trace with hash 658556400, now seen corresponding path program 1 times [2018-11-14 16:34:21,224 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:34:21,225 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:34:21,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:34:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:21,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:34:21,361 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:34:21,370 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:34:21,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:21,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:21,397 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:34:21,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2018-11-14 16:34:21,406 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:21,560 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 16 treesize of output 12 [2018-11-14 16:34:21,580 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 12 treesize of output 4 [2018-11-14 16:34:21,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:21,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:21,601 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:34:21,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2018-11-14 16:34:21,605 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:21,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {615#true} call ULTIMATE.init(); {615#true} is VALID [2018-11-14 16:34:21,631 INFO L273 TraceCheckUtils]: 1: Hoare triple {615#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {615#true} is VALID [2018-11-14 16:34:21,631 INFO L273 TraceCheckUtils]: 2: Hoare triple {615#true} assume true; {615#true} is VALID [2018-11-14 16:34:21,631 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {615#true} {615#true} #70#return; {615#true} is VALID [2018-11-14 16:34:21,632 INFO L256 TraceCheckUtils]: 4: Hoare triple {615#true} call #t~ret12 := main(); {615#true} is VALID [2018-11-14 16:34:21,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {615#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {635#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} is VALID [2018-11-14 16:34:21,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {635#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} assume true; {635#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} is VALID [2018-11-14 16:34:21,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {635#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {642#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem5| (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:34:21,640 INFO L273 TraceCheckUtils]: 8: Hoare triple {642#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem5| (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-14 16:34:21,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-14 16:34:21,641 INFO L273 TraceCheckUtils]: 10: Hoare triple {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-14 16:34:21,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} assume true; {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-14 16:34:21,643 INFO L273 TraceCheckUtils]: 12: Hoare triple {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-14 16:34:21,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {662#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:34:21,646 INFO L273 TraceCheckUtils]: 14: Hoare triple {662#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} assume true; {662#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:34:21,647 INFO L273 TraceCheckUtils]: 15: Hoare triple {662#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {669#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} is VALID [2018-11-14 16:34:21,648 INFO L273 TraceCheckUtils]: 16: Hoare triple {669#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {616#false} is VALID [2018-11-14 16:34:21,649 INFO L273 TraceCheckUtils]: 17: Hoare triple {616#false} assume !false; {616#false} is VALID [2018-11-14 16:34:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:34:21,652 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:34:21,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:34:21,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:34:21,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 16:34:21,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:34:21,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:34:21,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:21,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:34:21,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:34:21,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:34:21,689 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 7 states. [2018-11-14 16:34:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:22,619 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-14 16:34:22,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:34:22,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 16:34:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:34:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:34:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-14 16:34:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:34:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-14 16:34:22,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2018-11-14 16:34:22,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:22,788 INFO L225 Difference]: With dead ends: 58 [2018-11-14 16:34:22,788 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 16:34:22,788 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:34:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 16:34:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2018-11-14 16:34:22,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:34:22,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 37 states. [2018-11-14 16:34:22,854 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 37 states. [2018-11-14 16:34:22,854 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 37 states. [2018-11-14 16:34:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:22,859 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-14 16:34:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-14 16:34:22,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:22,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:22,860 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 56 states. [2018-11-14 16:34:22,860 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 56 states. [2018-11-14 16:34:22,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:22,864 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-14 16:34:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-14 16:34:22,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:22,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:22,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:34:22,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:34:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 16:34:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-14 16:34:22,870 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 18 [2018-11-14 16:34:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:34:22,870 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-14 16:34:22,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:34:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-14 16:34:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:34:22,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:34:22,872 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:34:22,872 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:34:22,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:34:22,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1254468116, now seen corresponding path program 1 times [2018-11-14 16:34:22,873 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:34:22,874 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:34:22,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:34:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:22,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:34:23,015 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:34:23,023 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:34:23,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:23,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:23,065 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:34:23,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:10 [2018-11-14 16:34:23,074 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:23,242 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:34:23,253 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:34:23,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:23,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:23,270 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:34:23,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 16:34:23,273 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:23,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {908#true} call ULTIMATE.init(); {908#true} is VALID [2018-11-14 16:34:23,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {908#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {908#true} is VALID [2018-11-14 16:34:23,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {908#true} assume true; {908#true} is VALID [2018-11-14 16:34:23,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {908#true} {908#true} #70#return; {908#true} is VALID [2018-11-14 16:34:23,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {908#true} call #t~ret12 := main(); {908#true} is VALID [2018-11-14 16:34:23,294 INFO L273 TraceCheckUtils]: 5: Hoare triple {908#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {908#true} is VALID [2018-11-14 16:34:23,295 INFO L273 TraceCheckUtils]: 6: Hoare triple {908#true} assume true; {908#true} is VALID [2018-11-14 16:34:23,299 INFO L273 TraceCheckUtils]: 7: Hoare triple {908#true} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {934#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-14 16:34:23,307 INFO L273 TraceCheckUtils]: 8: Hoare triple {934#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {934#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-14 16:34:23,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {934#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {934#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-14 16:34:23,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {934#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {944#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:34:23,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {944#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume true; {944#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:34:23,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {944#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {944#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:34:23,316 INFO L273 TraceCheckUtils]: 13: Hoare triple {944#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} is VALID [2018-11-14 16:34:23,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} assume true; {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} is VALID [2018-11-14 16:34:23,317 INFO L273 TraceCheckUtils]: 15: Hoare triple {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} is VALID [2018-11-14 16:34:23,319 INFO L273 TraceCheckUtils]: 16: Hoare triple {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} is VALID [2018-11-14 16:34:23,321 INFO L273 TraceCheckUtils]: 17: Hoare triple {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {967#(= |main_#t~mem10| main_~max~0)} is VALID [2018-11-14 16:34:23,322 INFO L273 TraceCheckUtils]: 18: Hoare triple {967#(= |main_#t~mem10| main_~max~0)} assume ~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {909#false} is VALID [2018-11-14 16:34:23,322 INFO L273 TraceCheckUtils]: 19: Hoare triple {909#false} assume !false; {909#false} is VALID [2018-11-14 16:34:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:34:23,325 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:34:23,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:34:23,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:34:23,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 16:34:23,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:34:23,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:34:23,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:23,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:34:23,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:34:23,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:34:23,379 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 6 states. [2018-11-14 16:34:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:24,234 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2018-11-14 16:34:24,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:34:24,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 16:34:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:34:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:34:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-14 16:34:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:34:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-14 16:34:24,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2018-11-14 16:34:24,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:24,388 INFO L225 Difference]: With dead ends: 68 [2018-11-14 16:34:24,388 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 16:34:24,389 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:34:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 16:34:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2018-11-14 16:34:24,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:34:24,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 53 states. [2018-11-14 16:34:24,493 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 53 states. [2018-11-14 16:34:24,493 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 53 states. [2018-11-14 16:34:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:24,498 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-14 16:34:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2018-11-14 16:34:24,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:24,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:24,499 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 66 states. [2018-11-14 16:34:24,499 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 66 states. [2018-11-14 16:34:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:24,503 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-14 16:34:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2018-11-14 16:34:24,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:24,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:24,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:34:24,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:34:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 16:34:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-14 16:34:24,507 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 20 [2018-11-14 16:34:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:34:24,508 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-11-14 16:34:24,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:34:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-14 16:34:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:34:24,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:34:24,509 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:34:24,510 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:34:24,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:34:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash 861441106, now seen corresponding path program 1 times [2018-11-14 16:34:24,510 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:34:24,510 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:34:24,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:34:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:24,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:34:24,647 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:34:24,668 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:34:24,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:24,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:24,698 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:34:24,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2018-11-14 16:34:24,709 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:24,938 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 16 treesize of output 12 [2018-11-14 16:34:24,949 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 12 treesize of output 4 [2018-11-14 16:34:24,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:24,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:24,963 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:34:24,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2018-11-14 16:34:24,968 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:24,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {1264#true} call ULTIMATE.init(); {1264#true} is VALID [2018-11-14 16:34:24,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {1264#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1264#true} is VALID [2018-11-14 16:34:24,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {1264#true} assume true; {1264#true} is VALID [2018-11-14 16:34:24,995 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1264#true} {1264#true} #70#return; {1264#true} is VALID [2018-11-14 16:34:24,995 INFO L256 TraceCheckUtils]: 4: Hoare triple {1264#true} call #t~ret12 := main(); {1264#true} is VALID [2018-11-14 16:34:24,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {1264#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {1284#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} is VALID [2018-11-14 16:34:24,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {1284#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} assume true; {1284#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} is VALID [2018-11-14 16:34:24,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {1284#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1291#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-14 16:34:24,998 INFO L273 TraceCheckUtils]: 8: Hoare triple {1291#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {1291#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-14 16:34:24,999 INFO L273 TraceCheckUtils]: 9: Hoare triple {1291#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1298#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-14 16:34:25,000 INFO L273 TraceCheckUtils]: 10: Hoare triple {1298#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {1302#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-14 16:34:25,001 INFO L273 TraceCheckUtils]: 11: Hoare triple {1302#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume true; {1302#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-14 16:34:25,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {1302#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {1302#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-14 16:34:25,004 INFO L273 TraceCheckUtils]: 13: Hoare triple {1302#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} is VALID [2018-11-14 16:34:25,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} assume true; {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} is VALID [2018-11-14 16:34:25,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} is VALID [2018-11-14 16:34:25,016 INFO L273 TraceCheckUtils]: 16: Hoare triple {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} is VALID [2018-11-14 16:34:25,017 INFO L273 TraceCheckUtils]: 17: Hoare triple {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1325#(and (not (bvslt main_~max~0 |main_#t~mem10|)) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-14 16:34:25,017 INFO L273 TraceCheckUtils]: 18: Hoare triple {1325#(and (not (bvslt main_~max~0 |main_#t~mem10|)) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume ~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {1265#false} is VALID [2018-11-14 16:34:25,017 INFO L273 TraceCheckUtils]: 19: Hoare triple {1265#false} assume !false; {1265#false} is VALID [2018-11-14 16:34:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:34:25,021 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:34:25,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:34:25,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 16:34:25,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-14 16:34:25,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:34:25,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:34:25,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:25,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:34:25,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:34:25,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:34:25,063 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 8 states. [2018-11-14 16:34:25,654 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2018-11-14 16:34:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:26,578 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-11-14 16:34:26,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:34:26,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-14 16:34:26,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:34:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:34:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2018-11-14 16:34:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:34:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2018-11-14 16:34:26,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2018-11-14 16:34:26,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:26,829 INFO L225 Difference]: With dead ends: 92 [2018-11-14 16:34:26,829 INFO L226 Difference]: Without dead ends: 90 [2018-11-14 16:34:26,830 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:34:26,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-14 16:34:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2018-11-14 16:34:26,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:34:26,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 67 states. [2018-11-14 16:34:26,937 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 67 states. [2018-11-14 16:34:26,938 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 67 states. [2018-11-14 16:34:26,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:26,942 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2018-11-14 16:34:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2018-11-14 16:34:26,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:26,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:26,943 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 90 states. [2018-11-14 16:34:26,944 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 90 states. [2018-11-14 16:34:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:26,948 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2018-11-14 16:34:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2018-11-14 16:34:26,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:26,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:26,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:34:26,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:34:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-14 16:34:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2018-11-14 16:34:26,953 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 20 [2018-11-14 16:34:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:34:26,954 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2018-11-14 16:34:26,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:34:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2018-11-14 16:34:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:34:26,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:34:26,955 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:34:26,955 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:34:26,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:34:26,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2130822690, now seen corresponding path program 1 times [2018-11-14 16:34:26,956 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:34:26,956 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:34:26,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:34:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:27,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:34:27,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 42 [2018-11-14 16:34:27,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-14 16:34:27,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-14 16:34:27,442 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 29 treesize of output 28 [2018-11-14 16:34:27,445 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:27,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:34:27,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-14 16:34:27,586 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:50, output treesize:60 [2018-11-14 16:34:27,598 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:27,984 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:34:27,989 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:34:27,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:27,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:27,998 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:34:27,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 16:34:28,012 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:28,048 INFO L256 TraceCheckUtils]: 0: Hoare triple {1717#true} call ULTIMATE.init(); {1717#true} is VALID [2018-11-14 16:34:28,048 INFO L273 TraceCheckUtils]: 1: Hoare triple {1717#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1717#true} is VALID [2018-11-14 16:34:28,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {1717#true} assume true; {1717#true} is VALID [2018-11-14 16:34:28,049 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1717#true} {1717#true} #70#return; {1717#true} is VALID [2018-11-14 16:34:28,050 INFO L256 TraceCheckUtils]: 4: Hoare triple {1717#true} call #t~ret12 := main(); {1717#true} is VALID [2018-11-14 16:34:28,050 INFO L273 TraceCheckUtils]: 5: Hoare triple {1717#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {1717#true} is VALID [2018-11-14 16:34:28,051 INFO L273 TraceCheckUtils]: 6: Hoare triple {1717#true} assume true; {1717#true} is VALID [2018-11-14 16:34:28,051 INFO L273 TraceCheckUtils]: 7: Hoare triple {1717#true} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1717#true} is VALID [2018-11-14 16:34:28,055 INFO L273 TraceCheckUtils]: 8: Hoare triple {1717#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {1746#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} is VALID [2018-11-14 16:34:28,056 INFO L273 TraceCheckUtils]: 9: Hoare triple {1746#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1746#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} is VALID [2018-11-14 16:34:28,058 INFO L273 TraceCheckUtils]: 10: Hoare triple {1746#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {1753#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-14 16:34:28,059 INFO L273 TraceCheckUtils]: 11: Hoare triple {1753#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} assume true; {1753#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-14 16:34:28,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {1753#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1760#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-14 16:34:28,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {1760#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {1764#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-14 16:34:28,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {1764#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1768#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~min~0 main_~max~0) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} is VALID [2018-11-14 16:34:28,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {1768#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~min~0 main_~max~0) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {1772#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:34:28,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {1772#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume true; {1772#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:34:28,078 INFO L273 TraceCheckUtils]: 17: Hoare triple {1772#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {1772#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:34:28,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {1772#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1782#(and (bvslt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:34:28,080 INFO L273 TraceCheckUtils]: 19: Hoare triple {1782#(and (bvslt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume true; {1782#(and (bvslt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:34:28,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {1782#(and (bvslt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1789#(bvslt main_~min~0 |main_#t~mem9|)} is VALID [2018-11-14 16:34:28,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {1789#(bvslt main_~min~0 |main_#t~mem9|)} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {1718#false} is VALID [2018-11-14 16:34:28,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {1718#false} assume !false; {1718#false} is VALID [2018-11-14 16:34:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:34:28,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:34:28,715 INFO L273 TraceCheckUtils]: 22: Hoare triple {1718#false} assume !false; {1718#false} is VALID [2018-11-14 16:34:28,719 INFO L273 TraceCheckUtils]: 21: Hoare triple {1799#(not (bvslt |main_#t~mem9| main_~min~0))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {1718#false} is VALID [2018-11-14 16:34:28,720 INFO L273 TraceCheckUtils]: 20: Hoare triple {1803#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1799#(not (bvslt |main_#t~mem9| main_~min~0))} is VALID [2018-11-14 16:34:28,721 INFO L273 TraceCheckUtils]: 19: Hoare triple {1803#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume true; {1803#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:34:28,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {1810#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1803#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:34:28,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {1810#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {1810#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:34:28,725 INFO L273 TraceCheckUtils]: 16: Hoare triple {1810#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} assume true; {1810#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:34:28,726 INFO L273 TraceCheckUtils]: 15: Hoare triple {1820#(or (not (bvslt main_~max~0 |main_#t~mem7|)) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {1810#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:34:28,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {1824#(or (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1820#(or (not (bvslt main_~max~0 |main_#t~mem7|)) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-14 16:34:28,727 INFO L273 TraceCheckUtils]: 13: Hoare triple {1828#(or (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvsgt main_~min~0 |main_#t~mem5|))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {1824#(or (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-14 16:34:28,737 INFO L273 TraceCheckUtils]: 12: Hoare triple {1717#true} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1828#(or (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvsgt main_~min~0 |main_#t~mem5|))} is VALID [2018-11-14 16:34:28,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {1717#true} assume true; {1717#true} is VALID [2018-11-14 16:34:28,737 INFO L273 TraceCheckUtils]: 10: Hoare triple {1717#true} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {1717#true} is VALID [2018-11-14 16:34:28,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {1717#true} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1717#true} is VALID [2018-11-14 16:34:28,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {1717#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {1717#true} is VALID [2018-11-14 16:34:28,738 INFO L273 TraceCheckUtils]: 7: Hoare triple {1717#true} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1717#true} is VALID [2018-11-14 16:34:28,738 INFO L273 TraceCheckUtils]: 6: Hoare triple {1717#true} assume true; {1717#true} is VALID [2018-11-14 16:34:28,738 INFO L273 TraceCheckUtils]: 5: Hoare triple {1717#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {1717#true} is VALID [2018-11-14 16:34:28,738 INFO L256 TraceCheckUtils]: 4: Hoare triple {1717#true} call #t~ret12 := main(); {1717#true} is VALID [2018-11-14 16:34:28,738 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1717#true} {1717#true} #70#return; {1717#true} is VALID [2018-11-14 16:34:28,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {1717#true} assume true; {1717#true} is VALID [2018-11-14 16:34:28,739 INFO L273 TraceCheckUtils]: 1: Hoare triple {1717#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1717#true} is VALID [2018-11-14 16:34:28,739 INFO L256 TraceCheckUtils]: 0: Hoare triple {1717#true} call ULTIMATE.init(); {1717#true} is VALID [2018-11-14 16:34:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (8)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 16:34:28,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:34:28,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2018-11-14 16:34:28,747 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-14 16:34:28,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:34:28,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:34:28,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:28,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:34:28,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:34:28,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:34:28,847 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 16 states. [2018-11-14 16:34:41,373 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-11-14 16:34:43,141 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-11-14 16:34:45,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:45,949 INFO L93 Difference]: Finished difference Result 211 states and 240 transitions. [2018-11-14 16:34:45,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 16:34:45,949 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-14 16:34:45,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:34:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:34:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 174 transitions. [2018-11-14 16:34:45,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:34:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 174 transitions. [2018-11-14 16:34:45,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 174 transitions. [2018-11-14 16:34:46,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:46,501 INFO L225 Difference]: With dead ends: 211 [2018-11-14 16:34:46,501 INFO L226 Difference]: Without dead ends: 209 [2018-11-14 16:34:46,502 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2018-11-14 16:34:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-14 16:34:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 72. [2018-11-14 16:34:46,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:34:46,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 72 states. [2018-11-14 16:34:46,750 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 72 states. [2018-11-14 16:34:46,750 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 72 states. [2018-11-14 16:34:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:46,758 INFO L93 Difference]: Finished difference Result 209 states and 236 transitions. [2018-11-14 16:34:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 236 transitions. [2018-11-14 16:34:46,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:46,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:46,760 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 209 states. [2018-11-14 16:34:46,760 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 209 states. [2018-11-14 16:34:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:46,769 INFO L93 Difference]: Finished difference Result 209 states and 236 transitions. [2018-11-14 16:34:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 236 transitions. [2018-11-14 16:34:46,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:46,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:46,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:34:46,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:34:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 16:34:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2018-11-14 16:34:46,774 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 23 [2018-11-14 16:34:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:34:46,774 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2018-11-14 16:34:46,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:34:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2018-11-14 16:34:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:34:46,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:34:46,777 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:34:46,777 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:34:46,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:34:46,777 INFO L82 PathProgramCache]: Analyzing trace with hash 734670050, now seen corresponding path program 1 times [2018-11-14 16:34:46,778 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:34:46,778 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:34:46,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:34:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:46,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:34:47,409 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-11-14 16:34:47,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 43 [2018-11-14 16:34:47,513 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 34 treesize of output 33 [2018-11-14 16:34:47,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:47,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 34 [2018-11-14 16:34:47,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-14 16:34:47,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:34:47,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-14 16:34:47,869 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2018-11-14 16:34:47,890 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:48,366 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 24 treesize of output 18 [2018-11-14 16:34:48,415 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 18 treesize of output 9 [2018-11-14 16:34:48,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:48,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:48,471 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:34:48,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-11-14 16:34:48,478 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:48,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {2664#true} call ULTIMATE.init(); {2664#true} is VALID [2018-11-14 16:34:48,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {2664#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2664#true} is VALID [2018-11-14 16:34:48,511 INFO L273 TraceCheckUtils]: 2: Hoare triple {2664#true} assume true; {2664#true} is VALID [2018-11-14 16:34:48,512 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2664#true} {2664#true} #70#return; {2664#true} is VALID [2018-11-14 16:34:48,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {2664#true} call #t~ret12 := main(); {2664#true} is VALID [2018-11-14 16:34:48,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {2664#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {2684#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} is VALID [2018-11-14 16:34:48,513 INFO L273 TraceCheckUtils]: 6: Hoare triple {2684#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} assume true; {2684#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} is VALID [2018-11-14 16:34:48,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {2684#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2684#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} is VALID [2018-11-14 16:34:48,515 INFO L273 TraceCheckUtils]: 8: Hoare triple {2684#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {2694#(and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-14 16:34:48,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {2694#(and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2698#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem7|) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-14 16:34:48,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {2698#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem7|) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {2702#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-14 16:34:48,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {2702#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume true; {2702#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-14 16:34:48,524 INFO L273 TraceCheckUtils]: 12: Hoare triple {2702#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2709#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (not (bvslt main_~max~0 main_~min~0)) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-14 16:34:48,525 INFO L273 TraceCheckUtils]: 13: Hoare triple {2709#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (not (bvslt main_~max~0 main_~min~0)) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {2713#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (not (bvslt main_~max~0 main_~min~0)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-14 16:34:48,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {2713#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (not (bvslt main_~max~0 main_~min~0)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2717#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (not (bvslt main_~max~0 main_~min~0)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-14 16:34:48,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {2717#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (not (bvslt main_~max~0 main_~min~0)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {2721#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} is VALID [2018-11-14 16:34:48,530 INFO L273 TraceCheckUtils]: 16: Hoare triple {2721#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} assume true; {2721#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} is VALID [2018-11-14 16:34:48,531 INFO L273 TraceCheckUtils]: 17: Hoare triple {2721#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {2721#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} is VALID [2018-11-14 16:34:48,533 INFO L273 TraceCheckUtils]: 18: Hoare triple {2721#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2731#(and (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:34:48,534 INFO L273 TraceCheckUtils]: 19: Hoare triple {2731#(and (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} assume true; {2731#(and (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:34:48,535 INFO L273 TraceCheckUtils]: 20: Hoare triple {2731#(and (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {2738#(and (not (bvslt (_ bv2147483649 32) |main_#t~mem9|)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} is VALID [2018-11-14 16:34:48,536 INFO L273 TraceCheckUtils]: 21: Hoare triple {2738#(and (not (bvslt (_ bv2147483649 32) |main_#t~mem9|)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {2665#false} is VALID [2018-11-14 16:34:48,536 INFO L273 TraceCheckUtils]: 22: Hoare triple {2665#false} assume !false; {2665#false} is VALID [2018-11-14 16:34:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:34:48,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:34:49,146 INFO L273 TraceCheckUtils]: 22: Hoare triple {2665#false} assume !false; {2665#false} is VALID [2018-11-14 16:34:49,147 INFO L273 TraceCheckUtils]: 21: Hoare triple {2748#(not (bvslt |main_#t~mem9| main_~min~0))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {2665#false} is VALID [2018-11-14 16:34:49,148 INFO L273 TraceCheckUtils]: 20: Hoare triple {2752#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {2748#(not (bvslt |main_#t~mem9| main_~min~0))} is VALID [2018-11-14 16:34:49,149 INFO L273 TraceCheckUtils]: 19: Hoare triple {2752#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume true; {2752#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:34:49,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {2759#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2752#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:34:49,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {2759#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {2759#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:34:49,151 INFO L273 TraceCheckUtils]: 16: Hoare triple {2759#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} assume true; {2759#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:34:49,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {2769#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 |main_#t~mem7|))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {2759#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:34:49,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {2773#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2769#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 |main_#t~mem7|))} is VALID [2018-11-14 16:34:49,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {2777#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvsgt main_~min~0 |main_#t~mem5|) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {2773#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:34:49,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {2664#true} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2777#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvsgt main_~min~0 |main_#t~mem5|) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:34:49,170 INFO L273 TraceCheckUtils]: 11: Hoare triple {2664#true} assume true; {2664#true} is VALID [2018-11-14 16:34:49,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {2664#true} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {2664#true} is VALID [2018-11-14 16:34:49,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {2664#true} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2664#true} is VALID [2018-11-14 16:34:49,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {2664#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {2664#true} is VALID [2018-11-14 16:34:49,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {2664#true} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2664#true} is VALID [2018-11-14 16:34:49,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {2664#true} assume true; {2664#true} is VALID [2018-11-14 16:34:49,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {2664#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {2664#true} is VALID [2018-11-14 16:34:49,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {2664#true} call #t~ret12 := main(); {2664#true} is VALID [2018-11-14 16:34:49,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2664#true} {2664#true} #70#return; {2664#true} is VALID [2018-11-14 16:34:49,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {2664#true} assume true; {2664#true} is VALID [2018-11-14 16:34:49,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {2664#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2664#true} is VALID [2018-11-14 16:34:49,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {2664#true} call ULTIMATE.init(); {2664#true} is VALID [2018-11-14 16:34:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:34:49,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:34:49,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2018-11-14 16:34:49,176 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-11-14 16:34:49,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:34:49,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 16:34:49,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:49,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 16:34:49,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 16:34:49,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:34:49,251 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand 18 states. [2018-11-14 16:34:52,118 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-11-14 16:34:52,839 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-11-14 16:34:53,734 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-11-14 16:34:55,431 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2018-11-14 16:34:55,846 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-11-14 16:34:56,775 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2018-11-14 16:34:57,274 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2018-11-14 16:34:57,516 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2018-11-14 16:34:59,273 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-11-14 16:34:59,984 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2018-11-14 16:35:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:01,070 INFO L93 Difference]: Finished difference Result 232 states and 278 transitions. [2018-11-14 16:35:01,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-14 16:35:01,070 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-11-14 16:35:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:35:01,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 190 transitions. [2018-11-14 16:35:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:35:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 190 transitions. [2018-11-14 16:35:01,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 190 transitions. [2018-11-14 16:35:01,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:01,539 INFO L225 Difference]: With dead ends: 232 [2018-11-14 16:35:01,539 INFO L226 Difference]: Without dead ends: 193 [2018-11-14 16:35:01,541 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=563, Invalid=1693, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 16:35:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-14 16:35:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 47. [2018-11-14 16:35:01,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:01,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand 47 states. [2018-11-14 16:35:01,635 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 47 states. [2018-11-14 16:35:01,635 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 47 states. [2018-11-14 16:35:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:01,642 INFO L93 Difference]: Finished difference Result 193 states and 226 transitions. [2018-11-14 16:35:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2018-11-14 16:35:01,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:01,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:01,643 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 193 states. [2018-11-14 16:35:01,644 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 193 states. [2018-11-14 16:35:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:01,650 INFO L93 Difference]: Finished difference Result 193 states and 226 transitions. [2018-11-14 16:35:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2018-11-14 16:35:01,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:01,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:01,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:01,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 16:35:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-11-14 16:35:01,653 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 23 [2018-11-14 16:35:01,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:01,653 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-14 16:35:01,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 16:35:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-11-14 16:35:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:35:01,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:01,654 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:01,655 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:01,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:01,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1004216196, now seen corresponding path program 1 times [2018-11-14 16:35:01,655 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:01,655 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:01,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:01,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:01,793 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 11 treesize of output 8 [2018-11-14 16:35:01,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:35:01,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:01,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:01,835 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 11 treesize of output 8 [2018-11-14 16:35:01,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:35:01,853 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:01,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:01,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:01,867 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-14 16:35:01,957 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:35:01,962 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:35:01,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:01,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:01,979 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:35:01,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:35:01,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:01,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:01,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:01,994 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-14 16:35:02,000 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:02,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {3610#true} call ULTIMATE.init(); {3610#true} is VALID [2018-11-14 16:35:02,018 INFO L273 TraceCheckUtils]: 1: Hoare triple {3610#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3610#true} is VALID [2018-11-14 16:35:02,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {3610#true} assume true; {3610#true} is VALID [2018-11-14 16:35:02,019 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3610#true} {3610#true} #70#return; {3610#true} is VALID [2018-11-14 16:35:02,019 INFO L256 TraceCheckUtils]: 4: Hoare triple {3610#true} call #t~ret12 := main(); {3610#true} is VALID [2018-11-14 16:35:02,028 INFO L273 TraceCheckUtils]: 5: Hoare triple {3610#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-14 16:35:02,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume true; {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-14 16:35:02,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:02,031 INFO L273 TraceCheckUtils]: 8: Hoare triple {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:02,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:02,038 INFO L273 TraceCheckUtils]: 10: Hoare triple {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:02,038 INFO L273 TraceCheckUtils]: 11: Hoare triple {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume true; {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:02,039 INFO L273 TraceCheckUtils]: 12: Hoare triple {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:02,040 INFO L273 TraceCheckUtils]: 13: Hoare triple {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:02,040 INFO L273 TraceCheckUtils]: 14: Hoare triple {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume true; {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:02,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:02,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:02,043 INFO L273 TraceCheckUtils]: 17: Hoare triple {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:02,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:02,045 INFO L273 TraceCheckUtils]: 19: Hoare triple {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:02,046 INFO L273 TraceCheckUtils]: 20: Hoare triple {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume true; {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:02,047 INFO L273 TraceCheckUtils]: 21: Hoare triple {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3611#false} is VALID [2018-11-14 16:35:02,047 INFO L273 TraceCheckUtils]: 22: Hoare triple {3611#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {3611#false} is VALID [2018-11-14 16:35:02,047 INFO L273 TraceCheckUtils]: 23: Hoare triple {3611#false} assume !false; {3611#false} is VALID [2018-11-14 16:35:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:02,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:02,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {3611#false} assume !false; {3611#false} is VALID [2018-11-14 16:35:02,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {3611#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {3611#false} is VALID [2018-11-14 16:35:02,197 INFO L273 TraceCheckUtils]: 21: Hoare triple {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3611#false} is VALID [2018-11-14 16:35:02,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume true; {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:02,199 INFO L273 TraceCheckUtils]: 19: Hoare triple {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:02,200 INFO L273 TraceCheckUtils]: 18: Hoare triple {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-14 16:35:02,201 INFO L273 TraceCheckUtils]: 17: Hoare triple {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-14 16:35:02,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-14 16:35:02,203 INFO L273 TraceCheckUtils]: 15: Hoare triple {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-14 16:35:02,204 INFO L273 TraceCheckUtils]: 14: Hoare triple {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume true; {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-14 16:35:02,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-14 16:35:02,206 INFO L273 TraceCheckUtils]: 12: Hoare triple {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:02,207 INFO L273 TraceCheckUtils]: 11: Hoare triple {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume true; {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:02,208 INFO L273 TraceCheckUtils]: 10: Hoare triple {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:02,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:02,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:02,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:02,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume true; {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-14 16:35:02,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {3610#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-14 16:35:02,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {3610#true} call #t~ret12 := main(); {3610#true} is VALID [2018-11-14 16:35:02,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3610#true} {3610#true} #70#return; {3610#true} is VALID [2018-11-14 16:35:02,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {3610#true} assume true; {3610#true} is VALID [2018-11-14 16:35:02,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {3610#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3610#true} is VALID [2018-11-14 16:35:02,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {3610#true} call ULTIMATE.init(); {3610#true} is VALID [2018-11-14 16:35:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:02,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:35:02,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-14 16:35:02,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-14 16:35:02,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:02,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:35:02,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:02,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:35:02,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:35:02,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:35:02,284 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 8 states. [2018-11-14 16:35:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:03,176 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2018-11-14 16:35:03,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:35:03,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-14 16:35:03,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:35:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-14 16:35:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:35:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-14 16:35:03,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2018-11-14 16:35:03,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:03,638 INFO L225 Difference]: With dead ends: 77 [2018-11-14 16:35:03,638 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 16:35:03,638 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:35:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 16:35:03,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-14 16:35:03,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:03,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-14 16:35:03,820 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 16:35:03,820 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 16:35:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:03,823 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2018-11-14 16:35:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-14 16:35:03,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:03,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:03,824 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 16:35:03,825 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 16:35:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:03,826 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2018-11-14 16:35:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-14 16:35:03,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:03,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:03,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:03,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 16:35:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-11-14 16:35:03,829 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 24 [2018-11-14 16:35:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:03,829 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2018-11-14 16:35:03,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:35:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-14 16:35:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:35:03,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:03,830 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:03,831 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:03,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:03,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1629861884, now seen corresponding path program 1 times [2018-11-14 16:35:03,832 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:03,832 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:03,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:03,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:04,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 42 [2018-11-14 16:35:04,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-11-14 16:35:04,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:04,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-14 16:35:04,303 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-14 16:35:04,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:35:04,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-14 16:35:04,449 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:50, output treesize:60 [2018-11-14 16:35:04,465 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:04,768 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:35:04,774 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:35:04,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:04,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:04,781 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:35:04,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 16:35:04,793 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:04,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {4049#true} call ULTIMATE.init(); {4049#true} is VALID [2018-11-14 16:35:04,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {4049#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4049#true} is VALID [2018-11-14 16:35:04,831 INFO L273 TraceCheckUtils]: 2: Hoare triple {4049#true} assume true; {4049#true} is VALID [2018-11-14 16:35:04,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4049#true} {4049#true} #70#return; {4049#true} is VALID [2018-11-14 16:35:04,831 INFO L256 TraceCheckUtils]: 4: Hoare triple {4049#true} call #t~ret12 := main(); {4049#true} is VALID [2018-11-14 16:35:04,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {4049#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {4049#true} is VALID [2018-11-14 16:35:04,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {4049#true} assume true; {4049#true} is VALID [2018-11-14 16:35:04,832 INFO L273 TraceCheckUtils]: 7: Hoare triple {4049#true} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4049#true} is VALID [2018-11-14 16:35:04,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {4049#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4078#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} is VALID [2018-11-14 16:35:04,833 INFO L273 TraceCheckUtils]: 9: Hoare triple {4078#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4078#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} is VALID [2018-11-14 16:35:04,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {4078#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {4085#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-14 16:35:04,835 INFO L273 TraceCheckUtils]: 11: Hoare triple {4085#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} assume true; {4085#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-14 16:35:04,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {4085#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4092#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-14 16:35:04,854 INFO L273 TraceCheckUtils]: 13: Hoare triple {4092#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4096#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-14 16:35:04,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {4096#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4100#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:35:04,863 INFO L273 TraceCheckUtils]: 15: Hoare triple {4100#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {4104#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:35:04,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {4104#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume true; {4104#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:35:04,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {4104#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {4104#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:35:04,865 INFO L273 TraceCheckUtils]: 18: Hoare triple {4104#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:04,866 INFO L273 TraceCheckUtils]: 19: Hoare triple {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume true; {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:04,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:04,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:04,868 INFO L273 TraceCheckUtils]: 22: Hoare triple {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4127#(bvsgt main_~max~0 |main_#t~mem10|)} is VALID [2018-11-14 16:35:04,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {4127#(bvsgt main_~max~0 |main_#t~mem10|)} assume ~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {4050#false} is VALID [2018-11-14 16:35:04,875 INFO L273 TraceCheckUtils]: 24: Hoare triple {4050#false} assume !false; {4050#false} is VALID [2018-11-14 16:35:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:04,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:05,456 INFO L273 TraceCheckUtils]: 24: Hoare triple {4050#false} assume !false; {4050#false} is VALID [2018-11-14 16:35:05,456 INFO L273 TraceCheckUtils]: 23: Hoare triple {4137#(not (bvsgt |main_#t~mem10| main_~max~0))} assume ~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {4050#false} is VALID [2018-11-14 16:35:05,457 INFO L273 TraceCheckUtils]: 22: Hoare triple {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4137#(not (bvsgt |main_#t~mem10| main_~max~0))} is VALID [2018-11-14 16:35:05,459 INFO L273 TraceCheckUtils]: 21: Hoare triple {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-14 16:35:05,460 INFO L273 TraceCheckUtils]: 20: Hoare triple {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-14 16:35:05,460 INFO L273 TraceCheckUtils]: 19: Hoare triple {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} assume true; {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-14 16:35:05,461 INFO L273 TraceCheckUtils]: 18: Hoare triple {4154#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-14 16:35:05,462 INFO L273 TraceCheckUtils]: 17: Hoare triple {4154#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {4154#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-14 16:35:05,462 INFO L273 TraceCheckUtils]: 16: Hoare triple {4154#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} assume true; {4154#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-14 16:35:05,463 INFO L273 TraceCheckUtils]: 15: Hoare triple {4164#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (bvslt main_~max~0 |main_#t~mem7|))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {4154#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-14 16:35:05,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {4168#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4164#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (bvslt main_~max~0 |main_#t~mem7|))} is VALID [2018-11-14 16:35:05,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {4172#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (not (bvsgt main_~min~0 |main_#t~mem5|)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4168#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:35:05,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {4049#true} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4172#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (not (bvsgt main_~min~0 |main_#t~mem5|)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:35:05,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {4049#true} assume true; {4049#true} is VALID [2018-11-14 16:35:05,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {4049#true} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {4049#true} is VALID [2018-11-14 16:35:05,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {4049#true} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4049#true} is VALID [2018-11-14 16:35:05,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {4049#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4049#true} is VALID [2018-11-14 16:35:05,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {4049#true} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4049#true} is VALID [2018-11-14 16:35:05,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {4049#true} assume true; {4049#true} is VALID [2018-11-14 16:35:05,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {4049#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {4049#true} is VALID [2018-11-14 16:35:05,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {4049#true} call #t~ret12 := main(); {4049#true} is VALID [2018-11-14 16:35:05,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4049#true} {4049#true} #70#return; {4049#true} is VALID [2018-11-14 16:35:05,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {4049#true} assume true; {4049#true} is VALID [2018-11-14 16:35:05,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {4049#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4049#true} is VALID [2018-11-14 16:35:05,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {4049#true} call ULTIMATE.init(); {4049#true} is VALID [2018-11-14 16:35:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:35:05,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:35:05,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2018-11-14 16:35:05,487 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-14 16:35:05,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:05,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:35:05,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:05,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:35:05,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:35:05,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:35:05,582 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 16 states. [2018-11-14 16:35:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:16,711 INFO L93 Difference]: Finished difference Result 177 states and 205 transitions. [2018-11-14 16:35:16,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 16:35:16,711 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-14 16:35:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:35:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-14 16:35:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:35:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-14 16:35:16,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 129 transitions. [2018-11-14 16:35:16,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:16,981 INFO L225 Difference]: With dead ends: 177 [2018-11-14 16:35:16,981 INFO L226 Difference]: Without dead ends: 150 [2018-11-14 16:35:16,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=202, Invalid=609, Unknown=1, NotChecked=0, Total=812 [2018-11-14 16:35:16,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-14 16:35:17,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 63. [2018-11-14 16:35:17,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:17,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 63 states. [2018-11-14 16:35:17,743 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 63 states. [2018-11-14 16:35:17,743 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 63 states. [2018-11-14 16:35:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:17,746 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2018-11-14 16:35:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2018-11-14 16:35:17,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:17,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:17,747 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 150 states. [2018-11-14 16:35:17,747 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 150 states. [2018-11-14 16:35:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:17,750 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2018-11-14 16:35:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2018-11-14 16:35:17,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:17,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:17,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:17,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 16:35:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2018-11-14 16:35:17,753 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 25 [2018-11-14 16:35:17,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:17,753 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2018-11-14 16:35:17,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:35:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2018-11-14 16:35:17,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:35:17,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:17,754 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:17,754 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:17,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:17,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1613166996, now seen corresponding path program 1 times [2018-11-14 16:35:17,755 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:17,755 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:17,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:17,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:17,922 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:35:17,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:17,956 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:35:17,966 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:35:17,968 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:17,973 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:17,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:17,994 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:15 [2018-11-14 16:35:18,011 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:18,158 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:18,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:18,167 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:35:18,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:18,361 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-14 16:35:18,372 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:35:18,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:18,409 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:18,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:35:18,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:35:18,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:18,541 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:18,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:35:18,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:35:18,633 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:18,640 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:18,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:18,703 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:78, output treesize:56 [2018-11-14 16:35:18,751 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:19,227 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:35:19,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:35:19,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:19,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:19,269 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 23 treesize of output 19 [2018-11-14 16:35:19,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-14 16:35:19,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:19,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:19,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:35:19,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:22 [2018-11-14 16:35:19,319 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:19,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:19,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:19,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2018-11-14 16:35:19,484 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 20 [2018-11-14 16:35:19,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 16:35:19,521 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:35:19,524 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:19,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:19,547 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:35:19,547 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-14 16:35:19,557 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:19,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {4832#true} call ULTIMATE.init(); {4832#true} is VALID [2018-11-14 16:35:19,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {4832#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4832#true} is VALID [2018-11-14 16:35:19,605 INFO L273 TraceCheckUtils]: 2: Hoare triple {4832#true} assume true; {4832#true} is VALID [2018-11-14 16:35:19,605 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4832#true} {4832#true} #70#return; {4832#true} is VALID [2018-11-14 16:35:19,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {4832#true} call #t~ret12 := main(); {4832#true} is VALID [2018-11-14 16:35:19,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {4832#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {4832#true} is VALID [2018-11-14 16:35:19,605 INFO L273 TraceCheckUtils]: 6: Hoare triple {4832#true} assume true; {4832#true} is VALID [2018-11-14 16:35:19,607 INFO L273 TraceCheckUtils]: 7: Hoare triple {4832#true} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4858#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-14 16:35:19,607 INFO L273 TraceCheckUtils]: 8: Hoare triple {4858#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~p~0.base main_~l~0.base))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4862#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-14 16:35:19,609 INFO L273 TraceCheckUtils]: 9: Hoare triple {4862#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4862#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-14 16:35:19,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {4862#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {4869#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:35:19,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {4869#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume true; {4869#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-14 16:35:19,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {4869#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4876#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~p~0.base)) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} is VALID [2018-11-14 16:35:19,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {4876#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~p~0.base)) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4880#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-14 16:35:19,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {4880#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4884#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:19,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {4884#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {4888#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:19,637 INFO L273 TraceCheckUtils]: 16: Hoare triple {4888#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume true; {4888#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:19,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {4888#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {4888#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-14 16:35:19,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {4888#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:19,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume true; {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:19,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:19,649 INFO L273 TraceCheckUtils]: 21: Hoare triple {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:19,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:19,651 INFO L273 TraceCheckUtils]: 23: Hoare triple {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:19,653 INFO L273 TraceCheckUtils]: 24: Hoare triple {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {4917#(and (exists ((v_main_~i~0.base_13 (_ BitVec 32))) (and (= main_~min~0 (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))) (bvsgt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:19,659 INFO L273 TraceCheckUtils]: 25: Hoare triple {4917#(and (exists ((v_main_~i~0.base_13 (_ BitVec 32))) (and (= main_~min~0 (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))) (bvsgt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))))) (= (_ bv0 32) main_~i~0.offset))} assume true; {4917#(and (exists ((v_main_~i~0.base_13 (_ BitVec 32))) (and (= main_~min~0 (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))) (bvsgt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-14 16:35:19,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {4917#(and (exists ((v_main_~i~0.base_13 (_ BitVec 32))) (and (= main_~min~0 (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))) (bvsgt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4924#(bvsgt |main_#t~mem9| main_~min~0)} is VALID [2018-11-14 16:35:19,670 INFO L273 TraceCheckUtils]: 27: Hoare triple {4924#(bvsgt |main_#t~mem9| main_~min~0)} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4833#false} is VALID [2018-11-14 16:35:19,670 INFO L273 TraceCheckUtils]: 28: Hoare triple {4833#false} assume !false; {4833#false} is VALID [2018-11-14 16:35:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:19,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:24,026 INFO L273 TraceCheckUtils]: 28: Hoare triple {4833#false} assume !false; {4833#false} is VALID [2018-11-14 16:35:24,027 INFO L273 TraceCheckUtils]: 27: Hoare triple {4934#(not (bvslt |main_#t~mem9| main_~min~0))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4833#false} is VALID [2018-11-14 16:35:24,028 INFO L273 TraceCheckUtils]: 26: Hoare triple {4938#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4934#(not (bvslt |main_#t~mem9| main_~min~0))} is VALID [2018-11-14 16:35:24,028 INFO L273 TraceCheckUtils]: 25: Hoare triple {4938#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume true; {4938#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:35:24,029 INFO L273 TraceCheckUtils]: 24: Hoare triple {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {4938#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:35:24,029 INFO L273 TraceCheckUtils]: 23: Hoare triple {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:35:24,030 INFO L273 TraceCheckUtils]: 22: Hoare triple {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:35:24,030 INFO L273 TraceCheckUtils]: 21: Hoare triple {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:35:24,030 INFO L273 TraceCheckUtils]: 20: Hoare triple {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:35:24,031 INFO L273 TraceCheckUtils]: 19: Hoare triple {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume true; {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:35:24,031 INFO L273 TraceCheckUtils]: 18: Hoare triple {4964#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:35:24,032 INFO L273 TraceCheckUtils]: 17: Hoare triple {4964#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {4964#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:35:24,032 INFO L273 TraceCheckUtils]: 16: Hoare triple {4964#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume true; {4964#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:35:24,033 INFO L273 TraceCheckUtils]: 15: Hoare triple {4974#(or (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 |main_#t~mem7|))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {4964#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-14 16:35:24,036 INFO L273 TraceCheckUtils]: 14: Hoare triple {4978#(or (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4974#(or (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 |main_#t~mem7|))} is VALID [2018-11-14 16:35:24,038 INFO L273 TraceCheckUtils]: 13: Hoare triple {4982#(or (not (bvsgt main_~min~0 |main_#t~mem5|)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4978#(or (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-14 16:35:26,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {4986#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (bvslt main_~max~0 |v_main_#t~mem5_20|) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4982#(or (not (bvsgt main_~min~0 |main_#t~mem5|)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))))} is UNKNOWN [2018-11-14 16:35:26,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {4986#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (bvslt main_~max~0 |v_main_#t~mem5_20|) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} assume true; {4986#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (bvslt main_~max~0 |v_main_#t~mem5_20|) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} is VALID [2018-11-14 16:35:26,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {4993#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|) (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {4986#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (bvslt main_~max~0 |v_main_#t~mem5_20|) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} is VALID [2018-11-14 16:35:26,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {4993#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|) (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4993#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|) (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} is VALID [2018-11-14 16:35:26,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {5000#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (bvsgt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|)) (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4993#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|) (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} is VALID [2018-11-14 16:35:26,082 INFO L273 TraceCheckUtils]: 7: Hoare triple {4832#true} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {5000#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (bvsgt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|)) (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} is VALID [2018-11-14 16:35:26,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {4832#true} assume true; {4832#true} is VALID [2018-11-14 16:35:26,083 INFO L273 TraceCheckUtils]: 5: Hoare triple {4832#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {4832#true} is VALID [2018-11-14 16:35:26,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {4832#true} call #t~ret12 := main(); {4832#true} is VALID [2018-11-14 16:35:26,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4832#true} {4832#true} #70#return; {4832#true} is VALID [2018-11-14 16:35:26,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {4832#true} assume true; {4832#true} is VALID [2018-11-14 16:35:26,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {4832#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4832#true} is VALID [2018-11-14 16:35:26,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {4832#true} call ULTIMATE.init(); {4832#true} is VALID [2018-11-14 16:35:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:26,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:35:26,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-14 16:35:26,089 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-14 16:35:26,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:26,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 16:35:28,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 49 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:28,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 16:35:28,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 16:35:28,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-11-14 16:35:28,246 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand 22 states. [2018-11-14 16:35:31,549 WARN L179 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-14 16:35:34,333 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-11-14 16:35:34,717 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-11-14 16:35:41,907 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-11-14 16:35:44,436 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-14 16:35:44,870 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2018-11-14 16:35:45,292 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-14 16:35:47,408 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-11-14 16:35:47,790 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34