/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-token-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:23:43,709 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:23:43,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:23:43,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:23:43,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:23:43,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:23:43,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:23:43,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:23:43,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:23:43,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:23:43,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:23:43,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:23:43,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:23:43,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:23:43,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:23:43,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:23:43,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:23:43,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:23:43,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:23:43,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:23:43,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:23:43,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:23:43,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:23:43,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:23:43,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:23:43,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:23:43,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:23:43,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:23:43,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:23:43,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:23:43,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:23:43,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:23:43,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:23:43,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:23:43,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:23:43,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:23:43,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:23:43,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:23:43,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:23:43,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:23:43,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:23:43,777 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:23:43,789 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:23:43,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:23:43,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:23:43,791 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:23:43,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:23:43,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:23:43,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:23:43,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:23:43,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:23:43,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:23:43,793 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:23:43,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:23:43,793 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:23:43,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:23:43,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:23:43,794 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:23:43,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:23:43,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:23:43,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:23:43,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:23:43,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:23:43,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:23:43,796 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:23:44,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:23:44,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:23:44,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:23:44,169 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:23:44,170 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:23:44,172 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token-2.i [2020-07-18 00:23:44,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1550fad6e/9048abd1f0d04014842f1db275a761cb/FLAG75300c16f [2020-07-18 00:23:45,063 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:23:45,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-token-2.i [2020-07-18 00:23:45,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1550fad6e/9048abd1f0d04014842f1db275a761cb/FLAG75300c16f [2020-07-18 00:23:45,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1550fad6e/9048abd1f0d04014842f1db275a761cb [2020-07-18 00:23:45,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:23:45,266 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:23:45,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:23:45,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:23:45,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:23:45,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:23:45" (1/1) ... [2020-07-18 00:23:45,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1752101b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:45, skipping insertion in model container [2020-07-18 00:23:45,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:23:45" (1/1) ... [2020-07-18 00:23:45,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:23:45,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:23:45,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:23:45,997 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:23:46,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:23:46,151 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:23:46,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:46 WrapperNode [2020-07-18 00:23:46,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:23:46,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:23:46,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:23:46,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:23:46,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:46" (1/1) ... [2020-07-18 00:23:46,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:46" (1/1) ... [2020-07-18 00:23:46,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:46" (1/1) ... [2020-07-18 00:23:46,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:46" (1/1) ... [2020-07-18 00:23:46,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:46" (1/1) ... [2020-07-18 00:23:46,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:46" (1/1) ... [2020-07-18 00:23:46,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:46" (1/1) ... [2020-07-18 00:23:46,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:23:46,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:23:46,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:23:46,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:23:46,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:23:46,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:23:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:23:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:23:46,345 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-18 00:23:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-18 00:23:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-18 00:23:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-18 00:23:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-18 00:23:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-18 00:23:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-18 00:23:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-18 00:23:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-18 00:23:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-18 00:23:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-18 00:23:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-18 00:23:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-18 00:23:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-18 00:23:46,349 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-18 00:23:46,350 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-18 00:23:46,351 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-18 00:23:46,352 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-18 00:23:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-18 00:23:46,356 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-18 00:23:46,356 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-18 00:23:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-18 00:23:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-18 00:23:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-18 00:23:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-18 00:23:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-18 00:23:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-18 00:23:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-18 00:23:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-18 00:23:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-18 00:23:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-18 00:23:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-18 00:23:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-18 00:23:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-18 00:23:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-18 00:23:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-18 00:23:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-18 00:23:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-18 00:23:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-18 00:23:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-18 00:23:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-18 00:23:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-18 00:23:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-18 00:23:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-18 00:23:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-18 00:23:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-18 00:23:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-18 00:23:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-18 00:23:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-18 00:23:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-18 00:23:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:23:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-18 00:23:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-18 00:23:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 00:23:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-18 00:23:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-18 00:23:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-18 00:23:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-18 00:23:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-18 00:23:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:23:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-18 00:23:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-18 00:23:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-18 00:23:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-18 00:23:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-18 00:23:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-18 00:23:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-18 00:23:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-18 00:23:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-18 00:23:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-18 00:23:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-18 00:23:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-18 00:23:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-18 00:23:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-18 00:23:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-18 00:23:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-18 00:23:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-18 00:23:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-18 00:23:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-18 00:23:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-18 00:23:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-18 00:23:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-18 00:23:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-18 00:23:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-18 00:23:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-18 00:23:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-18 00:23:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-18 00:23:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-18 00:23:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-18 00:23:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-18 00:23:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-18 00:23:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-18 00:23:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-18 00:23:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-18 00:23:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-18 00:23:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-18 00:23:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-18 00:23:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-18 00:23:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-18 00:23:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-18 00:23:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-18 00:23:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-18 00:23:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-18 00:23:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:23:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:23:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:23:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:23:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 00:23:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:23:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 00:23:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:23:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:23:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:23:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:23:47,403 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:23:47,403 INFO L295 CfgBuilder]: Removed 15 assume(true) statements. [2020-07-18 00:23:47,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:23:47 BoogieIcfgContainer [2020-07-18 00:23:47,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:23:47,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:23:47,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:23:47,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:23:47,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:23:45" (1/3) ... [2020-07-18 00:23:47,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156e543b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:23:47, skipping insertion in model container [2020-07-18 00:23:47,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:46" (2/3) ... [2020-07-18 00:23:47,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156e543b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:23:47, skipping insertion in model container [2020-07-18 00:23:47,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:23:47" (3/3) ... [2020-07-18 00:23:47,423 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-token-2.i [2020-07-18 00:23:47,438 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:23:47,451 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-07-18 00:23:47,471 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-07-18 00:23:47,500 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:23:47,500 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:23:47,501 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:23:47,501 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:23:47,501 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:23:47,501 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:23:47,501 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:23:47,502 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:23:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2020-07-18 00:23:47,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-18 00:23:47,542 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:47,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:23:47,545 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:47,555 INFO L82 PathProgramCache]: Analyzing trace with hash 536950687, now seen corresponding path program 1 times [2020-07-18 00:23:47,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:47,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [778508478] [2020-07-18 00:23:47,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:47,897 INFO L280 TraceCheckUtils]: 0: Hoare triple {111#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {104#true} is VALID [2020-07-18 00:23:47,898 INFO L280 TraceCheckUtils]: 1: Hoare triple {104#true} #valid := #valid[0 := 0]; {104#true} is VALID [2020-07-18 00:23:47,899 INFO L280 TraceCheckUtils]: 2: Hoare triple {104#true} assume 0 < #StackHeapBarrier; {104#true} is VALID [2020-07-18 00:23:47,899 INFO L280 TraceCheckUtils]: 3: Hoare triple {104#true} assume true; {104#true} is VALID [2020-07-18 00:23:47,900 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {104#true} {104#true} #213#return; {104#true} is VALID [2020-07-18 00:23:47,909 INFO L263 TraceCheckUtils]: 0: Hoare triple {104#true} call ULTIMATE.init(); {111#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:47,910 INFO L280 TraceCheckUtils]: 1: Hoare triple {111#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {104#true} is VALID [2020-07-18 00:23:47,910 INFO L280 TraceCheckUtils]: 2: Hoare triple {104#true} #valid := #valid[0 := 0]; {104#true} is VALID [2020-07-18 00:23:47,911 INFO L280 TraceCheckUtils]: 3: Hoare triple {104#true} assume 0 < #StackHeapBarrier; {104#true} is VALID [2020-07-18 00:23:47,911 INFO L280 TraceCheckUtils]: 4: Hoare triple {104#true} assume true; {104#true} is VALID [2020-07-18 00:23:47,911 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {104#true} {104#true} #213#return; {104#true} is VALID [2020-07-18 00:23:47,912 INFO L263 TraceCheckUtils]: 6: Hoare triple {104#true} call #t~ret18 := main(); {104#true} is VALID [2020-07-18 00:23:47,912 INFO L280 TraceCheckUtils]: 7: Hoare triple {104#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {104#true} is VALID [2020-07-18 00:23:47,913 INFO L280 TraceCheckUtils]: 8: Hoare triple {104#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {104#true} is VALID [2020-07-18 00:23:47,913 INFO L280 TraceCheckUtils]: 9: Hoare triple {104#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {104#true} is VALID [2020-07-18 00:23:47,913 INFO L280 TraceCheckUtils]: 10: Hoare triple {104#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {104#true} is VALID [2020-07-18 00:23:47,914 INFO L280 TraceCheckUtils]: 11: Hoare triple {104#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {104#true} is VALID [2020-07-18 00:23:47,914 INFO L280 TraceCheckUtils]: 12: Hoare triple {104#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {104#true} is VALID [2020-07-18 00:23:47,916 INFO L280 TraceCheckUtils]: 13: Hoare triple {104#true} assume !true; {105#false} is VALID [2020-07-18 00:23:47,917 INFO L280 TraceCheckUtils]: 14: Hoare triple {105#false} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-5 {105#false} is VALID [2020-07-18 00:23:47,917 INFO L280 TraceCheckUtils]: 15: Hoare triple {105#false} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); srcloc: L1010 {105#false} is VALID [2020-07-18 00:23:47,918 INFO L280 TraceCheckUtils]: 16: Hoare triple {105#false} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {105#false} is VALID [2020-07-18 00:23:47,918 INFO L280 TraceCheckUtils]: 17: Hoare triple {105#false} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {105#false} is VALID [2020-07-18 00:23:47,918 INFO L280 TraceCheckUtils]: 18: Hoare triple {105#false} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {105#false} is VALID [2020-07-18 00:23:47,919 INFO L280 TraceCheckUtils]: 19: Hoare triple {105#false} havoc #t~mem6.base, #t~mem6.offset; {105#false} is VALID [2020-07-18 00:23:47,919 INFO L280 TraceCheckUtils]: 20: Hoare triple {105#false} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {105#false} is VALID [2020-07-18 00:23:47,920 INFO L280 TraceCheckUtils]: 21: Hoare triple {105#false} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {105#false} is VALID [2020-07-18 00:23:47,920 INFO L280 TraceCheckUtils]: 22: Hoare triple {105#false} havoc #t~mem7.base, #t~mem7.offset; {105#false} is VALID [2020-07-18 00:23:47,921 INFO L280 TraceCheckUtils]: 23: Hoare triple {105#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {105#false} is VALID [2020-07-18 00:23:47,921 INFO L280 TraceCheckUtils]: 24: Hoare triple {105#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {105#false} is VALID [2020-07-18 00:23:47,921 INFO L280 TraceCheckUtils]: 25: Hoare triple {105#false} assume !false; {105#false} is VALID [2020-07-18 00:23:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:23:47,929 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:47,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [778508478] [2020-07-18 00:23:47,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:47,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:23:47,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667685240] [2020-07-18 00:23:47,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-18 00:23:47,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:47,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:23:48,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:48,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:23:48,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:48,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:23:48,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:23:48,043 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 3 states. [2020-07-18 00:23:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:48,792 INFO L93 Difference]: Finished difference Result 189 states and 235 transitions. [2020-07-18 00:23:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:23:48,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-18 00:23:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:23:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:23:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2020-07-18 00:23:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:23:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2020-07-18 00:23:48,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 235 transitions. [2020-07-18 00:23:49,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:49,282 INFO L225 Difference]: With dead ends: 189 [2020-07-18 00:23:49,285 INFO L226 Difference]: Without dead ends: 90 [2020-07-18 00:23:49,295 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:23:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-18 00:23:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-07-18 00:23:49,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:23:49,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 90 states. [2020-07-18 00:23:49,502 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2020-07-18 00:23:49,502 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2020-07-18 00:23:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:49,528 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2020-07-18 00:23:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2020-07-18 00:23:49,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:49,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:49,531 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2020-07-18 00:23:49,531 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2020-07-18 00:23:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:49,540 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2020-07-18 00:23:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2020-07-18 00:23:49,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:49,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:49,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:23:49,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:23:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-18 00:23:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2020-07-18 00:23:49,552 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 26 [2020-07-18 00:23:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:23:49,553 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2020-07-18 00:23:49,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:23:49,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 90 states and 92 transitions. [2020-07-18 00:23:49,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2020-07-18 00:23:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 00:23:49,724 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:49,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:23:49,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:23:49,726 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:49,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash -692885691, now seen corresponding path program 1 times [2020-07-18 00:23:49,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:49,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1300758412] [2020-07-18 00:23:49,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:50,164 INFO L280 TraceCheckUtils]: 0: Hoare triple {868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {852#true} is VALID [2020-07-18 00:23:50,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {852#true} #valid := #valid[0 := 0]; {852#true} is VALID [2020-07-18 00:23:50,165 INFO L280 TraceCheckUtils]: 2: Hoare triple {852#true} assume 0 < #StackHeapBarrier; {852#true} is VALID [2020-07-18 00:23:50,165 INFO L280 TraceCheckUtils]: 3: Hoare triple {852#true} assume true; {852#true} is VALID [2020-07-18 00:23:50,165 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {852#true} {852#true} #213#return; {852#true} is VALID [2020-07-18 00:23:50,168 INFO L263 TraceCheckUtils]: 0: Hoare triple {852#true} call ULTIMATE.init(); {868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:50,168 INFO L280 TraceCheckUtils]: 1: Hoare triple {868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {852#true} is VALID [2020-07-18 00:23:50,169 INFO L280 TraceCheckUtils]: 2: Hoare triple {852#true} #valid := #valid[0 := 0]; {852#true} is VALID [2020-07-18 00:23:50,169 INFO L280 TraceCheckUtils]: 3: Hoare triple {852#true} assume 0 < #StackHeapBarrier; {852#true} is VALID [2020-07-18 00:23:50,170 INFO L280 TraceCheckUtils]: 4: Hoare triple {852#true} assume true; {852#true} is VALID [2020-07-18 00:23:50,170 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {852#true} {852#true} #213#return; {852#true} is VALID [2020-07-18 00:23:50,170 INFO L263 TraceCheckUtils]: 6: Hoare triple {852#true} call #t~ret18 := main(); {852#true} is VALID [2020-07-18 00:23:50,173 INFO L280 TraceCheckUtils]: 7: Hoare triple {852#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {859#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-18 00:23:50,175 INFO L280 TraceCheckUtils]: 8: Hoare triple {859#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {860#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-18 00:23:50,177 INFO L280 TraceCheckUtils]: 9: Hoare triple {860#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {860#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-18 00:23:50,178 INFO L280 TraceCheckUtils]: 10: Hoare triple {860#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {860#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-18 00:23:50,179 INFO L280 TraceCheckUtils]: 11: Hoare triple {860#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {860#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-18 00:23:50,180 INFO L280 TraceCheckUtils]: 12: Hoare triple {860#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {861#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:23:50,182 INFO L280 TraceCheckUtils]: 13: Hoare triple {861#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {861#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:23:50,183 INFO L280 TraceCheckUtils]: 14: Hoare triple {861#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1); {861#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:23:50,187 INFO L280 TraceCheckUtils]: 15: Hoare triple {861#(= 1 (select |#valid| main_~x~0.base))} havoc #t~nondet1; {861#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:23:50,190 INFO L280 TraceCheckUtils]: 16: Hoare triple {861#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L1004 {862#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-18 00:23:50,192 INFO L280 TraceCheckUtils]: 17: Hoare triple {862#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1004-1 {863#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-18 00:23:50,193 INFO L280 TraceCheckUtils]: 18: Hoare triple {863#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1004-2 {864#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-18 00:23:50,196 INFO L280 TraceCheckUtils]: 19: Hoare triple {864#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L1005 {865#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:23:50,198 INFO L280 TraceCheckUtils]: 20: Hoare triple {865#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem3.base, #t~mem3.offset; {865#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:23:50,200 INFO L280 TraceCheckUtils]: 21: Hoare triple {865#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1006 {866#(not (= 0 |main_#t~mem4.base|))} is VALID [2020-07-18 00:23:50,202 INFO L280 TraceCheckUtils]: 22: Hoare triple {866#(not (= 0 |main_#t~mem4.base|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {867#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:50,204 INFO L280 TraceCheckUtils]: 23: Hoare triple {867#(not (= 0 main_~x~0.base))} havoc #t~mem4.base, #t~mem4.offset; {867#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:50,206 INFO L280 TraceCheckUtils]: 24: Hoare triple {867#(not (= 0 main_~x~0.base))} SUMMARY for call write~int(0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1007 {867#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:50,207 INFO L280 TraceCheckUtils]: 25: Hoare triple {867#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {853#false} is VALID [2020-07-18 00:23:50,208 INFO L280 TraceCheckUtils]: 26: Hoare triple {853#false} assume !false; {853#false} is VALID [2020-07-18 00:23:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:23:50,211 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:50,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1300758412] [2020-07-18 00:23:50,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:50,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-18 00:23:50,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624350671] [2020-07-18 00:23:50,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-18 00:23:50,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:50,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-18 00:23:50,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:50,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-18 00:23:50,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:50,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-18 00:23:50,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:23:50,264 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 12 states. [2020-07-18 00:23:52,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:52,988 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions. [2020-07-18 00:23:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 00:23:52,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-18 00:23:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:23:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:23:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2020-07-18 00:23:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:23:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2020-07-18 00:23:52,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 179 transitions. [2020-07-18 00:23:53,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:53,264 INFO L225 Difference]: With dead ends: 174 [2020-07-18 00:23:53,265 INFO L226 Difference]: Without dead ends: 172 [2020-07-18 00:23:53,267 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2020-07-18 00:23:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-07-18 00:23:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 103. [2020-07-18 00:23:53,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:23:53,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 103 states. [2020-07-18 00:23:53,525 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 103 states. [2020-07-18 00:23:53,525 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 103 states. [2020-07-18 00:23:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:53,536 INFO L93 Difference]: Finished difference Result 172 states and 177 transitions. [2020-07-18 00:23:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions. [2020-07-18 00:23:53,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:53,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:53,539 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 172 states. [2020-07-18 00:23:53,539 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 172 states. [2020-07-18 00:23:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:53,550 INFO L93 Difference]: Finished difference Result 172 states and 177 transitions. [2020-07-18 00:23:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions. [2020-07-18 00:23:53,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:53,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:53,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:23:53,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:23:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-07-18 00:23:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2020-07-18 00:23:53,559 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 27 [2020-07-18 00:23:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:23:53,579 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2020-07-18 00:23:53,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-18 00:23:53,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 103 states and 106 transitions. [2020-07-18 00:23:53,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2020-07-18 00:23:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-18 00:23:53,753 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:53,754 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:23:53,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:23:53,754 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:53,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:53,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2098857180, now seen corresponding path program 1 times [2020-07-18 00:23:53,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:53,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1633395105] [2020-07-18 00:23:53,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:53,942 INFO L280 TraceCheckUtils]: 0: Hoare triple {1795#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1785#true} is VALID [2020-07-18 00:23:53,943 INFO L280 TraceCheckUtils]: 1: Hoare triple {1785#true} #valid := #valid[0 := 0]; {1785#true} is VALID [2020-07-18 00:23:53,943 INFO L280 TraceCheckUtils]: 2: Hoare triple {1785#true} assume 0 < #StackHeapBarrier; {1785#true} is VALID [2020-07-18 00:23:53,943 INFO L280 TraceCheckUtils]: 3: Hoare triple {1785#true} assume true; {1785#true} is VALID [2020-07-18 00:23:53,943 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1785#true} {1785#true} #213#return; {1785#true} is VALID [2020-07-18 00:23:53,945 INFO L263 TraceCheckUtils]: 0: Hoare triple {1785#true} call ULTIMATE.init(); {1795#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:53,945 INFO L280 TraceCheckUtils]: 1: Hoare triple {1795#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1785#true} is VALID [2020-07-18 00:23:53,945 INFO L280 TraceCheckUtils]: 2: Hoare triple {1785#true} #valid := #valid[0 := 0]; {1785#true} is VALID [2020-07-18 00:23:53,946 INFO L280 TraceCheckUtils]: 3: Hoare triple {1785#true} assume 0 < #StackHeapBarrier; {1785#true} is VALID [2020-07-18 00:23:53,946 INFO L280 TraceCheckUtils]: 4: Hoare triple {1785#true} assume true; {1785#true} is VALID [2020-07-18 00:23:53,946 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1785#true} {1785#true} #213#return; {1785#true} is VALID [2020-07-18 00:23:53,946 INFO L263 TraceCheckUtils]: 6: Hoare triple {1785#true} call #t~ret18 := main(); {1785#true} is VALID [2020-07-18 00:23:53,947 INFO L280 TraceCheckUtils]: 7: Hoare triple {1785#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {1792#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-18 00:23:53,948 INFO L280 TraceCheckUtils]: 8: Hoare triple {1792#(not (= 0 |main_#t~malloc0.base|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,948 INFO L280 TraceCheckUtils]: 9: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,949 INFO L280 TraceCheckUtils]: 10: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,950 INFO L280 TraceCheckUtils]: 11: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,951 INFO L280 TraceCheckUtils]: 12: Hoare triple {1793#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,951 INFO L280 TraceCheckUtils]: 13: Hoare triple {1793#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,952 INFO L280 TraceCheckUtils]: 14: Hoare triple {1793#(not (= 0 main_~head~0.base))} assume !(0 != #t~nondet1); {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,953 INFO L280 TraceCheckUtils]: 15: Hoare triple {1793#(not (= 0 main_~head~0.base))} havoc #t~nondet1; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,953 INFO L280 TraceCheckUtils]: 16: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-5 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,954 INFO L280 TraceCheckUtils]: 17: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); srcloc: L1010 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,956 INFO L280 TraceCheckUtils]: 18: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,956 INFO L280 TraceCheckUtils]: 19: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,957 INFO L280 TraceCheckUtils]: 20: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,958 INFO L280 TraceCheckUtils]: 21: Hoare triple {1793#(not (= 0 main_~head~0.base))} havoc #t~mem6.base, #t~mem6.offset; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,959 INFO L280 TraceCheckUtils]: 22: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,959 INFO L280 TraceCheckUtils]: 23: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,960 INFO L280 TraceCheckUtils]: 24: Hoare triple {1793#(not (= 0 main_~head~0.base))} havoc #t~mem7.base, #t~mem7.offset; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 00:23:53,961 INFO L280 TraceCheckUtils]: 25: Hoare triple {1793#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1794#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:53,962 INFO L280 TraceCheckUtils]: 26: Hoare triple {1794#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {1786#false} is VALID [2020-07-18 00:23:53,962 INFO L280 TraceCheckUtils]: 27: Hoare triple {1786#false} assume !false; {1786#false} is VALID [2020-07-18 00:23:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:23:53,965 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:53,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1633395105] [2020-07-18 00:23:53,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:53,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:23:53,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019217897] [2020-07-18 00:23:53,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-18 00:23:53,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:53,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:23:54,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:54,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:23:54,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:54,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:23:54,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:23:54,025 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand 6 states. [2020-07-18 00:23:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:55,109 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2020-07-18 00:23:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:23:55,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-18 00:23:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:23:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:23:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2020-07-18 00:23:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:23:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2020-07-18 00:23:55,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 161 transitions. [2020-07-18 00:23:55,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:55,321 INFO L225 Difference]: With dead ends: 160 [2020-07-18 00:23:55,322 INFO L226 Difference]: Without dead ends: 158 [2020-07-18 00:23:55,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:23:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-18 00:23:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 101. [2020-07-18 00:23:55,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:23:55,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 101 states. [2020-07-18 00:23:55,651 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 101 states. [2020-07-18 00:23:55,651 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 101 states. [2020-07-18 00:23:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:55,659 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2020-07-18 00:23:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2020-07-18 00:23:55,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:55,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:55,662 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 158 states. [2020-07-18 00:23:55,662 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 158 states. [2020-07-18 00:23:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:55,675 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2020-07-18 00:23:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2020-07-18 00:23:55,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:55,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:55,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:23:55,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:23:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-18 00:23:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2020-07-18 00:23:55,685 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 28 [2020-07-18 00:23:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:23:55,685 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2020-07-18 00:23:55,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:23:55,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 101 states and 104 transitions. [2020-07-18 00:23:55,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2020-07-18 00:23:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:23:55,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:55,868 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:23:55,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:23:55,869 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:55,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:55,869 INFO L82 PathProgramCache]: Analyzing trace with hash 578708441, now seen corresponding path program 1 times [2020-07-18 00:23:55,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:55,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1850003263] [2020-07-18 00:23:55,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:56,002 INFO L280 TraceCheckUtils]: 0: Hoare triple {2650#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2640#true} is VALID [2020-07-18 00:23:56,002 INFO L280 TraceCheckUtils]: 1: Hoare triple {2640#true} #valid := #valid[0 := 0]; {2640#true} is VALID [2020-07-18 00:23:56,003 INFO L280 TraceCheckUtils]: 2: Hoare triple {2640#true} assume 0 < #StackHeapBarrier; {2640#true} is VALID [2020-07-18 00:23:56,003 INFO L280 TraceCheckUtils]: 3: Hoare triple {2640#true} assume true; {2640#true} is VALID [2020-07-18 00:23:56,003 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2640#true} {2640#true} #213#return; {2640#true} is VALID [2020-07-18 00:23:56,005 INFO L263 TraceCheckUtils]: 0: Hoare triple {2640#true} call ULTIMATE.init(); {2650#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:56,005 INFO L280 TraceCheckUtils]: 1: Hoare triple {2650#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2640#true} is VALID [2020-07-18 00:23:56,006 INFO L280 TraceCheckUtils]: 2: Hoare triple {2640#true} #valid := #valid[0 := 0]; {2640#true} is VALID [2020-07-18 00:23:56,006 INFO L280 TraceCheckUtils]: 3: Hoare triple {2640#true} assume 0 < #StackHeapBarrier; {2640#true} is VALID [2020-07-18 00:23:56,006 INFO L280 TraceCheckUtils]: 4: Hoare triple {2640#true} assume true; {2640#true} is VALID [2020-07-18 00:23:56,006 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2640#true} {2640#true} #213#return; {2640#true} is VALID [2020-07-18 00:23:56,007 INFO L263 TraceCheckUtils]: 6: Hoare triple {2640#true} call #t~ret18 := main(); {2640#true} is VALID [2020-07-18 00:23:56,007 INFO L280 TraceCheckUtils]: 7: Hoare triple {2640#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {2640#true} is VALID [2020-07-18 00:23:56,007 INFO L280 TraceCheckUtils]: 8: Hoare triple {2640#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {2640#true} is VALID [2020-07-18 00:23:56,008 INFO L280 TraceCheckUtils]: 9: Hoare triple {2640#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {2640#true} is VALID [2020-07-18 00:23:56,008 INFO L280 TraceCheckUtils]: 10: Hoare triple {2640#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {2640#true} is VALID [2020-07-18 00:23:56,008 INFO L280 TraceCheckUtils]: 11: Hoare triple {2640#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {2640#true} is VALID [2020-07-18 00:23:56,008 INFO L280 TraceCheckUtils]: 12: Hoare triple {2640#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2640#true} is VALID [2020-07-18 00:23:56,009 INFO L280 TraceCheckUtils]: 13: Hoare triple {2640#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2640#true} is VALID [2020-07-18 00:23:56,009 INFO L280 TraceCheckUtils]: 14: Hoare triple {2640#true} assume !(0 != #t~nondet1); {2640#true} is VALID [2020-07-18 00:23:56,009 INFO L280 TraceCheckUtils]: 15: Hoare triple {2640#true} havoc #t~nondet1; {2640#true} is VALID [2020-07-18 00:23:56,010 INFO L280 TraceCheckUtils]: 16: Hoare triple {2640#true} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-5 {2640#true} is VALID [2020-07-18 00:23:56,010 INFO L280 TraceCheckUtils]: 17: Hoare triple {2640#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); srcloc: L1010 {2640#true} is VALID [2020-07-18 00:23:56,010 INFO L280 TraceCheckUtils]: 18: Hoare triple {2640#true} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {2640#true} is VALID [2020-07-18 00:23:56,011 INFO L280 TraceCheckUtils]: 19: Hoare triple {2640#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {2640#true} is VALID [2020-07-18 00:23:56,011 INFO L280 TraceCheckUtils]: 20: Hoare triple {2640#true} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {2640#true} is VALID [2020-07-18 00:23:56,011 INFO L280 TraceCheckUtils]: 21: Hoare triple {2640#true} havoc #t~mem6.base, #t~mem6.offset; {2640#true} is VALID [2020-07-18 00:23:56,011 INFO L280 TraceCheckUtils]: 22: Hoare triple {2640#true} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {2640#true} is VALID [2020-07-18 00:23:56,012 INFO L280 TraceCheckUtils]: 23: Hoare triple {2640#true} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {2640#true} is VALID [2020-07-18 00:23:56,012 INFO L280 TraceCheckUtils]: 24: Hoare triple {2640#true} havoc #t~mem7.base, #t~mem7.offset; {2640#true} is VALID [2020-07-18 00:23:56,012 INFO L280 TraceCheckUtils]: 25: Hoare triple {2640#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2640#true} is VALID [2020-07-18 00:23:56,013 INFO L280 TraceCheckUtils]: 26: Hoare triple {2640#true} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {2640#true} is VALID [2020-07-18 00:23:56,013 INFO L280 TraceCheckUtils]: 27: Hoare triple {2640#true} goto; {2640#true} is VALID [2020-07-18 00:23:56,014 INFO L280 TraceCheckUtils]: 28: Hoare triple {2640#true} SUMMARY for call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1019-4 {2647#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem8|)} is VALID [2020-07-18 00:23:56,015 INFO L280 TraceCheckUtils]: 29: Hoare triple {2647#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem8|)} assume !(1 != #t~mem8); {2648#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-18 00:23:56,016 INFO L280 TraceCheckUtils]: 30: Hoare triple {2648#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} havoc #t~mem8; {2648#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-18 00:23:56,017 INFO L280 TraceCheckUtils]: 31: Hoare triple {2648#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} SUMMARY for call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1024-6 {2649#(= |main_#t~mem11| 1)} is VALID [2020-07-18 00:23:56,018 INFO L280 TraceCheckUtils]: 32: Hoare triple {2649#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11); {2641#false} is VALID [2020-07-18 00:23:56,018 INFO L280 TraceCheckUtils]: 33: Hoare triple {2641#false} havoc #t~mem11; {2641#false} is VALID [2020-07-18 00:23:56,018 INFO L280 TraceCheckUtils]: 34: Hoare triple {2641#false} assume !false; {2641#false} is VALID [2020-07-18 00:23:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:23:56,020 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:56,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1850003263] [2020-07-18 00:23:56,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:56,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:23:56,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232285426] [2020-07-18 00:23:56,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-18 00:23:56,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:56,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:23:56,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:56,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:23:56,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:56,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:23:56,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:23:56,070 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 6 states. [2020-07-18 00:23:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:56,933 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2020-07-18 00:23:56,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:23:56,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-18 00:23:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:23:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:23:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2020-07-18 00:23:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:23:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2020-07-18 00:23:56,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 90 transitions. [2020-07-18 00:23:57,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:57,047 INFO L225 Difference]: With dead ends: 101 [2020-07-18 00:23:57,048 INFO L226 Difference]: Without dead ends: 98 [2020-07-18 00:23:57,048 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:23:57,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-18 00:23:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-07-18 00:23:57,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:23:57,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 98 states. [2020-07-18 00:23:57,370 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2020-07-18 00:23:57,370 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2020-07-18 00:23:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:57,377 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2020-07-18 00:23:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2020-07-18 00:23:57,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:57,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:57,378 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2020-07-18 00:23:57,378 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2020-07-18 00:23:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:57,383 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2020-07-18 00:23:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2020-07-18 00:23:57,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:57,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:57,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:23:57,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:23:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-18 00:23:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2020-07-18 00:23:57,390 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 35 [2020-07-18 00:23:57,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:23:57,391 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2020-07-18 00:23:57,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:23:57,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 98 states and 101 transitions. [2020-07-18 00:23:57,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:57,576 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2020-07-18 00:23:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:23:57,578 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:57,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:23:57,579 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:23:57,580 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:57,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash 666566073, now seen corresponding path program 1 times [2020-07-18 00:23:57,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:57,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [608858665] [2020-07-18 00:23:57,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:58,227 INFO L280 TraceCheckUtils]: 0: Hoare triple {3269#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3251#true} is VALID [2020-07-18 00:23:58,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {3251#true} #valid := #valid[0 := 0]; {3251#true} is VALID [2020-07-18 00:23:58,228 INFO L280 TraceCheckUtils]: 2: Hoare triple {3251#true} assume 0 < #StackHeapBarrier; {3251#true} is VALID [2020-07-18 00:23:58,228 INFO L280 TraceCheckUtils]: 3: Hoare triple {3251#true} assume true; {3251#true} is VALID [2020-07-18 00:23:58,229 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3251#true} {3251#true} #213#return; {3251#true} is VALID [2020-07-18 00:23:58,230 INFO L263 TraceCheckUtils]: 0: Hoare triple {3251#true} call ULTIMATE.init(); {3269#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:58,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {3269#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3251#true} is VALID [2020-07-18 00:23:58,231 INFO L280 TraceCheckUtils]: 2: Hoare triple {3251#true} #valid := #valid[0 := 0]; {3251#true} is VALID [2020-07-18 00:23:58,231 INFO L280 TraceCheckUtils]: 3: Hoare triple {3251#true} assume 0 < #StackHeapBarrier; {3251#true} is VALID [2020-07-18 00:23:58,232 INFO L280 TraceCheckUtils]: 4: Hoare triple {3251#true} assume true; {3251#true} is VALID [2020-07-18 00:23:58,232 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3251#true} {3251#true} #213#return; {3251#true} is VALID [2020-07-18 00:23:58,236 INFO L263 TraceCheckUtils]: 6: Hoare triple {3251#true} call #t~ret18 := main(); {3251#true} is VALID [2020-07-18 00:23:58,241 INFO L280 TraceCheckUtils]: 7: Hoare triple {3251#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {3258#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} is VALID [2020-07-18 00:23:58,242 INFO L280 TraceCheckUtils]: 8: Hoare triple {3258#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-18 00:23:58,244 INFO L280 TraceCheckUtils]: 9: Hoare triple {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-18 00:23:58,246 INFO L280 TraceCheckUtils]: 10: Hoare triple {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-18 00:23:58,247 INFO L280 TraceCheckUtils]: 11: Hoare triple {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-18 00:23:58,248 INFO L280 TraceCheckUtils]: 12: Hoare triple {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-18 00:23:58,250 INFO L280 TraceCheckUtils]: 13: Hoare triple {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-18 00:23:58,252 INFO L280 TraceCheckUtils]: 14: Hoare triple {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} assume !(0 != #t~nondet1); {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-18 00:23:58,253 INFO L280 TraceCheckUtils]: 15: Hoare triple {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} havoc #t~nondet1; {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-18 00:23:58,255 INFO L280 TraceCheckUtils]: 16: Hoare triple {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-5 {3261#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-18 00:23:58,259 INFO L280 TraceCheckUtils]: 17: Hoare triple {3261#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); srcloc: L1010 {3262#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= |main_#t~malloc5.base| main_~x~0.base)))} is VALID [2020-07-18 00:23:58,261 INFO L280 TraceCheckUtils]: 18: Hoare triple {3262#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= |main_#t~malloc5.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-18 00:23:58,263 INFO L280 TraceCheckUtils]: 19: Hoare triple {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {3264#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.base|) (not (= |main_#t~mem6.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-18 00:23:58,266 INFO L280 TraceCheckUtils]: 20: Hoare triple {3264#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.base|) (not (= |main_#t~mem6.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-18 00:23:58,268 INFO L280 TraceCheckUtils]: 21: Hoare triple {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} havoc #t~mem6.base, #t~mem6.offset; {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-18 00:23:58,270 INFO L280 TraceCheckUtils]: 22: Hoare triple {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {3265#(and (not (= |main_#t~mem7.base| main_~head~0.base)) (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} is VALID [2020-07-18 00:23:58,273 INFO L280 TraceCheckUtils]: 23: Hoare triple {3265#(and (not (= |main_#t~mem7.base| main_~head~0.base)) (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {3266#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} is VALID [2020-07-18 00:23:58,277 INFO L280 TraceCheckUtils]: 24: Hoare triple {3266#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} havoc #t~mem7.base, #t~mem7.offset; {3266#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} is VALID [2020-07-18 00:23:58,278 INFO L280 TraceCheckUtils]: 25: Hoare triple {3266#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-18 00:23:58,279 INFO L280 TraceCheckUtils]: 26: Hoare triple {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-18 00:23:58,280 INFO L280 TraceCheckUtils]: 27: Hoare triple {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} goto; {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-18 00:23:58,282 INFO L280 TraceCheckUtils]: 28: Hoare triple {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} SUMMARY for call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1019-4 {3268#(= 1 |main_#t~mem8|)} is VALID [2020-07-18 00:23:58,283 INFO L280 TraceCheckUtils]: 29: Hoare triple {3268#(= 1 |main_#t~mem8|)} assume !!(1 != #t~mem8); {3252#false} is VALID [2020-07-18 00:23:58,283 INFO L280 TraceCheckUtils]: 30: Hoare triple {3252#false} havoc #t~mem8; {3252#false} is VALID [2020-07-18 00:23:58,284 INFO L280 TraceCheckUtils]: 31: Hoare triple {3252#false} SUMMARY for call #t~mem9 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-7 {3252#false} is VALID [2020-07-18 00:23:58,284 INFO L280 TraceCheckUtils]: 32: Hoare triple {3252#false} assume !(0 == #t~mem9); {3252#false} is VALID [2020-07-18 00:23:58,284 INFO L280 TraceCheckUtils]: 33: Hoare triple {3252#false} havoc #t~mem9; {3252#false} is VALID [2020-07-18 00:23:58,284 INFO L280 TraceCheckUtils]: 34: Hoare triple {3252#false} assume !false; {3252#false} is VALID [2020-07-18 00:23:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:23:58,288 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:58,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [608858665] [2020-07-18 00:23:58,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:58,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-18 00:23:58,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826335454] [2020-07-18 00:23:58,290 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-07-18 00:23:58,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:58,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 00:23:58,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:58,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 00:23:58,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:58,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 00:23:58,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-18 00:23:58,343 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 14 states. [2020-07-18 00:24:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:01,814 INFO L93 Difference]: Finished difference Result 229 states and 235 transitions. [2020-07-18 00:24:01,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-18 00:24:01,814 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-07-18 00:24:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:24:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 232 transitions. [2020-07-18 00:24:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:24:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 232 transitions. [2020-07-18 00:24:01,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 232 transitions. [2020-07-18 00:24:02,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:02,155 INFO L225 Difference]: With dead ends: 229 [2020-07-18 00:24:02,155 INFO L226 Difference]: Without dead ends: 186 [2020-07-18 00:24:02,157 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2020-07-18 00:24:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-07-18 00:24:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 113. [2020-07-18 00:24:02,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:02,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 113 states. [2020-07-18 00:24:02,703 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 113 states. [2020-07-18 00:24:02,703 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 113 states. [2020-07-18 00:24:02,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:02,713 INFO L93 Difference]: Finished difference Result 186 states and 190 transitions. [2020-07-18 00:24:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 190 transitions. [2020-07-18 00:24:02,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:02,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:02,714 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 186 states. [2020-07-18 00:24:02,714 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 186 states. [2020-07-18 00:24:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:02,725 INFO L93 Difference]: Finished difference Result 186 states and 190 transitions. [2020-07-18 00:24:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 190 transitions. [2020-07-18 00:24:02,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:02,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:02,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:02,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-18 00:24:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2020-07-18 00:24:02,733 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 35 [2020-07-18 00:24:02,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:02,736 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2020-07-18 00:24:02,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 00:24:02,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 113 states and 116 transitions. [2020-07-18 00:24:02,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2020-07-18 00:24:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-18 00:24:02,992 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:02,992 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:02,992 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:24:02,993 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:02,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash 323200756, now seen corresponding path program 1 times [2020-07-18 00:24:02,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:02,994 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1039148956] [2020-07-18 00:24:02,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:03,563 INFO L280 TraceCheckUtils]: 0: Hoare triple {4373#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4352#true} is VALID [2020-07-18 00:24:03,563 INFO L280 TraceCheckUtils]: 1: Hoare triple {4352#true} #valid := #valid[0 := 0]; {4352#true} is VALID [2020-07-18 00:24:03,564 INFO L280 TraceCheckUtils]: 2: Hoare triple {4352#true} assume 0 < #StackHeapBarrier; {4352#true} is VALID [2020-07-18 00:24:03,564 INFO L280 TraceCheckUtils]: 3: Hoare triple {4352#true} assume true; {4352#true} is VALID [2020-07-18 00:24:03,565 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4352#true} {4352#true} #213#return; {4352#true} is VALID [2020-07-18 00:24:03,567 INFO L263 TraceCheckUtils]: 0: Hoare triple {4352#true} call ULTIMATE.init(); {4373#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:03,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {4373#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4352#true} is VALID [2020-07-18 00:24:03,568 INFO L280 TraceCheckUtils]: 2: Hoare triple {4352#true} #valid := #valid[0 := 0]; {4352#true} is VALID [2020-07-18 00:24:03,568 INFO L280 TraceCheckUtils]: 3: Hoare triple {4352#true} assume 0 < #StackHeapBarrier; {4352#true} is VALID [2020-07-18 00:24:03,568 INFO L280 TraceCheckUtils]: 4: Hoare triple {4352#true} assume true; {4352#true} is VALID [2020-07-18 00:24:03,569 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4352#true} {4352#true} #213#return; {4352#true} is VALID [2020-07-18 00:24:03,569 INFO L263 TraceCheckUtils]: 6: Hoare triple {4352#true} call #t~ret18 := main(); {4352#true} is VALID [2020-07-18 00:24:03,574 INFO L280 TraceCheckUtils]: 7: Hoare triple {4352#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {4359#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-18 00:24:03,575 INFO L280 TraceCheckUtils]: 8: Hoare triple {4359#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {4360#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-18 00:24:03,577 INFO L280 TraceCheckUtils]: 9: Hoare triple {4360#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {4360#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-18 00:24:03,613 INFO L280 TraceCheckUtils]: 10: Hoare triple {4360#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {4360#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-18 00:24:03,622 INFO L280 TraceCheckUtils]: 11: Hoare triple {4360#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {4360#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-18 00:24:03,623 INFO L280 TraceCheckUtils]: 12: Hoare triple {4360#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:24:03,623 INFO L280 TraceCheckUtils]: 13: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:24:03,624 INFO L280 TraceCheckUtils]: 14: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1); {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:24:03,625 INFO L280 TraceCheckUtils]: 15: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} havoc #t~nondet1; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:24:03,626 INFO L280 TraceCheckUtils]: 16: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L1004 {4362#(and (= (select |#valid| |main_#t~malloc2.base|) 1) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-18 00:24:03,628 INFO L280 TraceCheckUtils]: 17: Hoare triple {4362#(and (= (select |#valid| |main_#t~malloc2.base|) 1) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1004-1 {4363#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-18 00:24:03,630 INFO L280 TraceCheckUtils]: 18: Hoare triple {4363#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1004-2 {4364#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-18 00:24:03,632 INFO L280 TraceCheckUtils]: 19: Hoare triple {4364#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L1005 {4365#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:24:03,633 INFO L280 TraceCheckUtils]: 20: Hoare triple {4365#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem3.base, #t~mem3.offset; {4365#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:24:03,634 INFO L280 TraceCheckUtils]: 21: Hoare triple {4365#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1006 {4366#(= 1 (select |#valid| |main_#t~mem4.base|))} is VALID [2020-07-18 00:24:03,636 INFO L280 TraceCheckUtils]: 22: Hoare triple {4366#(= 1 (select |#valid| |main_#t~mem4.base|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:24:03,636 INFO L280 TraceCheckUtils]: 23: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} havoc #t~mem4.base, #t~mem4.offset; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:24:03,637 INFO L280 TraceCheckUtils]: 24: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call write~int(0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1007 {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:24:03,638 INFO L280 TraceCheckUtils]: 25: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:24:03,638 INFO L280 TraceCheckUtils]: 26: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} goto; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:24:03,639 INFO L280 TraceCheckUtils]: 27: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:24:03,639 INFO L280 TraceCheckUtils]: 28: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1); {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:24:03,640 INFO L280 TraceCheckUtils]: 29: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} havoc #t~nondet1; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:24:03,641 INFO L280 TraceCheckUtils]: 30: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L1004 {4367#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-18 00:24:03,643 INFO L280 TraceCheckUtils]: 31: Hoare triple {4367#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1004-1 {4368#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-18 00:24:03,644 INFO L280 TraceCheckUtils]: 32: Hoare triple {4368#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1004-2 {4369#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-18 00:24:03,646 INFO L280 TraceCheckUtils]: 33: Hoare triple {4369#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L1005 {4370#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:24:03,647 INFO L280 TraceCheckUtils]: 34: Hoare triple {4370#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem3.base, #t~mem3.offset; {4370#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:24:03,649 INFO L280 TraceCheckUtils]: 35: Hoare triple {4370#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1006 {4371#(not (= 0 |main_#t~mem4.base|))} is VALID [2020-07-18 00:24:03,650 INFO L280 TraceCheckUtils]: 36: Hoare triple {4371#(not (= 0 |main_#t~mem4.base|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {4372#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:24:03,651 INFO L280 TraceCheckUtils]: 37: Hoare triple {4372#(not (= 0 main_~x~0.base))} havoc #t~mem4.base, #t~mem4.offset; {4372#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:24:03,652 INFO L280 TraceCheckUtils]: 38: Hoare triple {4372#(not (= 0 main_~x~0.base))} SUMMARY for call write~int(0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1007 {4372#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:24:03,652 INFO L280 TraceCheckUtils]: 39: Hoare triple {4372#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {4353#false} is VALID [2020-07-18 00:24:03,653 INFO L280 TraceCheckUtils]: 40: Hoare triple {4353#false} assume !false; {4353#false} is VALID [2020-07-18 00:24:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:24:03,658 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:03,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1039148956] [2020-07-18 00:24:03,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:03,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-18 00:24:03,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715300436] [2020-07-18 00:24:03,659 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2020-07-18 00:24:03,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:03,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-18 00:24:03,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:03,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-18 00:24:03,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:03,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-18 00:24:03,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2020-07-18 00:24:03,722 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand 17 states. [2020-07-18 00:24:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:07,557 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2020-07-18 00:24:07,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-18 00:24:07,558 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2020-07-18 00:24:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-18 00:24:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 143 transitions. [2020-07-18 00:24:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-18 00:24:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 143 transitions. [2020-07-18 00:24:07,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 143 transitions. [2020-07-18 00:24:07,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:07,785 INFO L225 Difference]: With dead ends: 146 [2020-07-18 00:24:07,785 INFO L226 Difference]: Without dead ends: 144 [2020-07-18 00:24:07,786 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2020-07-18 00:24:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-18 00:24:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 100. [2020-07-18 00:24:08,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:08,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 100 states. [2020-07-18 00:24:08,340 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 100 states. [2020-07-18 00:24:08,341 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 100 states. [2020-07-18 00:24:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:08,346 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2020-07-18 00:24:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2020-07-18 00:24:08,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:08,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:08,347 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 144 states. [2020-07-18 00:24:08,348 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 144 states. [2020-07-18 00:24:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:08,353 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2020-07-18 00:24:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2020-07-18 00:24:08,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:08,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:08,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:08,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-18 00:24:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2020-07-18 00:24:08,358 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 41 [2020-07-18 00:24:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:08,358 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2020-07-18 00:24:08,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-18 00:24:08,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 100 states and 103 transitions. [2020-07-18 00:24:08,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2020-07-18 00:24:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-18 00:24:08,622 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:08,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:08,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:24:08,623 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:08,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:08,623 INFO L82 PathProgramCache]: Analyzing trace with hash 957359950, now seen corresponding path program 1 times [2020-07-18 00:24:08,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:08,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1540261287] [2020-07-18 00:24:08,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 00:24:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 00:24:08,739 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:08,740 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 00:24:08,740 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 00:24:08,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:24:08,770 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-18 00:24:08,770 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 00:24:08,770 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 00:24:08,770 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 00:24:08,770 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 00:24:08,770 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 00:24:08,771 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 00:24:08,771 WARN L170 areAnnotationChecker]: L993 has no Hoare annotation [2020-07-18 00:24:08,771 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-18 00:24:08,771 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 00:24:08,771 WARN L170 areAnnotationChecker]: L994 has no Hoare annotation [2020-07-18 00:24:08,771 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 00:24:08,772 WARN L170 areAnnotationChecker]: L994-1 has no Hoare annotation [2020-07-18 00:24:08,772 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 00:24:08,772 WARN L170 areAnnotationChecker]: L995 has no Hoare annotation [2020-07-18 00:24:08,772 WARN L170 areAnnotationChecker]: L996 has no Hoare annotation [2020-07-18 00:24:08,772 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-18 00:24:08,772 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-18 00:24:08,773 WARN L170 areAnnotationChecker]: L1001-5 has no Hoare annotation [2020-07-18 00:24:08,773 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2020-07-18 00:24:08,773 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2020-07-18 00:24:08,773 WARN L170 areAnnotationChecker]: L1010 has no Hoare annotation [2020-07-18 00:24:08,773 WARN L170 areAnnotationChecker]: L1001-2 has no Hoare annotation [2020-07-18 00:24:08,773 WARN L170 areAnnotationChecker]: L1001-4 has no Hoare annotation [2020-07-18 00:24:08,773 WARN L170 areAnnotationChecker]: L1011 has no Hoare annotation [2020-07-18 00:24:08,773 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-18 00:24:08,774 WARN L170 areAnnotationChecker]: L1011-1 has no Hoare annotation [2020-07-18 00:24:08,774 WARN L170 areAnnotationChecker]: L1004-1 has no Hoare annotation [2020-07-18 00:24:08,774 WARN L170 areAnnotationChecker]: L1012 has no Hoare annotation [2020-07-18 00:24:08,774 WARN L170 areAnnotationChecker]: L1004-2 has no Hoare annotation [2020-07-18 00:24:08,774 WARN L170 areAnnotationChecker]: L1012-1 has no Hoare annotation [2020-07-18 00:24:08,774 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2020-07-18 00:24:08,774 WARN L170 areAnnotationChecker]: L1013 has no Hoare annotation [2020-07-18 00:24:08,774 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2020-07-18 00:24:08,774 WARN L170 areAnnotationChecker]: L1013-1 has no Hoare annotation [2020-07-18 00:24:08,775 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2020-07-18 00:24:08,775 WARN L170 areAnnotationChecker]: L1013-2 has no Hoare annotation [2020-07-18 00:24:08,775 WARN L170 areAnnotationChecker]: L1006-1 has no Hoare annotation [2020-07-18 00:24:08,775 WARN L170 areAnnotationChecker]: L1015 has no Hoare annotation [2020-07-18 00:24:08,775 WARN L170 areAnnotationChecker]: L1006-2 has no Hoare annotation [2020-07-18 00:24:08,775 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-18 00:24:08,775 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-18 00:24:08,775 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-18 00:24:08,775 WARN L170 areAnnotationChecker]: L1007 has no Hoare annotation [2020-07-18 00:24:08,775 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-18 00:24:08,776 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-18 00:24:08,776 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-18 00:24:08,777 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-18 00:24:08,777 WARN L170 areAnnotationChecker]: L1017-3 has no Hoare annotation [2020-07-18 00:24:08,777 WARN L170 areAnnotationChecker]: L1017-3 has no Hoare annotation [2020-07-18 00:24:08,777 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-18 00:24:08,777 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-18 00:24:08,777 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-18 00:24:08,777 WARN L170 areAnnotationChecker]: L1024-6 has no Hoare annotation [2020-07-18 00:24:08,777 WARN L170 areAnnotationChecker]: L1024-6 has no Hoare annotation [2020-07-18 00:24:08,778 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-18 00:24:08,778 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-18 00:24:08,778 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-18 00:24:08,779 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-18 00:24:08,779 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-18 00:24:08,779 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-18 00:24:08,779 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-18 00:24:08,779 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-18 00:24:08,779 WARN L170 areAnnotationChecker]: L1024-7 has no Hoare annotation [2020-07-18 00:24:08,779 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2020-07-18 00:24:08,779 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2020-07-18 00:24:08,780 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2020-07-18 00:24:08,780 WARN L170 areAnnotationChecker]: L1024-4 has no Hoare annotation [2020-07-18 00:24:08,780 WARN L170 areAnnotationChecker]: L1025 has no Hoare annotation [2020-07-18 00:24:08,780 WARN L170 areAnnotationChecker]: L1021-7 has no Hoare annotation [2020-07-18 00:24:08,780 WARN L170 areAnnotationChecker]: L1021-7 has no Hoare annotation [2020-07-18 00:24:08,780 WARN L170 areAnnotationChecker]: L1024-2 has no Hoare annotation [2020-07-18 00:24:08,781 WARN L170 areAnnotationChecker]: L1024-2 has no Hoare annotation [2020-07-18 00:24:08,781 WARN L170 areAnnotationChecker]: L1024-5 has no Hoare annotation [2020-07-18 00:24:08,781 WARN L170 areAnnotationChecker]: L1024-5 has no Hoare annotation [2020-07-18 00:24:08,781 WARN L170 areAnnotationChecker]: L1025-1 has no Hoare annotation [2020-07-18 00:24:08,781 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-18 00:24:08,781 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-18 00:24:08,781 WARN L170 areAnnotationChecker]: L1021-8 has no Hoare annotation [2020-07-18 00:24:08,781 WARN L170 areAnnotationChecker]: L1026-7 has no Hoare annotation [2020-07-18 00:24:08,781 WARN L170 areAnnotationChecker]: L1026-7 has no Hoare annotation [2020-07-18 00:24:08,782 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-18 00:24:08,782 WARN L170 areAnnotationChecker]: L1021-5 has no Hoare annotation [2020-07-18 00:24:08,782 WARN L170 areAnnotationChecker]: L1022 has no Hoare annotation [2020-07-18 00:24:08,782 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2020-07-18 00:24:08,782 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2020-07-18 00:24:08,782 WARN L170 areAnnotationChecker]: L1026-8 has no Hoare annotation [2020-07-18 00:24:08,782 WARN L170 areAnnotationChecker]: L1021-3 has no Hoare annotation [2020-07-18 00:24:08,782 WARN L170 areAnnotationChecker]: L1021-3 has no Hoare annotation [2020-07-18 00:24:08,782 WARN L170 areAnnotationChecker]: L1021-6 has no Hoare annotation [2020-07-18 00:24:08,783 WARN L170 areAnnotationChecker]: L1021-6 has no Hoare annotation [2020-07-18 00:24:08,783 WARN L170 areAnnotationChecker]: L1022-1 has no Hoare annotation [2020-07-18 00:24:08,783 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2020-07-18 00:24:08,783 WARN L170 areAnnotationChecker]: L1026-5 has no Hoare annotation [2020-07-18 00:24:08,783 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2020-07-18 00:24:08,783 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2020-07-18 00:24:08,783 WARN L170 areAnnotationChecker]: L1026-3 has no Hoare annotation [2020-07-18 00:24:08,783 WARN L170 areAnnotationChecker]: L1026-3 has no Hoare annotation [2020-07-18 00:24:08,783 WARN L170 areAnnotationChecker]: L1026-6 has no Hoare annotation [2020-07-18 00:24:08,784 WARN L170 areAnnotationChecker]: L1026-6 has no Hoare annotation [2020-07-18 00:24:08,784 WARN L170 areAnnotationChecker]: L1036-6 has no Hoare annotation [2020-07-18 00:24:08,784 WARN L170 areAnnotationChecker]: L1036-6 has no Hoare annotation [2020-07-18 00:24:08,784 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-18 00:24:08,784 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-18 00:24:08,784 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2020-07-18 00:24:08,784 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2020-07-18 00:24:08,784 WARN L170 areAnnotationChecker]: L1036-7 has no Hoare annotation [2020-07-18 00:24:08,784 WARN L170 areAnnotationChecker]: L1030-2 has no Hoare annotation [2020-07-18 00:24:08,784 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2020-07-18 00:24:08,785 WARN L170 areAnnotationChecker]: L1036-1 has no Hoare annotation [2020-07-18 00:24:08,785 WARN L170 areAnnotationChecker]: L1036-4 has no Hoare annotation [2020-07-18 00:24:08,785 WARN L170 areAnnotationChecker]: L1037 has no Hoare annotation [2020-07-18 00:24:08,785 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-18 00:24:08,785 WARN L170 areAnnotationChecker]: L1036-2 has no Hoare annotation [2020-07-18 00:24:08,785 WARN L170 areAnnotationChecker]: L1036-2 has no Hoare annotation [2020-07-18 00:24:08,785 WARN L170 areAnnotationChecker]: L1036-5 has no Hoare annotation [2020-07-18 00:24:08,785 WARN L170 areAnnotationChecker]: L1036-5 has no Hoare annotation [2020-07-18 00:24:08,785 WARN L170 areAnnotationChecker]: L1037-1 has no Hoare annotation [2020-07-18 00:24:08,785 WARN L170 areAnnotationChecker]: L1033 has no Hoare annotation [2020-07-18 00:24:08,786 WARN L170 areAnnotationChecker]: L1038 has no Hoare annotation [2020-07-18 00:24:08,786 WARN L170 areAnnotationChecker]: L1033-1 has no Hoare annotation [2020-07-18 00:24:08,786 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-18 00:24:08,786 WARN L170 areAnnotationChecker]: L1033-2 has no Hoare annotation [2020-07-18 00:24:08,786 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 00:24:08,786 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2020-07-18 00:24:08,786 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 00:24:08,786 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:24:08,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:24:08 BoogieIcfgContainer [2020-07-18 00:24:08,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:24:08,800 INFO L168 Benchmark]: Toolchain (without parser) took 23535.15 ms. Allocated memory was 142.6 MB in the beginning and 442.5 MB in the end (delta: 299.9 MB). Free memory was 99.7 MB in the beginning and 287.1 MB in the end (delta: -187.4 MB). Peak memory consumption was 112.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:08,801 INFO L168 Benchmark]: CDTParser took 1.14 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:24:08,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 883.65 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 99.2 MB in the beginning and 165.6 MB in the end (delta: -66.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:08,810 INFO L168 Benchmark]: Boogie Preprocessor took 97.79 ms. Allocated memory is still 199.8 MB. Free memory was 165.6 MB in the beginning and 161.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:08,815 INFO L168 Benchmark]: RCFGBuilder took 1159.19 ms. Allocated memory is still 199.8 MB. Free memory was 161.9 MB in the beginning and 94.3 MB in the end (delta: 67.6 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:08,816 INFO L168 Benchmark]: TraceAbstraction took 21382.66 ms. Allocated memory was 199.8 MB in the beginning and 442.5 MB in the end (delta: 242.7 MB). Free memory was 93.6 MB in the beginning and 287.1 MB in the end (delta: -193.5 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:08,822 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 883.65 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 99.2 MB in the beginning and 165.6 MB in the end (delta: -66.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.79 ms. Allocated memory is still 199.8 MB. Free memory was 165.6 MB in the beginning and 161.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1159.19 ms. Allocated memory is still 199.8 MB. Free memory was 161.9 MB in the beginning and 94.3 MB in the end (delta: 67.6 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21382.66 ms. Allocated memory was 199.8 MB in the beginning and 442.5 MB in the end (delta: 242.7 MB). Free memory was 93.6 MB in the beginning and 287.1 MB in the end (delta: -193.5 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1026]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L993] SLL* head = malloc(sizeof(SLL)); [L994] head->next = ((void*)0) [L995] head->prev = ((void*)0) [L996] head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] x->data = 1 [L1011] x->next = malloc(sizeof(SLL)) [L1012] EXPR x->next [L1012] x->next->prev = x [L1013] EXPR x->next [L1013] x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1019] EXPR x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR x->data [L1024] COND FALSE !(!(1 == x->data)) [L1025] EXPR x->next [L1025] x = x->next [L1026] EXPR x->data [L1026] COND TRUE !(2 != x->data) [L1026] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 101 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.2s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 425 SDtfs, 1389 SDslu, 1656 SDs, 0 SdLazy, 1852 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 243 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...