/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-circular-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:23:21,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:23:21,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:23:21,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:23:21,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:23:21,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:23:21,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:23:21,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:23:21,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:23:21,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:23:21,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:23:21,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:23:21,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:23:21,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:23:21,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:23:21,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:23:21,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:23:21,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:23:21,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:23:21,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:23:21,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:23:21,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:23:21,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:23:21,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:23:21,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:23:21,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:23:21,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:23:21,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:23:21,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:23:21,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:23:21,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:23:21,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:23:21,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:23:21,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:23:21,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:23:21,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:23:21,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:23:21,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:23:21,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:23:21,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:23:21,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:23:21,241 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:21,256 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:23:21,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:23:21,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:23:21,258 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:23:21,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:23:21,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:23:21,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:23:21,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:23:21,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:23:21,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:23:21,259 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:23:21,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:23:21,260 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:23:21,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:23:21,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:23:21,261 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:23:21,261 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:23:21,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:23:21,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:23:21,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:23:21,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:23:21,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:23:21,262 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:23:21,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:23:21,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:23:21,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:23:21,573 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:23:21,574 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:23:21,575 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular-1.i [2020-07-18 00:23:21,663 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1360fa32/d1b3fc3c2e0846ffa07d64163f73e573/FLAG23531353d [2020-07-18 00:23:22,263 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:23:22,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-1.i [2020-07-18 00:23:22,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1360fa32/d1b3fc3c2e0846ffa07d64163f73e573/FLAG23531353d [2020-07-18 00:23:22,530 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1360fa32/d1b3fc3c2e0846ffa07d64163f73e573 [2020-07-18 00:23:22,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:23:22,542 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:23:22,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:23:22,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:23:22,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:23:22,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:23:22" (1/1) ... [2020-07-18 00:23:22,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6665baa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:22, skipping insertion in model container [2020-07-18 00:23:22,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:23:22" (1/1) ... [2020-07-18 00:23:22,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:23:22,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:23:23,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:23:23,079 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:23:23,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:23:23,208 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:23:23,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:23 WrapperNode [2020-07-18 00:23:23,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:23:23,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:23:23,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:23:23,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:23:23,227 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:23" (1/1) ... [2020-07-18 00:23:23,227 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:23" (1/1) ... [2020-07-18 00:23:23,245 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:23" (1/1) ... [2020-07-18 00:23:23,245 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:23" (1/1) ... [2020-07-18 00:23:23,271 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:23" (1/1) ... [2020-07-18 00:23:23,279 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:23" (1/1) ... [2020-07-18 00:23:23,283 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:23" (1/1) ... [2020-07-18 00:23:23,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:23:23,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:23:23,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:23:23,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:23:23,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:23" (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:23,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:23:23,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:23:23,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:23:23,352 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-18 00:23:23,352 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-18 00:23:23,352 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-18 00:23:23,352 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-18 00:23:23,353 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-18 00:23:23,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-18 00:23:23,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-18 00:23:23,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-18 00:23:23,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-18 00:23:23,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-18 00:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-18 00:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-18 00:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-18 00:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-18 00:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-18 00:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-18 00:23:23,355 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-18 00:23:23,355 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-18 00:23:23,355 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-18 00:23:23,355 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-18 00:23:23,355 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-18 00:23:23,356 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-18 00:23:23,356 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-18 00:23:23,356 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-18 00:23:23,356 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-18 00:23:23,356 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-18 00:23:23,356 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-18 00:23:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-18 00:23:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-18 00:23:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-18 00:23:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-18 00:23:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-18 00:23:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-18 00:23:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-18 00:23:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-18 00:23:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-18 00:23:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-18 00:23:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-18 00:23:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-18 00:23:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-18 00:23:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-18 00:23:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-18 00:23:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-18 00:23:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-18 00:23:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-18 00:23:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-18 00:23:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-18 00:23:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-18 00:23:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-18 00:23:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-18 00:23:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:23:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-18 00:23:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-18 00:23:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 00:23:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-18 00:23:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-18 00:23:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-18 00:23:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-18 00:23:23,361 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-18 00:23:23,361 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:23:23,361 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-18 00:23:23,361 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-18 00:23:23,361 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-18 00:23:23,361 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-18 00:23:23,361 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-18 00:23:23,361 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-18 00:23:23,361 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-18 00:23:23,361 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-18 00:23:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-18 00:23:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-18 00:23:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-18 00:23:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-18 00:23:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-18 00:23:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-18 00:23:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-18 00:23:23,363 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-18 00:23:23,363 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-18 00:23:23,363 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-18 00:23:23,363 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-18 00:23:23,363 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-18 00:23:23,363 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-18 00:23:23,364 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-18 00:23:23,364 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-18 00:23:23,364 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-18 00:23:23,364 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-18 00:23:23,364 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-18 00:23:23,364 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-18 00:23:23,364 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-18 00:23:23,365 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-18 00:23:23,365 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-18 00:23:23,365 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-18 00:23:23,365 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-18 00:23:23,365 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-18 00:23:23,365 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-18 00:23:23,365 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-18 00:23:23,366 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-18 00:23:23,366 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-18 00:23:23,366 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-18 00:23:23,366 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-18 00:23:23,366 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-18 00:23:23,366 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-18 00:23:23,366 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-18 00:23:23,367 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-18 00:23:23,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:23:23,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:23:23,367 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:23:23,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:23:23,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 00:23:23,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:23:23,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 00:23:23,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:23:23,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:23:23,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:23:23,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:23:24,070 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:23:24,070 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-18 00:23:24,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:23:24 BoogieIcfgContainer [2020-07-18 00:23:24,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:23:24,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:23:24,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:23:24,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:23:24,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:23:22" (1/3) ... [2020-07-18 00:23:24,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70de40fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:23:24, skipping insertion in model container [2020-07-18 00:23:24,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:23" (2/3) ... [2020-07-18 00:23:24,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70de40fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:23:24, skipping insertion in model container [2020-07-18 00:23:24,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:23:24" (3/3) ... [2020-07-18 00:23:24,094 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2020-07-18 00:23:24,106 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:23:24,118 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-07-18 00:23:24,133 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-18 00:23:24,160 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:23:24,160 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:23:24,161 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:23:24,161 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:23:24,161 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:23:24,162 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:23:24,162 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:23:24,162 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:23:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2020-07-18 00:23:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-18 00:23:24,188 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:24,189 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] [2020-07-18 00:23:24,190 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:24,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:24,196 INFO L82 PathProgramCache]: Analyzing trace with hash -740897811, now seen corresponding path program 1 times [2020-07-18 00:23:24,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:24,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2093860309] [2020-07-18 00:23:24,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:24,476 INFO L280 TraceCheckUtils]: 0: Hoare triple {106#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {99#true} is VALID [2020-07-18 00:23:24,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {99#true} #valid := #valid[0 := 0]; {99#true} is VALID [2020-07-18 00:23:24,477 INFO L280 TraceCheckUtils]: 2: Hoare triple {99#true} assume 0 < #StackHeapBarrier; {99#true} is VALID [2020-07-18 00:23:24,479 INFO L280 TraceCheckUtils]: 3: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-18 00:23:24,480 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {99#true} {99#true} #187#return; {99#true} is VALID [2020-07-18 00:23:24,486 INFO L263 TraceCheckUtils]: 0: Hoare triple {99#true} call ULTIMATE.init(); {106#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:24,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {106#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {99#true} is VALID [2020-07-18 00:23:24,486 INFO L280 TraceCheckUtils]: 2: Hoare triple {99#true} #valid := #valid[0 := 0]; {99#true} is VALID [2020-07-18 00:23:24,487 INFO L280 TraceCheckUtils]: 3: Hoare triple {99#true} assume 0 < #StackHeapBarrier; {99#true} is VALID [2020-07-18 00:23:24,487 INFO L280 TraceCheckUtils]: 4: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-18 00:23:24,487 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {99#true} {99#true} #187#return; {99#true} is VALID [2020-07-18 00:23:24,488 INFO L263 TraceCheckUtils]: 6: Hoare triple {99#true} call #t~ret18 := main(); {99#true} is VALID [2020-07-18 00:23:24,488 INFO L280 TraceCheckUtils]: 7: Hoare triple {99#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {99#true} is VALID [2020-07-18 00:23:24,488 INFO L280 TraceCheckUtils]: 8: Hoare triple {99#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {99#true} is VALID [2020-07-18 00:23:24,489 INFO L280 TraceCheckUtils]: 9: Hoare triple {99#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {99#true} is VALID [2020-07-18 00:23:24,489 INFO L280 TraceCheckUtils]: 10: Hoare triple {99#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {99#true} is VALID [2020-07-18 00:23:24,489 INFO L280 TraceCheckUtils]: 11: Hoare triple {99#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {99#true} is VALID [2020-07-18 00:23:24,490 INFO L280 TraceCheckUtils]: 12: Hoare triple {99#true} ~state~0 := 1; {99#true} is VALID [2020-07-18 00:23:24,491 INFO L280 TraceCheckUtils]: 13: Hoare triple {99#true} assume !true; {100#false} is VALID [2020-07-18 00:23:24,491 INFO L280 TraceCheckUtils]: 14: Hoare triple {100#false} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-5 {100#false} is VALID [2020-07-18 00:23:24,492 INFO L280 TraceCheckUtils]: 15: Hoare triple {100#false} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {100#false} is VALID [2020-07-18 00:23:24,492 INFO L280 TraceCheckUtils]: 16: Hoare triple {100#false} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset; {100#false} is VALID [2020-07-18 00:23:24,492 INFO L280 TraceCheckUtils]: 17: Hoare triple {100#false} havoc #t~mem6.base, #t~mem6.offset; {100#false} is VALID [2020-07-18 00:23:24,493 INFO L280 TraceCheckUtils]: 18: Hoare triple {100#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {100#false} is VALID [2020-07-18 00:23:24,493 INFO L280 TraceCheckUtils]: 19: Hoare triple {100#false} assume !false; {100#false} is VALID [2020-07-18 00:23:24,499 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:24,502 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:24,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2093860309] [2020-07-18 00:23:24,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:24,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:23:24,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982464423] [2020-07-18 00:23:24,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-18 00:23:24,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:24,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:23:24,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:24,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:23:24,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:24,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:23:24,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:23:24,584 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 3 states. [2020-07-18 00:23:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:25,051 INFO L93 Difference]: Finished difference Result 179 states and 215 transitions. [2020-07-18 00:23:25,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:23:25,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-18 00:23:25,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:23:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:23:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2020-07-18 00:23:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:23:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2020-07-18 00:23:25,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 215 transitions. [2020-07-18 00:23:25,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:25,375 INFO L225 Difference]: With dead ends: 179 [2020-07-18 00:23:25,375 INFO L226 Difference]: Without dead ends: 77 [2020-07-18 00:23:25,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-18 00:23:25,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-07-18 00:23:25,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:23:25,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 77 states. [2020-07-18 00:23:25,468 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2020-07-18 00:23:25,469 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2020-07-18 00:23:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:25,477 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-07-18 00:23:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-18 00:23:25,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:25,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:25,479 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2020-07-18 00:23:25,479 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2020-07-18 00:23:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:25,486 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-07-18 00:23:25,486 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-18 00:23:25,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:25,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:25,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:23:25,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:23:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-18 00:23:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-07-18 00:23:25,495 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 20 [2020-07-18 00:23:25,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:23:25,496 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-07-18 00:23:25,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:23:25,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 77 states and 82 transitions. [2020-07-18 00:23:25,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-18 00:23:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-18 00:23:25,634 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:25,634 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] [2020-07-18 00:23:25,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:23:25,635 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:25,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:25,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2066269805, now seen corresponding path program 1 times [2020-07-18 00:23:25,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:25,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1600519596] [2020-07-18 00:23:25,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:25,983 INFO L280 TraceCheckUtils]: 0: Hoare triple {789#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {775#true} is VALID [2020-07-18 00:23:25,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {775#true} #valid := #valid[0 := 0]; {775#true} is VALID [2020-07-18 00:23:25,984 INFO L280 TraceCheckUtils]: 2: Hoare triple {775#true} assume 0 < #StackHeapBarrier; {775#true} is VALID [2020-07-18 00:23:25,984 INFO L280 TraceCheckUtils]: 3: Hoare triple {775#true} assume true; {775#true} is VALID [2020-07-18 00:23:25,984 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {775#true} {775#true} #187#return; {775#true} is VALID [2020-07-18 00:23:25,986 INFO L263 TraceCheckUtils]: 0: Hoare triple {775#true} call ULTIMATE.init(); {789#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:25,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {789#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {775#true} is VALID [2020-07-18 00:23:25,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {775#true} #valid := #valid[0 := 0]; {775#true} is VALID [2020-07-18 00:23:25,986 INFO L280 TraceCheckUtils]: 3: Hoare triple {775#true} assume 0 < #StackHeapBarrier; {775#true} is VALID [2020-07-18 00:23:25,987 INFO L280 TraceCheckUtils]: 4: Hoare triple {775#true} assume true; {775#true} is VALID [2020-07-18 00:23:25,987 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {775#true} {775#true} #187#return; {775#true} is VALID [2020-07-18 00:23:25,987 INFO L263 TraceCheckUtils]: 6: Hoare triple {775#true} call #t~ret18 := main(); {775#true} is VALID [2020-07-18 00:23:25,989 INFO L280 TraceCheckUtils]: 7: Hoare triple {775#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {782#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} is VALID [2020-07-18 00:23:25,990 INFO L280 TraceCheckUtils]: 8: Hoare triple {782#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {783#(and (not (= 0 main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-18 00:23:25,992 INFO L280 TraceCheckUtils]: 9: Hoare triple {783#(and (not (= 0 main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {784#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 main_~head~0.offset))} is VALID [2020-07-18 00:23:25,994 INFO L280 TraceCheckUtils]: 10: Hoare triple {784#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 main_~head~0.offset))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {784#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 main_~head~0.offset))} is VALID [2020-07-18 00:23:25,996 INFO L280 TraceCheckUtils]: 11: Hoare triple {784#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {785#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} is VALID [2020-07-18 00:23:25,997 INFO L280 TraceCheckUtils]: 12: Hoare triple {785#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} ~state~0 := 1; {785#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} is VALID [2020-07-18 00:23:25,998 INFO L280 TraceCheckUtils]: 13: Hoare triple {785#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {785#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} is VALID [2020-07-18 00:23:25,999 INFO L280 TraceCheckUtils]: 14: Hoare triple {785#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} assume !(0 != #t~nondet1); {785#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} is VALID [2020-07-18 00:23:26,000 INFO L280 TraceCheckUtils]: 15: Hoare triple {785#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} havoc #t~nondet1; {785#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} is VALID [2020-07-18 00:23:26,001 INFO L280 TraceCheckUtils]: 16: Hoare triple {785#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-5 {786#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-18 00:23:26,002 INFO L280 TraceCheckUtils]: 17: Hoare triple {786#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {787#(not (= 0 |main_#t~mem6.base|))} is VALID [2020-07-18 00:23:26,003 INFO L280 TraceCheckUtils]: 18: Hoare triple {787#(not (= 0 |main_#t~mem6.base|))} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset; {788#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:26,004 INFO L280 TraceCheckUtils]: 19: Hoare triple {788#(not (= 0 main_~x~0.base))} havoc #t~mem6.base, #t~mem6.offset; {788#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:26,004 INFO L280 TraceCheckUtils]: 20: Hoare triple {788#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {776#false} is VALID [2020-07-18 00:23:26,005 INFO L280 TraceCheckUtils]: 21: Hoare triple {776#false} assume !false; {776#false} is VALID [2020-07-18 00:23:26,008 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:26,008 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:26,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1600519596] [2020-07-18 00:23:26,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:26,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-18 00:23:26,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972440305] [2020-07-18 00:23:26,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-07-18 00:23:26,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:26,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 00:23:26,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:26,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 00:23:26,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:26,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 00:23:26,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:23:26,041 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 10 states. [2020-07-18 00:23:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:27,873 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2020-07-18 00:23:27,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-18 00:23:27,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-07-18 00:23:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:23:27,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:23:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 163 transitions. [2020-07-18 00:23:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:23:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 163 transitions. [2020-07-18 00:23:27,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 163 transitions. [2020-07-18 00:23:28,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:28,114 INFO L225 Difference]: With dead ends: 155 [2020-07-18 00:23:28,114 INFO L226 Difference]: Without dead ends: 153 [2020-07-18 00:23:28,117 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-07-18 00:23:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-07-18 00:23:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 85. [2020-07-18 00:23:28,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:23:28,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 85 states. [2020-07-18 00:23:28,358 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 85 states. [2020-07-18 00:23:28,358 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 85 states. [2020-07-18 00:23:28,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:28,368 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2020-07-18 00:23:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2020-07-18 00:23:28,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:28,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:28,370 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 153 states. [2020-07-18 00:23:28,370 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 153 states. [2020-07-18 00:23:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:28,379 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2020-07-18 00:23:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2020-07-18 00:23:28,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:28,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:28,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:23:28,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:23:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-18 00:23:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2020-07-18 00:23:28,385 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 22 [2020-07-18 00:23:28,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:23:28,386 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2020-07-18 00:23:28,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 00:23:28,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 91 transitions. [2020-07-18 00:23:28,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2020-07-18 00:23:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-18 00:23:28,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:28,535 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] [2020-07-18 00:23:28,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:23:28,536 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:28,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:28,536 INFO L82 PathProgramCache]: Analyzing trace with hash 807179936, now seen corresponding path program 1 times [2020-07-18 00:23:28,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:28,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [29207814] [2020-07-18 00:23:28,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:28,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {1608#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1592#true} is VALID [2020-07-18 00:23:28,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {1592#true} #valid := #valid[0 := 0]; {1592#true} is VALID [2020-07-18 00:23:28,786 INFO L280 TraceCheckUtils]: 2: Hoare triple {1592#true} assume 0 < #StackHeapBarrier; {1592#true} is VALID [2020-07-18 00:23:28,786 INFO L280 TraceCheckUtils]: 3: Hoare triple {1592#true} assume true; {1592#true} is VALID [2020-07-18 00:23:28,786 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1592#true} {1592#true} #187#return; {1592#true} is VALID [2020-07-18 00:23:28,789 INFO L263 TraceCheckUtils]: 0: Hoare triple {1592#true} call ULTIMATE.init(); {1608#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:28,789 INFO L280 TraceCheckUtils]: 1: Hoare triple {1608#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1592#true} is VALID [2020-07-18 00:23:28,790 INFO L280 TraceCheckUtils]: 2: Hoare triple {1592#true} #valid := #valid[0 := 0]; {1592#true} is VALID [2020-07-18 00:23:28,790 INFO L280 TraceCheckUtils]: 3: Hoare triple {1592#true} assume 0 < #StackHeapBarrier; {1592#true} is VALID [2020-07-18 00:23:28,790 INFO L280 TraceCheckUtils]: 4: Hoare triple {1592#true} assume true; {1592#true} is VALID [2020-07-18 00:23:28,790 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1592#true} {1592#true} #187#return; {1592#true} is VALID [2020-07-18 00:23:28,791 INFO L263 TraceCheckUtils]: 6: Hoare triple {1592#true} call #t~ret18 := main(); {1592#true} is VALID [2020-07-18 00:23:28,792 INFO L280 TraceCheckUtils]: 7: Hoare triple {1592#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {1599#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-18 00:23:28,793 INFO L280 TraceCheckUtils]: 8: Hoare triple {1599#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1600#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-18 00:23:28,793 INFO L280 TraceCheckUtils]: 9: Hoare triple {1600#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {1600#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-18 00:23:28,794 INFO L280 TraceCheckUtils]: 10: Hoare triple {1600#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {1600#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-18 00:23:28,794 INFO L280 TraceCheckUtils]: 11: Hoare triple {1600#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1601#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:23:28,795 INFO L280 TraceCheckUtils]: 12: Hoare triple {1601#(= 1 (select |#valid| main_~x~0.base))} ~state~0 := 1; {1601#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:23:28,795 INFO L280 TraceCheckUtils]: 13: Hoare triple {1601#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1601#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:23:28,796 INFO L280 TraceCheckUtils]: 14: Hoare triple {1601#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1); {1601#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:23:28,796 INFO L280 TraceCheckUtils]: 15: Hoare triple {1601#(= 1 (select |#valid| main_~x~0.base))} havoc #t~nondet1; {1601#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-18 00:23:28,802 INFO L280 TraceCheckUtils]: 16: Hoare triple {1601#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L997 {1602#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-18 00:23:28,803 INFO L280 TraceCheckUtils]: 17: Hoare triple {1602#(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: L997-1 {1603#(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:28,804 INFO L280 TraceCheckUtils]: 18: Hoare triple {1603#(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: L997-2 {1604#(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:28,804 INFO L280 TraceCheckUtils]: 19: Hoare triple {1604#(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: L998 {1605#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:23:28,805 INFO L280 TraceCheckUtils]: 20: Hoare triple {1605#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem3.base, #t~mem3.offset; {1605#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:23:28,806 INFO L280 TraceCheckUtils]: 21: Hoare triple {1605#(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: L999 {1606#(not (= 0 |main_#t~mem4.base|))} is VALID [2020-07-18 00:23:28,807 INFO L280 TraceCheckUtils]: 22: Hoare triple {1606#(not (= 0 |main_#t~mem4.base|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {1607#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:28,807 INFO L280 TraceCheckUtils]: 23: Hoare triple {1607#(not (= 0 main_~x~0.base))} havoc #t~mem4.base, #t~mem4.offset; {1607#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:28,808 INFO L280 TraceCheckUtils]: 24: Hoare triple {1607#(not (= 0 main_~x~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1000 {1607#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:28,808 INFO L280 TraceCheckUtils]: 25: Hoare triple {1607#(not (= 0 main_~x~0.base))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1607#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:28,808 INFO L280 TraceCheckUtils]: 26: Hoare triple {1607#(not (= 0 main_~x~0.base))} assume !(0 != #t~nondet5); {1607#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:28,809 INFO L280 TraceCheckUtils]: 27: Hoare triple {1607#(not (= 0 main_~x~0.base))} havoc #t~nondet5; {1607#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:28,810 INFO L280 TraceCheckUtils]: 28: Hoare triple {1607#(not (= 0 main_~x~0.base))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1002-3 {1607#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:28,819 INFO L280 TraceCheckUtils]: 29: Hoare triple {1607#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {1593#false} is VALID [2020-07-18 00:23:28,819 INFO L280 TraceCheckUtils]: 30: Hoare triple {1593#false} assume !false; {1593#false} is VALID [2020-07-18 00:23:28,822 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:28,822 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:28,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [29207814] [2020-07-18 00:23:28,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:28,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-18 00:23:28,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556668132] [2020-07-18 00:23:28,823 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-18 00:23:28,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:28,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-18 00:23:28,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:28,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-18 00:23:28,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:28,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-18 00:23:28,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:23:28,859 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 12 states. [2020-07-18 00:23:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:30,675 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2020-07-18 00:23:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 00:23:30,676 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-18 00:23:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:23:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:23:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2020-07-18 00:23:30,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:23:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2020-07-18 00:23:30,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 130 transitions. [2020-07-18 00:23:30,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:30,855 INFO L225 Difference]: With dead ends: 122 [2020-07-18 00:23:30,855 INFO L226 Difference]: Without dead ends: 120 [2020-07-18 00:23:30,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2020-07-18 00:23:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-18 00:23:31,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2020-07-18 00:23:31,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:23:31,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 105 states. [2020-07-18 00:23:31,256 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 105 states. [2020-07-18 00:23:31,256 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 105 states. [2020-07-18 00:23:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:31,265 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2020-07-18 00:23:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2020-07-18 00:23:31,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:31,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:31,270 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 120 states. [2020-07-18 00:23:31,270 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 120 states. [2020-07-18 00:23:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:31,281 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2020-07-18 00:23:31,281 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2020-07-18 00:23:31,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:31,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:31,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:23:31,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:23:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-18 00:23:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2020-07-18 00:23:31,288 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 31 [2020-07-18 00:23:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:23:31,288 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2020-07-18 00:23:31,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-18 00:23:31,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 105 states and 114 transitions. [2020-07-18 00:23:31,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2020-07-18 00:23:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-18 00:23:31,480 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:31,480 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] [2020-07-18 00:23:31,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:23:31,481 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:31,481 INFO L82 PathProgramCache]: Analyzing trace with hash -988969633, now seen corresponding path program 1 times [2020-07-18 00:23:31,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:31,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1778880951] [2020-07-18 00:23:31,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:31,574 INFO L280 TraceCheckUtils]: 0: Hoare triple {2329#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2321#true} is VALID [2020-07-18 00:23:31,574 INFO L280 TraceCheckUtils]: 1: Hoare triple {2321#true} #valid := #valid[0 := 0]; {2321#true} is VALID [2020-07-18 00:23:31,574 INFO L280 TraceCheckUtils]: 2: Hoare triple {2321#true} assume 0 < #StackHeapBarrier; {2321#true} is VALID [2020-07-18 00:23:31,575 INFO L280 TraceCheckUtils]: 3: Hoare triple {2321#true} assume true; {2321#true} is VALID [2020-07-18 00:23:31,575 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2321#true} {2321#true} #187#return; {2321#true} is VALID [2020-07-18 00:23:31,581 INFO L263 TraceCheckUtils]: 0: Hoare triple {2321#true} call ULTIMATE.init(); {2329#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:31,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {2329#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2321#true} is VALID [2020-07-18 00:23:31,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {2321#true} #valid := #valid[0 := 0]; {2321#true} is VALID [2020-07-18 00:23:31,582 INFO L280 TraceCheckUtils]: 3: Hoare triple {2321#true} assume 0 < #StackHeapBarrier; {2321#true} is VALID [2020-07-18 00:23:31,583 INFO L280 TraceCheckUtils]: 4: Hoare triple {2321#true} assume true; {2321#true} is VALID [2020-07-18 00:23:31,583 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2321#true} {2321#true} #187#return; {2321#true} is VALID [2020-07-18 00:23:31,583 INFO L263 TraceCheckUtils]: 6: Hoare triple {2321#true} call #t~ret18 := main(); {2321#true} is VALID [2020-07-18 00:23:31,584 INFO L280 TraceCheckUtils]: 7: Hoare triple {2321#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {2321#true} is VALID [2020-07-18 00:23:31,584 INFO L280 TraceCheckUtils]: 8: Hoare triple {2321#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {2321#true} is VALID [2020-07-18 00:23:31,585 INFO L280 TraceCheckUtils]: 9: Hoare triple {2321#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {2321#true} is VALID [2020-07-18 00:23:31,585 INFO L280 TraceCheckUtils]: 10: Hoare triple {2321#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {2321#true} is VALID [2020-07-18 00:23:31,586 INFO L280 TraceCheckUtils]: 11: Hoare triple {2321#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2321#true} is VALID [2020-07-18 00:23:31,597 INFO L280 TraceCheckUtils]: 12: Hoare triple {2321#true} ~state~0 := 1; {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,598 INFO L280 TraceCheckUtils]: 13: Hoare triple {2328#(= 1 main_~state~0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,599 INFO L280 TraceCheckUtils]: 14: Hoare triple {2328#(= 1 main_~state~0)} assume !!(0 != #t~nondet1); {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,599 INFO L280 TraceCheckUtils]: 15: Hoare triple {2328#(= 1 main_~state~0)} havoc #t~nondet1; {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,600 INFO L280 TraceCheckUtils]: 16: Hoare triple {2328#(= 1 main_~state~0)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L997 {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,601 INFO L280 TraceCheckUtils]: 17: Hoare triple {2328#(= 1 main_~state~0)} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L997-1 {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,610 INFO L280 TraceCheckUtils]: 18: Hoare triple {2328#(= 1 main_~state~0)} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L997-2 {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,611 INFO L280 TraceCheckUtils]: 19: Hoare triple {2328#(= 1 main_~state~0)} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L998 {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,611 INFO L280 TraceCheckUtils]: 20: Hoare triple {2328#(= 1 main_~state~0)} havoc #t~mem3.base, #t~mem3.offset; {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,612 INFO L280 TraceCheckUtils]: 21: Hoare triple {2328#(= 1 main_~state~0)} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L999 {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,612 INFO L280 TraceCheckUtils]: 22: Hoare triple {2328#(= 1 main_~state~0)} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,613 INFO L280 TraceCheckUtils]: 23: Hoare triple {2328#(= 1 main_~state~0)} havoc #t~mem4.base, #t~mem4.offset; {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,614 INFO L280 TraceCheckUtils]: 24: Hoare triple {2328#(= 1 main_~state~0)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1000 {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,614 INFO L280 TraceCheckUtils]: 25: Hoare triple {2328#(= 1 main_~state~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,615 INFO L280 TraceCheckUtils]: 26: Hoare triple {2328#(= 1 main_~state~0)} assume 0 != #t~nondet5; {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,616 INFO L280 TraceCheckUtils]: 27: Hoare triple {2328#(= 1 main_~state~0)} havoc #t~nondet5; {2328#(= 1 main_~state~0)} is VALID [2020-07-18 00:23:31,634 INFO L280 TraceCheckUtils]: 28: Hoare triple {2328#(= 1 main_~state~0)} assume !(1 == ~state~0); {2322#false} is VALID [2020-07-18 00:23:31,635 INFO L280 TraceCheckUtils]: 29: Hoare triple {2322#false} assume !(2 == ~state~0); {2322#false} is VALID [2020-07-18 00:23:31,635 INFO L280 TraceCheckUtils]: 30: Hoare triple {2322#false} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-5 {2322#false} is VALID [2020-07-18 00:23:31,636 INFO L280 TraceCheckUtils]: 31: Hoare triple {2322#false} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {2322#false} is VALID [2020-07-18 00:23:31,636 INFO L280 TraceCheckUtils]: 32: Hoare triple {2322#false} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset; {2322#false} is VALID [2020-07-18 00:23:31,636 INFO L280 TraceCheckUtils]: 33: Hoare triple {2322#false} havoc #t~mem6.base, #t~mem6.offset; {2322#false} is VALID [2020-07-18 00:23:31,636 INFO L280 TraceCheckUtils]: 34: Hoare triple {2322#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {2322#false} is VALID [2020-07-18 00:23:31,637 INFO L280 TraceCheckUtils]: 35: Hoare triple {2322#false} assume !false; {2322#false} is VALID [2020-07-18 00:23:31,639 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:31,640 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:31,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1778880951] [2020-07-18 00:23:31,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:31,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:23:31,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428884358] [2020-07-18 00:23:31,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-07-18 00:23:31,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:31,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:23:31,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:31,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:23:31,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:31,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:23:31,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:23:31,678 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 4 states. [2020-07-18 00:23:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:32,602 INFO L93 Difference]: Finished difference Result 234 states and 252 transitions. [2020-07-18 00:23:32,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:23:32,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-07-18 00:23:32,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:23:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:23:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2020-07-18 00:23:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:23:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2020-07-18 00:23:32,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 216 transitions. [2020-07-18 00:23:32,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:32,826 INFO L225 Difference]: With dead ends: 234 [2020-07-18 00:23:32,826 INFO L226 Difference]: Without dead ends: 166 [2020-07-18 00:23:32,827 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:23:32,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-18 00:23:33,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 125. [2020-07-18 00:23:33,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:23:33,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 125 states. [2020-07-18 00:23:33,369 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 125 states. [2020-07-18 00:23:33,370 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 125 states. [2020-07-18 00:23:33,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:33,376 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2020-07-18 00:23:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2020-07-18 00:23:33,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:33,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:33,377 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 166 states. [2020-07-18 00:23:33,377 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 166 states. [2020-07-18 00:23:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:33,383 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2020-07-18 00:23:33,383 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2020-07-18 00:23:33,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:33,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:33,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:23:33,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:23:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-07-18 00:23:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2020-07-18 00:23:33,388 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 36 [2020-07-18 00:23:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:23:33,389 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2020-07-18 00:23:33,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:23:33,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 125 states and 135 transitions. [2020-07-18 00:23:33,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2020-07-18 00:23:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-18 00:23:33,629 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:33,629 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] [2020-07-18 00:23:33,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:23:33,629 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:33,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:33,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1230029085, now seen corresponding path program 1 times [2020-07-18 00:23:33,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:33,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1768212573] [2020-07-18 00:23:33,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:34,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {3400#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3382#true} is VALID [2020-07-18 00:23:34,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {3382#true} #valid := #valid[0 := 0]; {3382#true} is VALID [2020-07-18 00:23:34,103 INFO L280 TraceCheckUtils]: 2: Hoare triple {3382#true} assume 0 < #StackHeapBarrier; {3382#true} is VALID [2020-07-18 00:23:34,103 INFO L280 TraceCheckUtils]: 3: Hoare triple {3382#true} assume true; {3382#true} is VALID [2020-07-18 00:23:34,104 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3382#true} {3382#true} #187#return; {3382#true} is VALID [2020-07-18 00:23:34,105 INFO L263 TraceCheckUtils]: 0: Hoare triple {3382#true} call ULTIMATE.init(); {3400#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:34,105 INFO L280 TraceCheckUtils]: 1: Hoare triple {3400#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3382#true} is VALID [2020-07-18 00:23:34,105 INFO L280 TraceCheckUtils]: 2: Hoare triple {3382#true} #valid := #valid[0 := 0]; {3382#true} is VALID [2020-07-18 00:23:34,105 INFO L280 TraceCheckUtils]: 3: Hoare triple {3382#true} assume 0 < #StackHeapBarrier; {3382#true} is VALID [2020-07-18 00:23:34,106 INFO L280 TraceCheckUtils]: 4: Hoare triple {3382#true} assume true; {3382#true} is VALID [2020-07-18 00:23:34,106 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3382#true} {3382#true} #187#return; {3382#true} is VALID [2020-07-18 00:23:34,106 INFO L263 TraceCheckUtils]: 6: Hoare triple {3382#true} call #t~ret18 := main(); {3382#true} is VALID [2020-07-18 00:23:34,107 INFO L280 TraceCheckUtils]: 7: Hoare triple {3382#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {3389#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-18 00:23:34,108 INFO L280 TraceCheckUtils]: 8: Hoare triple {3389#(= 0 |main_#t~malloc0.offset|)} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {3390#(= 0 main_~head~0.offset)} is VALID [2020-07-18 00:23:34,109 INFO L280 TraceCheckUtils]: 9: Hoare triple {3390#(= 0 main_~head~0.offset)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {3391#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-18 00:23:34,111 INFO L280 TraceCheckUtils]: 10: Hoare triple {3391#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {3391#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-18 00:23:34,112 INFO L280 TraceCheckUtils]: 11: Hoare triple {3391#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3392#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-18 00:23:34,113 INFO L280 TraceCheckUtils]: 12: Hoare triple {3392#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} ~state~0 := 1; {3392#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-18 00:23:34,114 INFO L280 TraceCheckUtils]: 13: Hoare triple {3392#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3392#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-18 00:23:34,115 INFO L280 TraceCheckUtils]: 14: Hoare triple {3392#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} assume !(0 != #t~nondet1); {3392#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-18 00:23:34,116 INFO L280 TraceCheckUtils]: 15: Hoare triple {3392#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} havoc #t~nondet1; {3392#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-18 00:23:34,118 INFO L280 TraceCheckUtils]: 16: Hoare triple {3392#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-5 {3391#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-18 00:23:34,119 INFO L280 TraceCheckUtils]: 17: Hoare triple {3391#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {3393#(and (= 0 |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) |main_#t~mem6.offset|) 0))} is VALID [2020-07-18 00:23:34,122 INFO L280 TraceCheckUtils]: 18: Hoare triple {3393#(and (= 0 |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) |main_#t~mem6.offset|) 0))} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset; {3394#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:23:34,125 INFO L280 TraceCheckUtils]: 19: Hoare triple {3394#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem6.base, #t~mem6.offset; {3394#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:23:34,126 INFO L280 TraceCheckUtils]: 20: Hoare triple {3394#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {3394#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:23:34,127 INFO L280 TraceCheckUtils]: 21: Hoare triple {3394#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} goto; {3394#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:23:34,128 INFO L280 TraceCheckUtils]: 22: Hoare triple {3394#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-4 {3395#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem7|) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:23:34,128 INFO L280 TraceCheckUtils]: 23: Hoare triple {3395#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem7|) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume !!(0 != #t~mem7); {3396#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:23:34,129 INFO L280 TraceCheckUtils]: 24: Hoare triple {3396#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem7; {3396#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:23:34,130 INFO L280 TraceCheckUtils]: 25: Hoare triple {3396#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1023-25 {3397#(not (= 0 (select (select |#memory_int| |main_#t~mem8.base|) (+ |main_#t~mem8.offset| 8))))} is VALID [2020-07-18 00:23:34,132 INFO L280 TraceCheckUtils]: 26: Hoare triple {3397#(not (= 0 (select (select |#memory_int| |main_#t~mem8.base|) (+ |main_#t~mem8.offset| 8))))} SUMMARY for call #t~mem9 := read~int(#t~mem8.base, 8 + #t~mem8.offset, 4); srcloc: L1023-1 {3398#(not (= 0 |main_#t~mem9|))} is VALID [2020-07-18 00:23:34,134 INFO L280 TraceCheckUtils]: 27: Hoare triple {3398#(not (= 0 |main_#t~mem9|))} #t~short13 := 0 != #t~mem9; {3399#|main_#t~short13|} is VALID [2020-07-18 00:23:34,135 INFO L280 TraceCheckUtils]: 28: Hoare triple {3399#|main_#t~short13|} assume !#t~short13; {3383#false} is VALID [2020-07-18 00:23:34,136 INFO L280 TraceCheckUtils]: 29: Hoare triple {3383#false} assume !#t~short13; {3383#false} is VALID [2020-07-18 00:23:34,136 INFO L280 TraceCheckUtils]: 30: Hoare triple {3383#false} havoc #t~mem12; {3383#false} is VALID [2020-07-18 00:23:34,136 INFO L280 TraceCheckUtils]: 31: Hoare triple {3383#false} havoc #t~mem9; {3383#false} is VALID [2020-07-18 00:23:34,137 INFO L280 TraceCheckUtils]: 32: Hoare triple {3383#false} havoc #t~mem11; {3383#false} is VALID [2020-07-18 00:23:34,137 INFO L280 TraceCheckUtils]: 33: Hoare triple {3383#false} havoc #t~mem8.base, #t~mem8.offset; {3383#false} is VALID [2020-07-18 00:23:34,137 INFO L280 TraceCheckUtils]: 34: Hoare triple {3383#false} havoc #t~short13; {3383#false} is VALID [2020-07-18 00:23:34,138 INFO L280 TraceCheckUtils]: 35: Hoare triple {3383#false} havoc #t~mem10.base, #t~mem10.offset; {3383#false} is VALID [2020-07-18 00:23:34,138 INFO L280 TraceCheckUtils]: 36: Hoare triple {3383#false} assume !false; {3383#false} is VALID [2020-07-18 00:23:34,142 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:34,143 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:34,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1768212573] [2020-07-18 00:23:34,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:34,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-18 00:23:34,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364733125] [2020-07-18 00:23:34,144 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2020-07-18 00:23:34,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:34,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 00:23:34,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:34,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 00:23:34,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:34,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 00:23:34,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-18 00:23:34,193 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 14 states. [2020-07-18 00:23:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:37,107 INFO L93 Difference]: Finished difference Result 215 states and 228 transitions. [2020-07-18 00:23:37,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-18 00:23:37,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2020-07-18 00:23:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:23:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:23:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 187 transitions. [2020-07-18 00:23:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:23:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 187 transitions. [2020-07-18 00:23:37,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 187 transitions. [2020-07-18 00:23:37,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:37,371 INFO L225 Difference]: With dead ends: 215 [2020-07-18 00:23:37,372 INFO L226 Difference]: Without dead ends: 185 [2020-07-18 00:23:37,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2020-07-18 00:23:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-18 00:23:37,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 133. [2020-07-18 00:23:37,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:23:37,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 133 states. [2020-07-18 00:23:37,997 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 133 states. [2020-07-18 00:23:37,997 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 133 states. [2020-07-18 00:23:38,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:38,004 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2020-07-18 00:23:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2020-07-18 00:23:38,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:38,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:38,005 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 185 states. [2020-07-18 00:23:38,005 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 185 states. [2020-07-18 00:23:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:38,012 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2020-07-18 00:23:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2020-07-18 00:23:38,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:38,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:38,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:23:38,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:23:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-07-18 00:23:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2020-07-18 00:23:38,018 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 37 [2020-07-18 00:23:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:23:38,018 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2020-07-18 00:23:38,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 00:23:38,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 133 states and 143 transitions. [2020-07-18 00:23:38,295 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:23:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2020-07-18 00:23:38,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-18 00:23:38,297 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:38,297 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:23:38,297 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:23:38,298 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:38,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:38,298 INFO L82 PathProgramCache]: Analyzing trace with hash 626563183, now seen corresponding path program 1 times [2020-07-18 00:23:38,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:38,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2007133610] [2020-07-18 00:23:38,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:38,762 INFO L280 TraceCheckUtils]: 0: Hoare triple {4520#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4501#true} is VALID [2020-07-18 00:23:38,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {4501#true} #valid := #valid[0 := 0]; {4501#true} is VALID [2020-07-18 00:23:38,763 INFO L280 TraceCheckUtils]: 2: Hoare triple {4501#true} assume 0 < #StackHeapBarrier; {4501#true} is VALID [2020-07-18 00:23:38,763 INFO L280 TraceCheckUtils]: 3: Hoare triple {4501#true} assume true; {4501#true} is VALID [2020-07-18 00:23:38,763 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4501#true} {4501#true} #187#return; {4501#true} is VALID [2020-07-18 00:23:38,764 INFO L263 TraceCheckUtils]: 0: Hoare triple {4501#true} call ULTIMATE.init(); {4520#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:38,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {4520#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4501#true} is VALID [2020-07-18 00:23:38,764 INFO L280 TraceCheckUtils]: 2: Hoare triple {4501#true} #valid := #valid[0 := 0]; {4501#true} is VALID [2020-07-18 00:23:38,764 INFO L280 TraceCheckUtils]: 3: Hoare triple {4501#true} assume 0 < #StackHeapBarrier; {4501#true} is VALID [2020-07-18 00:23:38,765 INFO L280 TraceCheckUtils]: 4: Hoare triple {4501#true} assume true; {4501#true} is VALID [2020-07-18 00:23:38,765 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4501#true} {4501#true} #187#return; {4501#true} is VALID [2020-07-18 00:23:38,765 INFO L263 TraceCheckUtils]: 6: Hoare triple {4501#true} call #t~ret18 := main(); {4501#true} is VALID [2020-07-18 00:23:38,767 INFO L280 TraceCheckUtils]: 7: Hoare triple {4501#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {4508#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-18 00:23:38,767 INFO L280 TraceCheckUtils]: 8: Hoare triple {4508#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {4509#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-18 00:23:38,768 INFO L280 TraceCheckUtils]: 9: Hoare triple {4509#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {4509#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-18 00:23:38,769 INFO L280 TraceCheckUtils]: 10: Hoare triple {4509#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {4509#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-18 00:23:38,770 INFO L280 TraceCheckUtils]: 11: Hoare triple {4509#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {4510#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} is VALID [2020-07-18 00:23:38,771 INFO L280 TraceCheckUtils]: 12: Hoare triple {4510#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} ~state~0 := 1; {4510#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} is VALID [2020-07-18 00:23:38,771 INFO L280 TraceCheckUtils]: 13: Hoare triple {4510#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4510#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} is VALID [2020-07-18 00:23:38,772 INFO L280 TraceCheckUtils]: 14: Hoare triple {4510#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} assume !!(0 != #t~nondet1); {4510#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} is VALID [2020-07-18 00:23:38,772 INFO L280 TraceCheckUtils]: 15: Hoare triple {4510#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} havoc #t~nondet1; {4510#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} is VALID [2020-07-18 00:23:38,776 INFO L280 TraceCheckUtils]: 16: Hoare triple {4510#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L997 {4511#(and (= 0 |main_#t~malloc2.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-18 00:23:38,777 INFO L280 TraceCheckUtils]: 17: Hoare triple {4511#(and (= 0 |main_#t~malloc2.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.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: L997-1 {4512#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| 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:38,778 INFO L280 TraceCheckUtils]: 18: Hoare triple {4512#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| 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: L997-2 {4513#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem3.base|) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 00:23:38,779 INFO L280 TraceCheckUtils]: 19: Hoare triple {4513#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem3.base|) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| 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: L998 {4512#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| 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:38,780 INFO L280 TraceCheckUtils]: 20: Hoare triple {4512#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| 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)))} havoc #t~mem3.base, #t~mem3.offset; {4512#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| 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:38,781 INFO L280 TraceCheckUtils]: 21: Hoare triple {4512#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| 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~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L999 {4514#(and (not (= |main_#t~mem4.base| main_~head~0.base)) (= 0 |main_#t~mem4.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem4.base|))} is VALID [2020-07-18 00:23:38,782 INFO L280 TraceCheckUtils]: 22: Hoare triple {4514#(and (not (= |main_#t~mem4.base| main_~head~0.base)) (= 0 |main_#t~mem4.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem4.base|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {4515#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} is VALID [2020-07-18 00:23:38,783 INFO L280 TraceCheckUtils]: 23: Hoare triple {4515#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} havoc #t~mem4.base, #t~mem4.offset; {4515#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} is VALID [2020-07-18 00:23:38,784 INFO L280 TraceCheckUtils]: 24: Hoare triple {4515#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1000 {4515#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} is VALID [2020-07-18 00:23:38,785 INFO L280 TraceCheckUtils]: 25: Hoare triple {4515#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4515#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} is VALID [2020-07-18 00:23:38,785 INFO L280 TraceCheckUtils]: 26: Hoare triple {4515#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} assume !(0 != #t~nondet5); {4515#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} is VALID [2020-07-18 00:23:38,791 INFO L280 TraceCheckUtils]: 27: Hoare triple {4515#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} havoc #t~nondet5; {4515#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} is VALID [2020-07-18 00:23:38,792 INFO L280 TraceCheckUtils]: 28: Hoare triple {4515#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1002-3 {4515#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} is VALID [2020-07-18 00:23:38,792 INFO L280 TraceCheckUtils]: 29: Hoare triple {4515#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {4516#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} is VALID [2020-07-18 00:23:38,793 INFO L280 TraceCheckUtils]: 30: Hoare triple {4516#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} goto; {4516#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} is VALID [2020-07-18 00:23:38,794 INFO L280 TraceCheckUtils]: 31: Hoare triple {4516#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4516#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} is VALID [2020-07-18 00:23:38,794 INFO L280 TraceCheckUtils]: 32: Hoare triple {4516#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} assume !(0 != #t~nondet1); {4516#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} is VALID [2020-07-18 00:23:38,795 INFO L280 TraceCheckUtils]: 33: Hoare triple {4516#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} havoc #t~nondet1; {4516#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} is VALID [2020-07-18 00:23:38,795 INFO L280 TraceCheckUtils]: 34: Hoare triple {4516#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-5 {4517#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-18 00:23:38,796 INFO L280 TraceCheckUtils]: 35: Hoare triple {4517#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {4518#(not (= 0 |main_#t~mem6.base|))} is VALID [2020-07-18 00:23:38,797 INFO L280 TraceCheckUtils]: 36: Hoare triple {4518#(not (= 0 |main_#t~mem6.base|))} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset; {4519#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:38,797 INFO L280 TraceCheckUtils]: 37: Hoare triple {4519#(not (= 0 main_~x~0.base))} havoc #t~mem6.base, #t~mem6.offset; {4519#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 00:23:38,797 INFO L280 TraceCheckUtils]: 38: Hoare triple {4519#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {4502#false} is VALID [2020-07-18 00:23:38,798 INFO L280 TraceCheckUtils]: 39: Hoare triple {4502#false} assume !false; {4502#false} is VALID [2020-07-18 00:23:38,802 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:38,803 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:38,803 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2007133610] [2020-07-18 00:23:38,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:38,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-18 00:23:38,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680497777] [2020-07-18 00:23:38,804 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2020-07-18 00:23:38,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:38,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 00:23:38,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:38,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 00:23:38,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:38,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 00:23:38,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2020-07-18 00:23:38,867 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 15 states. [2020-07-18 00:23:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:42,667 INFO L93 Difference]: Finished difference Result 227 states and 241 transitions. [2020-07-18 00:23:42,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-18 00:23:42,667 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2020-07-18 00:23:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:23:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:23:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 192 transitions. [2020-07-18 00:23:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:23:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 192 transitions. [2020-07-18 00:23:42,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 192 transitions. [2020-07-18 00:23:42,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:42,917 INFO L225 Difference]: With dead ends: 227 [2020-07-18 00:23:42,917 INFO L226 Difference]: Without dead ends: 225 [2020-07-18 00:23:42,918 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2020-07-18 00:23:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-07-18 00:23:43,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 145. [2020-07-18 00:23:43,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:23:43,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand 145 states. [2020-07-18 00:23:43,659 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 145 states. [2020-07-18 00:23:43,659 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 145 states. [2020-07-18 00:23:43,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:43,667 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2020-07-18 00:23:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 239 transitions. [2020-07-18 00:23:43,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:43,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:43,669 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 225 states. [2020-07-18 00:23:43,669 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 225 states. [2020-07-18 00:23:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:43,676 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2020-07-18 00:23:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 239 transitions. [2020-07-18 00:23:43,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:43,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:43,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:23:43,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:23:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-07-18 00:23:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2020-07-18 00:23:43,682 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 40 [2020-07-18 00:23:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:23:43,683 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2020-07-18 00:23:43,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 00:23:43,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 145 states and 157 transitions. [2020-07-18 00:23:44,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2020-07-18 00:23:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-18 00:23:44,020 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:44,020 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] [2020-07-18 00:23:44,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:23:44,021 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:44,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1667005657, now seen corresponding path program 1 times [2020-07-18 00:23:44,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:44,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1158403193] [2020-07-18 00:23:44,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 00:23:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 00:23:44,106 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:44,106 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 00:23:44,107 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 00:23:44,107 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:23:44,125 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-18 00:23:44,126 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 00:23:44,126 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 00:23:44,126 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 00:23:44,126 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 00:23:44,126 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 00:23:44,126 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 00:23:44,127 WARN L170 areAnnotationChecker]: L986 has no Hoare annotation [2020-07-18 00:23:44,127 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-18 00:23:44,127 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 00:23:44,127 WARN L170 areAnnotationChecker]: L987 has no Hoare annotation [2020-07-18 00:23:44,127 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 00:23:44,127 WARN L170 areAnnotationChecker]: L987-1 has no Hoare annotation [2020-07-18 00:23:44,127 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 00:23:44,127 WARN L170 areAnnotationChecker]: L988 has no Hoare annotation [2020-07-18 00:23:44,127 WARN L170 areAnnotationChecker]: L991 has no Hoare annotation [2020-07-18 00:23:44,128 WARN L170 areAnnotationChecker]: L1014-4 has no Hoare annotation [2020-07-18 00:23:44,128 WARN L170 areAnnotationChecker]: L1014-4 has no Hoare annotation [2020-07-18 00:23:44,128 WARN L170 areAnnotationChecker]: L994-5 has no Hoare annotation [2020-07-18 00:23:44,128 WARN L170 areAnnotationChecker]: L994-1 has no Hoare annotation [2020-07-18 00:23:44,128 WARN L170 areAnnotationChecker]: L994-1 has no Hoare annotation [2020-07-18 00:23:44,128 WARN L170 areAnnotationChecker]: L1016 has no Hoare annotation [2020-07-18 00:23:44,128 WARN L170 areAnnotationChecker]: L994-2 has no Hoare annotation [2020-07-18 00:23:44,128 WARN L170 areAnnotationChecker]: L994-4 has no Hoare annotation [2020-07-18 00:23:44,128 WARN L170 areAnnotationChecker]: L1018 has no Hoare annotation [2020-07-18 00:23:44,129 WARN L170 areAnnotationChecker]: L997 has no Hoare annotation [2020-07-18 00:23:44,129 WARN L170 areAnnotationChecker]: L1018-1 has no Hoare annotation [2020-07-18 00:23:44,129 WARN L170 areAnnotationChecker]: L997-1 has no Hoare annotation [2020-07-18 00:23:44,129 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-18 00:23:44,129 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-18 00:23:44,129 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-18 00:23:44,129 WARN L170 areAnnotationChecker]: L997-2 has no Hoare annotation [2020-07-18 00:23:44,129 WARN L170 areAnnotationChecker]: L1021-4 has no Hoare annotation [2020-07-18 00:23:44,130 WARN L170 areAnnotationChecker]: L1021-4 has no Hoare annotation [2020-07-18 00:23:44,130 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2020-07-18 00:23:44,130 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2020-07-18 00:23:44,130 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2020-07-18 00:23:44,130 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2020-07-18 00:23:44,130 WARN L170 areAnnotationChecker]: L998 has no Hoare annotation [2020-07-18 00:23:44,130 WARN L170 areAnnotationChecker]: L1021-5 has no Hoare annotation [2020-07-18 00:23:44,130 WARN L170 areAnnotationChecker]: L1021 has no Hoare annotation [2020-07-18 00:23:44,130 WARN L170 areAnnotationChecker]: L1021 has no Hoare annotation [2020-07-18 00:23:44,131 WARN L170 areAnnotationChecker]: L998-1 has no Hoare annotation [2020-07-18 00:23:44,131 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-18 00:23:44,131 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-18 00:23:44,131 WARN L170 areAnnotationChecker]: L1021-3 has no Hoare annotation [2020-07-18 00:23:44,131 WARN L170 areAnnotationChecker]: L999 has no Hoare annotation [2020-07-18 00:23:44,131 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2020-07-18 00:23:44,131 WARN L170 areAnnotationChecker]: L1023-25 has no Hoare annotation [2020-07-18 00:23:44,131 WARN L170 areAnnotationChecker]: L1023-25 has no Hoare annotation [2020-07-18 00:23:44,131 WARN L170 areAnnotationChecker]: L999-1 has no Hoare annotation [2020-07-18 00:23:44,132 WARN L170 areAnnotationChecker]: L1033-1 has no Hoare annotation [2020-07-18 00:23:44,132 WARN L170 areAnnotationChecker]: L1033-1 has no Hoare annotation [2020-07-18 00:23:44,132 WARN L170 areAnnotationChecker]: L1023-1 has no Hoare annotation [2020-07-18 00:23:44,132 WARN L170 areAnnotationChecker]: L1023-26 has no Hoare annotation [2020-07-18 00:23:44,132 WARN L170 areAnnotationChecker]: L999-2 has no Hoare annotation [2020-07-18 00:23:44,132 WARN L170 areAnnotationChecker]: L1029-5 has no Hoare annotation [2020-07-18 00:23:44,132 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-18 00:23:44,132 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-18 00:23:44,133 WARN L170 areAnnotationChecker]: L1023-2 has no Hoare annotation [2020-07-18 00:23:44,133 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-18 00:23:44,133 WARN L170 areAnnotationChecker]: L1000 has no Hoare annotation [2020-07-18 00:23:44,133 WARN L170 areAnnotationChecker]: L1035 has no Hoare annotation [2020-07-18 00:23:44,133 WARN L170 areAnnotationChecker]: L1029-2 has no Hoare annotation [2020-07-18 00:23:44,133 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-18 00:23:44,133 WARN L170 areAnnotationChecker]: L1023-3 has no Hoare annotation [2020-07-18 00:23:44,133 WARN L170 areAnnotationChecker]: L1023-3 has no Hoare annotation [2020-07-18 00:23:44,133 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2020-07-18 00:23:44,133 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-18 00:23:44,134 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 00:23:44,134 WARN L170 areAnnotationChecker]: L1031 has no Hoare annotation [2020-07-18 00:23:44,134 WARN L170 areAnnotationChecker]: L1023-4 has no Hoare annotation [2020-07-18 00:23:44,134 WARN L170 areAnnotationChecker]: L1023-9 has no Hoare annotation [2020-07-18 00:23:44,134 WARN L170 areAnnotationChecker]: L1023-9 has no Hoare annotation [2020-07-18 00:23:44,134 WARN L170 areAnnotationChecker]: L1002 has no Hoare annotation [2020-07-18 00:23:44,134 WARN L170 areAnnotationChecker]: L1002 has no Hoare annotation [2020-07-18 00:23:44,134 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 00:23:44,135 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-18 00:23:44,135 WARN L170 areAnnotationChecker]: L1023-5 has no Hoare annotation [2020-07-18 00:23:44,135 WARN L170 areAnnotationChecker]: L1023-10 has no Hoare annotation [2020-07-18 00:23:44,135 WARN L170 areAnnotationChecker]: L1023-18 has no Hoare annotation [2020-07-18 00:23:44,135 WARN L170 areAnnotationChecker]: L1002-1 has no Hoare annotation [2020-07-18 00:23:44,135 WARN L170 areAnnotationChecker]: L1002-2 has no Hoare annotation [2020-07-18 00:23:44,135 WARN L170 areAnnotationChecker]: L1032-1 has no Hoare annotation [2020-07-18 00:23:44,135 WARN L170 areAnnotationChecker]: L1023-6 has no Hoare annotation [2020-07-18 00:23:44,136 WARN L170 areAnnotationChecker]: L1023-11 has no Hoare annotation [2020-07-18 00:23:44,136 WARN L170 areAnnotationChecker]: L1023-19 has no Hoare annotation [2020-07-18 00:23:44,136 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-18 00:23:44,136 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-18 00:23:44,136 WARN L170 areAnnotationChecker]: L1002-3 has no Hoare annotation [2020-07-18 00:23:44,136 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-18 00:23:44,136 WARN L170 areAnnotationChecker]: L1023-7 has no Hoare annotation [2020-07-18 00:23:44,136 WARN L170 areAnnotationChecker]: L1023-12 has no Hoare annotation [2020-07-18 00:23:44,136 WARN L170 areAnnotationChecker]: L1023-20 has no Hoare annotation [2020-07-18 00:23:44,136 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2020-07-18 00:23:44,137 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2020-07-18 00:23:44,137 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2020-07-18 00:23:44,137 WARN L170 areAnnotationChecker]: L1014-3 has no Hoare annotation [2020-07-18 00:23:44,137 WARN L170 areAnnotationChecker]: L1014-3 has no Hoare annotation [2020-07-18 00:23:44,137 WARN L170 areAnnotationChecker]: L1014-3 has no Hoare annotation [2020-07-18 00:23:44,137 WARN L170 areAnnotationChecker]: L1033 has no Hoare annotation [2020-07-18 00:23:44,137 WARN L170 areAnnotationChecker]: L1023-13 has no Hoare annotation [2020-07-18 00:23:44,137 WARN L170 areAnnotationChecker]: L1023-21 has no Hoare annotation [2020-07-18 00:23:44,137 WARN L170 areAnnotationChecker]: L1007 has no Hoare annotation [2020-07-18 00:23:44,138 WARN L170 areAnnotationChecker]: L1014 has no Hoare annotation [2020-07-18 00:23:44,138 WARN L170 areAnnotationChecker]: L1014 has no Hoare annotation [2020-07-18 00:23:44,138 WARN L170 areAnnotationChecker]: L1014-2 has no Hoare annotation [2020-07-18 00:23:44,138 WARN L170 areAnnotationChecker]: L1014-2 has no Hoare annotation [2020-07-18 00:23:44,138 WARN L170 areAnnotationChecker]: L1023-14 has no Hoare annotation [2020-07-18 00:23:44,138 WARN L170 areAnnotationChecker]: L1023-22 has no Hoare annotation [2020-07-18 00:23:44,138 WARN L170 areAnnotationChecker]: L1023-15 has no Hoare annotation [2020-07-18 00:23:44,138 WARN L170 areAnnotationChecker]: L1023-23 has no Hoare annotation [2020-07-18 00:23:44,138 WARN L170 areAnnotationChecker]: L1023-16 has no Hoare annotation [2020-07-18 00:23:44,138 WARN L170 areAnnotationChecker]: L1023-16 has no Hoare annotation [2020-07-18 00:23:44,139 WARN L170 areAnnotationChecker]: L1023-24 has no Hoare annotation [2020-07-18 00:23:44,139 WARN L170 areAnnotationChecker]: L1023-24 has no Hoare annotation [2020-07-18 00:23:44,139 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:23:44,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:23:44 BoogieIcfgContainer [2020-07-18 00:23:44,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:23:44,146 INFO L168 Benchmark]: Toolchain (without parser) took 21604.05 ms. Allocated memory was 137.4 MB in the beginning and 458.8 MB in the end (delta: 321.4 MB). Free memory was 101.3 MB in the beginning and 311.7 MB in the end (delta: -210.5 MB). Peak memory consumption was 110.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:23:44,147 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.5 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:23:44,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 668.43 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.8 MB in the beginning and 168.6 MB in the end (delta: -67.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:23:44,148 INFO L168 Benchmark]: Boogie Preprocessor took 78.10 ms. Allocated memory is still 202.4 MB. Free memory was 168.6 MB in the beginning and 164.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:23:44,149 INFO L168 Benchmark]: RCFGBuilder took 791.05 ms. Allocated memory is still 202.4 MB. Free memory was 164.4 MB in the beginning and 100.3 MB in the end (delta: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:23:44,150 INFO L168 Benchmark]: TraceAbstraction took 20058.40 ms. Allocated memory was 202.4 MB in the beginning and 458.8 MB in the end (delta: 256.4 MB). Free memory was 99.6 MB in the beginning and 311.7 MB in the end (delta: -212.1 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:23:44,153 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 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 668.43 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.8 MB in the beginning and 168.6 MB in the end (delta: -67.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.10 ms. Allocated memory is still 202.4 MB. Free memory was 168.6 MB in the beginning and 164.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.05 ms. Allocated memory is still 202.4 MB. Free memory was 164.4 MB in the beginning and 100.3 MB in the end (delta: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20058.40 ms. Allocated memory was 202.4 MB in the beginning and 458.8 MB in the end (delta: 256.4 MB). Free memory was 99.6 MB in the beginning and 311.7 MB in the end (delta: -212.1 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1023]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L986] SLL* head = malloc(sizeof(SLL)); [L987] head->next = head [L988] head->data = 0 [L990] SLL* x = head; [L991] int state = 1; [L994] COND FALSE !(__VERIFIER_nondet_int()) [L1016] x->data = state [L1018] EXPR head->next [L1018] x = head->next [L1019] COND FALSE !(!(((void*)0) != x)) [L1021] EXPR x->data [L1021] COND TRUE x->data != 0 [L1023] EXPR x->next [L1023] EXPR x->next->data [L1023] EXPR x->next->data != 0 && x->data > x->next->data [L1023] EXPR x->data [L1023] EXPR x->next [L1023] EXPR x->next->data [L1023] EXPR x->next->data != 0 && x->data > x->next->data [L1023] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1023] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 96 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.9s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 479 SDtfs, 1422 SDslu, 2129 SDs, 0 SdLazy, 1458 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 6 MinimizatonAttempts, 256 StatesRemovedByMinimization, 5 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...