/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-8fc6572 [2020-07-10 19:03:48,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:03:48,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:03:48,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:03:48,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:03:48,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:03:48,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:03:48,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:03:48,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:03:48,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:03:48,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:03:48,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:03:48,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:03:48,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:03:48,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:03:48,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:03:48,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:03:48,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:03:48,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:03:48,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:03:48,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:03:48,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:03:48,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:03:48,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:03:48,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:03:48,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:03:48,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:03:48,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:03:48,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:03:48,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:03:48,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:03:48,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:03:48,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:03:48,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:03:48,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:03:48,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:03:48,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:03:48,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:03:48,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:03:48,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:03:48,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:03:48,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 19:03:48,228 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:03:48,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:03:48,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:03:48,233 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:03:48,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:03:48,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:03:48,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:03:48,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:03:48,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:03:48,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:03:48,235 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:03:48,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:03:48,237 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:03:48,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:03:48,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:03:48,238 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:03:48,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:03:48,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:03:48,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:03:48,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:03:48,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:03:48,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:03:48,239 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:03:48,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:03:48,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:03:48,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:03:48,566 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:03:48,567 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:03:48,568 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-10 19:03:48,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aea7e78e5/2ea85e5e42f2464e92c9ba5af7dd4ad5/FLAG05610e311 [2020-07-10 19:03:49,177 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:03:49,178 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-1.i [2020-07-10 19:03:49,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aea7e78e5/2ea85e5e42f2464e92c9ba5af7dd4ad5/FLAG05610e311 [2020-07-10 19:03:49,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aea7e78e5/2ea85e5e42f2464e92c9ba5af7dd4ad5 [2020-07-10 19:03:49,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:03:49,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:03:49,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:03:49,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:03:49,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:03:49,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:03:49" (1/1) ... [2020-07-10 19:03:49,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153d0f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:49, skipping insertion in model container [2020-07-10 19:03:49,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:03:49" (1/1) ... [2020-07-10 19:03:49,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:03:49,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:03:49,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:03:50,008 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:03:50,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:03:50,159 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:03:50,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:50 WrapperNode [2020-07-10 19:03:50,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:03:50,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:03:50,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:03:50,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:03:50,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:50" (1/1) ... [2020-07-10 19:03:50,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:50" (1/1) ... [2020-07-10 19:03:50,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:50" (1/1) ... [2020-07-10 19:03:50,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:50" (1/1) ... [2020-07-10 19:03:50,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:50" (1/1) ... [2020-07-10 19:03:50,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:50" (1/1) ... [2020-07-10 19:03:50,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:50" (1/1) ... [2020-07-10 19:03:50,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:03:50,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:03:50,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:03:50,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:03:50,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:50" (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-10 19:03:50,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:03:50,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:03:50,298 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:03:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 19:03:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 19:03:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 19:03:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 19:03:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 19:03:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 19:03:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 19:03:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 19:03:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 19:03:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 19:03:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 19:03:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 19:03:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 19:03:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 19:03:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 19:03:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 19:03:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 19:03:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 19:03:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 19:03:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 19:03:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 19:03:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 19:03:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 19:03:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 19:03:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 19:03:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 19:03:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 19:03:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 19:03:50,306 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 19:03:50,306 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 19:03:50,306 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 19:03:50,306 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 19:03:50,306 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 19:03:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 19:03:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 19:03:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 19:03:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 19:03:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 19:03:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 19:03:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 19:03:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 19:03:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 19:03:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 19:03:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 19:03:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 19:03:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 19:03:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 19:03:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 19:03:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 19:03:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 19:03:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 19:03:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 19:03:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 19:03:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 19:03:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 19:03:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 19:03:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 19:03:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 19:03:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 19:03:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 19:03:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 19:03:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 19:03:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 19:03:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 19:03:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 19:03:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 19:03:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 19:03:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 19:03:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 19:03:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 19:03:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 19:03:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 19:03:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 19:03:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 19:03:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 19:03:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 19:03:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 19:03:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 19:03:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 19:03:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 19:03:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 19:03:50,315 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 19:03:50,315 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 19:03:50,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 19:03:50,315 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 19:03:50,315 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 19:03:50,315 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 19:03:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 19:03:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 19:03:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 19:03:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 19:03:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 19:03:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 19:03:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 19:03:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 19:03:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 19:03:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 19:03:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 19:03:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 19:03:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 19:03:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 19:03:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 19:03:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 19:03:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 19:03:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:03:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:03:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 19:03:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 19:03:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 19:03:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 19:03:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 19:03:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:03:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:03:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:03:51,113 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:03:51,113 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-10 19:03:51,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:03:51 BoogieIcfgContainer [2020-07-10 19:03:51,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:03:51,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:03:51,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:03:51,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:03:51,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:03:49" (1/3) ... [2020-07-10 19:03:51,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66953506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:03:51, skipping insertion in model container [2020-07-10 19:03:51,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:50" (2/3) ... [2020-07-10 19:03:51,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66953506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:03:51, skipping insertion in model container [2020-07-10 19:03:51,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:03:51" (3/3) ... [2020-07-10 19:03:51,127 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2020-07-10 19:03:51,138 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:03:51,147 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-07-10 19:03:51,162 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-10 19:03:51,186 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:03:51,186 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:03:51,187 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:03:51,187 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:03:51,187 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:03:51,187 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:03:51,188 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:03:51,188 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:03:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2020-07-10 19:03:51,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 19:03:51,217 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:03:51,219 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-10 19:03:51,219 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:03:51,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:03:51,226 INFO L82 PathProgramCache]: Analyzing trace with hash -740897811, now seen corresponding path program 1 times [2020-07-10 19:03:51,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:03:51,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1189127725] [2020-07-10 19:03:51,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:03:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:03:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:03:51,484 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-10 19:03:51,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {99#true} #valid := #valid[0 := 0]; {99#true} is VALID [2020-07-10 19:03:51,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {99#true} assume 0 < #StackHeapBarrier; {99#true} is VALID [2020-07-10 19:03:51,485 INFO L280 TraceCheckUtils]: 3: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-10 19:03:51,486 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {99#true} {99#true} #187#return; {99#true} is VALID [2020-07-10 19:03:51,490 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-10 19:03:51,490 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-10 19:03:51,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {99#true} #valid := #valid[0 := 0]; {99#true} is VALID [2020-07-10 19:03:51,491 INFO L280 TraceCheckUtils]: 3: Hoare triple {99#true} assume 0 < #StackHeapBarrier; {99#true} is VALID [2020-07-10 19:03:51,491 INFO L280 TraceCheckUtils]: 4: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-10 19:03:51,492 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {99#true} {99#true} #187#return; {99#true} is VALID [2020-07-10 19:03:51,492 INFO L263 TraceCheckUtils]: 6: Hoare triple {99#true} call #t~ret18 := main(); {99#true} is VALID [2020-07-10 19:03:51,492 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-10 19:03:51,493 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-10 19:03:51,493 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-10 19:03:51,493 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-10 19:03:51,494 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-10 19:03:51,494 INFO L280 TraceCheckUtils]: 12: Hoare triple {99#true} ~state~0 := 1; {99#true} is VALID [2020-07-10 19:03:51,495 INFO L280 TraceCheckUtils]: 13: Hoare triple {99#true} assume !true; {100#false} is VALID [2020-07-10 19:03:51,495 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-10 19:03:51,496 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-10 19:03:51,496 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-10 19:03:51,497 INFO L280 TraceCheckUtils]: 17: Hoare triple {100#false} havoc #t~mem6.base, #t~mem6.offset; {100#false} is VALID [2020-07-10 19:03:51,497 INFO L280 TraceCheckUtils]: 18: Hoare triple {100#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {100#false} is VALID [2020-07-10 19:03:51,497 INFO L280 TraceCheckUtils]: 19: Hoare triple {100#false} assume !false; {100#false} is VALID [2020-07-10 19:03:51,500 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-10 19:03:51,500 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:03:51,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1189127725] [2020-07-10 19:03:51,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:03:51,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 19:03:51,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864884508] [2020-07-10 19:03:51,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 19:03:51,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:03:51,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 19:03:51,557 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-10 19:03:51,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 19:03:51,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:03:51,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 19:03:51,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 19:03:51,569 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 3 states. [2020-07-10 19:03:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:52,031 INFO L93 Difference]: Finished difference Result 179 states and 215 transitions. [2020-07-10 19:03:52,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 19:03:52,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 19:03:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:03:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 19:03:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2020-07-10 19:03:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 19:03:52,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2020-07-10 19:03:52,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 215 transitions. [2020-07-10 19:03:52,300 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-10 19:03:52,316 INFO L225 Difference]: With dead ends: 179 [2020-07-10 19:03:52,317 INFO L226 Difference]: Without dead ends: 77 [2020-07-10 19:03:52,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10 19:03:52,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-10 19:03:52,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-07-10 19:03:52,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:03:52,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 77 states. [2020-07-10 19:03:52,399 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2020-07-10 19:03:52,399 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2020-07-10 19:03:52,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:52,407 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-07-10 19:03:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-10 19:03:52,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:03:52,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:03:52,409 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2020-07-10 19:03:52,410 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2020-07-10 19:03:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:52,417 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-07-10 19:03:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-10 19:03:52,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:03:52,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:03:52,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:03:52,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:03:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-10 19:03:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-07-10 19:03:52,428 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 20 [2020-07-10 19:03:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:03:52,429 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-07-10 19:03:52,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 19:03:52,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 77 states and 82 transitions. [2020-07-10 19:03:52,536 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-10 19:03:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-10 19:03:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 19:03:52,538 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:03:52,538 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-10 19:03:52,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:03:52,538 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:03:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:03:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2066269805, now seen corresponding path program 1 times [2020-07-10 19:03:52,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:03:52,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [62594586] [2020-07-10 19:03:52,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:03:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:03:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:03:52,859 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-10 19:03:52,860 INFO L280 TraceCheckUtils]: 1: Hoare triple {775#true} #valid := #valid[0 := 0]; {775#true} is VALID [2020-07-10 19:03:52,860 INFO L280 TraceCheckUtils]: 2: Hoare triple {775#true} assume 0 < #StackHeapBarrier; {775#true} is VALID [2020-07-10 19:03:52,860 INFO L280 TraceCheckUtils]: 3: Hoare triple {775#true} assume true; {775#true} is VALID [2020-07-10 19:03:52,861 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {775#true} {775#true} #187#return; {775#true} is VALID [2020-07-10 19:03:52,861 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-10 19:03:52,862 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-10 19:03:52,862 INFO L280 TraceCheckUtils]: 2: Hoare triple {775#true} #valid := #valid[0 := 0]; {775#true} is VALID [2020-07-10 19:03:52,862 INFO L280 TraceCheckUtils]: 3: Hoare triple {775#true} assume 0 < #StackHeapBarrier; {775#true} is VALID [2020-07-10 19:03:52,863 INFO L280 TraceCheckUtils]: 4: Hoare triple {775#true} assume true; {775#true} is VALID [2020-07-10 19:03:52,863 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {775#true} {775#true} #187#return; {775#true} is VALID [2020-07-10 19:03:52,863 INFO L263 TraceCheckUtils]: 6: Hoare triple {775#true} call #t~ret18 := main(); {775#true} is VALID [2020-07-10 19:03:52,864 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-10 19:03:52,864 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-10 19:03:52,866 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-10 19:03:52,867 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-10 19:03:52,867 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-10 19:03:52,869 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-10 19:03:52,870 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-10 19:03:52,871 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-10 19:03:52,871 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-10 19:03:52,873 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-10 19:03:52,874 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-10 19:03:52,878 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-10 19:03:52,879 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-10 19:03:52,883 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-10 19:03:52,884 INFO L280 TraceCheckUtils]: 21: Hoare triple {776#false} assume !false; {776#false} is VALID [2020-07-10 19:03:52,886 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-10 19:03:52,886 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:03:52,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [62594586] [2020-07-10 19:03:52,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:03:52,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 19:03:52,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503760108] [2020-07-10 19:03:52,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-07-10 19:03:52,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:03:52,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 19:03:52,917 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-10 19:03:52,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 19:03:52,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:03:52,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 19:03:52,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-10 19:03:52,918 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 10 states. [2020-07-10 19:03:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:54,739 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2020-07-10 19:03:54,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 19:03:54,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-07-10 19:03:54,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:03:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 19:03:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 163 transitions. [2020-07-10 19:03:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 19:03:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 163 transitions. [2020-07-10 19:03:54,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 163 transitions. [2020-07-10 19:03:54,976 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-10 19:03:54,983 INFO L225 Difference]: With dead ends: 155 [2020-07-10 19:03:54,983 INFO L226 Difference]: Without dead ends: 153 [2020-07-10 19:03:54,985 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 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-10 19:03:54,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-07-10 19:03:55,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 85. [2020-07-10 19:03:55,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:03:55,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 85 states. [2020-07-10 19:03:55,247 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 85 states. [2020-07-10 19:03:55,248 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 85 states. [2020-07-10 19:03:55,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:55,256 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2020-07-10 19:03:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2020-07-10 19:03:55,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:03:55,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:03:55,258 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 153 states. [2020-07-10 19:03:55,258 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 153 states. [2020-07-10 19:03:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:55,266 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2020-07-10 19:03:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2020-07-10 19:03:55,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:03:55,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:03:55,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:03:55,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:03:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-10 19:03:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2020-07-10 19:03:55,272 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 22 [2020-07-10 19:03:55,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:03:55,273 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2020-07-10 19:03:55,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 19:03:55,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 91 transitions. [2020-07-10 19:03:55,434 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-10 19:03:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2020-07-10 19:03:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 19:03:55,436 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:03:55,436 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-10 19:03:55,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:03:55,437 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:03:55,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:03:55,437 INFO L82 PathProgramCache]: Analyzing trace with hash 807179936, now seen corresponding path program 1 times [2020-07-10 19:03:55,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:03:55,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [854691373] [2020-07-10 19:03:55,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:03:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:03:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:03:55,774 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-10 19:03:55,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {1592#true} #valid := #valid[0 := 0]; {1592#true} is VALID [2020-07-10 19:03:55,775 INFO L280 TraceCheckUtils]: 2: Hoare triple {1592#true} assume 0 < #StackHeapBarrier; {1592#true} is VALID [2020-07-10 19:03:55,775 INFO L280 TraceCheckUtils]: 3: Hoare triple {1592#true} assume true; {1592#true} is VALID [2020-07-10 19:03:55,776 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1592#true} {1592#true} #187#return; {1592#true} is VALID [2020-07-10 19:03:55,777 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-10 19:03:55,777 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-10 19:03:55,778 INFO L280 TraceCheckUtils]: 2: Hoare triple {1592#true} #valid := #valid[0 := 0]; {1592#true} is VALID [2020-07-10 19:03:55,778 INFO L280 TraceCheckUtils]: 3: Hoare triple {1592#true} assume 0 < #StackHeapBarrier; {1592#true} is VALID [2020-07-10 19:03:55,778 INFO L280 TraceCheckUtils]: 4: Hoare triple {1592#true} assume true; {1592#true} is VALID [2020-07-10 19:03:55,779 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1592#true} {1592#true} #187#return; {1592#true} is VALID [2020-07-10 19:03:55,779 INFO L263 TraceCheckUtils]: 6: Hoare triple {1592#true} call #t~ret18 := main(); {1592#true} is VALID [2020-07-10 19:03:55,783 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-10 19:03:55,784 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-10 19:03:55,784 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-10 19:03:55,785 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-10 19:03:55,786 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-10 19:03:55,786 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-10 19:03:55,787 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-10 19:03:55,787 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-10 19:03:55,788 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-10 19:03:55,789 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-10 19:03:55,790 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-10 19:03:55,790 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-10 19:03:55,791 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-10 19:03:55,792 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-10 19:03:55,793 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-10 19:03:55,794 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-10 19:03:55,794 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-10 19:03:55,795 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-10 19:03:55,795 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-10 19:03:55,796 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-10 19:03:55,796 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-10 19:03:55,797 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-10 19:03:55,797 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-10 19:03:55,798 INFO L280 TraceCheckUtils]: 30: Hoare triple {1593#false} assume !false; {1593#false} is VALID [2020-07-10 19:03:55,800 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-10 19:03:55,800 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:03:55,800 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [854691373] [2020-07-10 19:03:55,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:03:55,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 19:03:55,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126748615] [2020-07-10 19:03:55,801 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-10 19:03:55,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:03:55,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 19:03:55,841 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-10 19:03:55,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 19:03:55,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:03:55,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 19:03:55,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-10 19:03:55,842 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 12 states. [2020-07-10 19:03:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:57,739 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2020-07-10 19:03:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 19:03:57,740 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-10 19:03:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:03:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 19:03:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2020-07-10 19:03:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 19:03:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2020-07-10 19:03:57,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 130 transitions. [2020-07-10 19:03:57,921 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-10 19:03:57,926 INFO L225 Difference]: With dead ends: 122 [2020-07-10 19:03:57,926 INFO L226 Difference]: Without dead ends: 120 [2020-07-10 19:03:57,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 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-10 19:03:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-10 19:03:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2020-07-10 19:03:58,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:03:58,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 105 states. [2020-07-10 19:03:58,357 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 105 states. [2020-07-10 19:03:58,357 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 105 states. [2020-07-10 19:03:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:58,365 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2020-07-10 19:03:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2020-07-10 19:03:58,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:03:58,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:03:58,366 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 120 states. [2020-07-10 19:03:58,366 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 120 states. [2020-07-10 19:03:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:58,374 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2020-07-10 19:03:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2020-07-10 19:03:58,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:03:58,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:03:58,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:03:58,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:03:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-10 19:03:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2020-07-10 19:03:58,381 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 31 [2020-07-10 19:03:58,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:03:58,382 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2020-07-10 19:03:58,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 19:03:58,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 105 states and 114 transitions. [2020-07-10 19:03:58,594 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-10 19:03:58,594 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2020-07-10 19:03:58,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-10 19:03:58,595 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:03:58,595 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-10 19:03:58,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 19:03:58,596 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:03:58,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:03:58,596 INFO L82 PathProgramCache]: Analyzing trace with hash -988969633, now seen corresponding path program 1 times [2020-07-10 19:03:58,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:03:58,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [330739961] [2020-07-10 19:03:58,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:03:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:03:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:03:58,702 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-10 19:03:58,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {2321#true} #valid := #valid[0 := 0]; {2321#true} is VALID [2020-07-10 19:03:58,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {2321#true} assume 0 < #StackHeapBarrier; {2321#true} is VALID [2020-07-10 19:03:58,703 INFO L280 TraceCheckUtils]: 3: Hoare triple {2321#true} assume true; {2321#true} is VALID [2020-07-10 19:03:58,704 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2321#true} {2321#true} #187#return; {2321#true} is VALID [2020-07-10 19:03:58,705 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-10 19:03:58,705 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-10 19:03:58,706 INFO L280 TraceCheckUtils]: 2: Hoare triple {2321#true} #valid := #valid[0 := 0]; {2321#true} is VALID [2020-07-10 19:03:58,706 INFO L280 TraceCheckUtils]: 3: Hoare triple {2321#true} assume 0 < #StackHeapBarrier; {2321#true} is VALID [2020-07-10 19:03:58,706 INFO L280 TraceCheckUtils]: 4: Hoare triple {2321#true} assume true; {2321#true} is VALID [2020-07-10 19:03:58,706 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2321#true} {2321#true} #187#return; {2321#true} is VALID [2020-07-10 19:03:58,707 INFO L263 TraceCheckUtils]: 6: Hoare triple {2321#true} call #t~ret18 := main(); {2321#true} is VALID [2020-07-10 19:03:58,707 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-10 19:03:58,707 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-10 19:03:58,708 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-10 19:03:58,708 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-10 19:03:58,708 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-10 19:03:58,709 INFO L280 TraceCheckUtils]: 12: Hoare triple {2321#true} ~state~0 := 1; {2328#(= 1 main_~state~0)} is VALID [2020-07-10 19:03:58,710 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-10 19:03:58,710 INFO L280 TraceCheckUtils]: 14: Hoare triple {2328#(= 1 main_~state~0)} assume !!(0 != #t~nondet1); {2328#(= 1 main_~state~0)} is VALID [2020-07-10 19:03:58,711 INFO L280 TraceCheckUtils]: 15: Hoare triple {2328#(= 1 main_~state~0)} havoc #t~nondet1; {2328#(= 1 main_~state~0)} is VALID [2020-07-10 19:03:58,712 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-10 19:03:58,712 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-10 19:03:58,713 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-10 19:03:58,714 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-10 19:03:58,714 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-10 19:03:58,715 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-10 19:03:58,715 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-10 19:03:58,716 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-10 19:03:58,717 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-10 19:03:58,717 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-10 19:03:58,718 INFO L280 TraceCheckUtils]: 26: Hoare triple {2328#(= 1 main_~state~0)} assume 0 != #t~nondet5; {2328#(= 1 main_~state~0)} is VALID [2020-07-10 19:03:58,719 INFO L280 TraceCheckUtils]: 27: Hoare triple {2328#(= 1 main_~state~0)} havoc #t~nondet5; {2328#(= 1 main_~state~0)} is VALID [2020-07-10 19:03:58,719 INFO L280 TraceCheckUtils]: 28: Hoare triple {2328#(= 1 main_~state~0)} assume !(1 == ~state~0); {2322#false} is VALID [2020-07-10 19:03:58,720 INFO L280 TraceCheckUtils]: 29: Hoare triple {2322#false} assume !(2 == ~state~0); {2322#false} is VALID [2020-07-10 19:03:58,720 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-10 19:03:58,720 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-10 19:03:58,720 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-10 19:03:58,721 INFO L280 TraceCheckUtils]: 33: Hoare triple {2322#false} havoc #t~mem6.base, #t~mem6.offset; {2322#false} is VALID [2020-07-10 19:03:58,721 INFO L280 TraceCheckUtils]: 34: Hoare triple {2322#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {2322#false} is VALID [2020-07-10 19:03:58,721 INFO L280 TraceCheckUtils]: 35: Hoare triple {2322#false} assume !false; {2322#false} is VALID [2020-07-10 19:03:58,723 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-10 19:03:58,724 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:03:58,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [330739961] [2020-07-10 19:03:58,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:03:58,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:03:58,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288071858] [2020-07-10 19:03:58,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-07-10 19:03:58,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:03:58,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:03:58,775 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-10 19:03:58,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:03:58,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:03:58,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:03:58,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:03:58,776 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 4 states. [2020-07-10 19:03:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:59,786 INFO L93 Difference]: Finished difference Result 234 states and 252 transitions. [2020-07-10 19:03:59,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 19:03:59,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-07-10 19:03:59,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:03:59,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:03:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2020-07-10 19:03:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:03:59,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2020-07-10 19:03:59,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 216 transitions. [2020-07-10 19:04:00,007 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-10 19:04:00,011 INFO L225 Difference]: With dead ends: 234 [2020-07-10 19:04:00,011 INFO L226 Difference]: Without dead ends: 166 [2020-07-10 19:04:00,012 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10 19:04:00,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-10 19:04:00,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 125. [2020-07-10 19:04:00,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:00,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 125 states. [2020-07-10 19:04:00,552 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 125 states. [2020-07-10 19:04:00,552 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 125 states. [2020-07-10 19:04:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:00,558 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2020-07-10 19:04:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2020-07-10 19:04:00,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:00,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:00,559 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 166 states. [2020-07-10 19:04:00,559 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 166 states. [2020-07-10 19:04:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:00,565 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2020-07-10 19:04:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2020-07-10 19:04:00,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:00,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:00,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:00,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-07-10 19:04:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2020-07-10 19:04:00,570 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 36 [2020-07-10 19:04:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:00,571 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2020-07-10 19:04:00,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:04:00,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 125 states and 135 transitions. [2020-07-10 19:04:00,820 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-10 19:04:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2020-07-10 19:04:00,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 19:04:00,822 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:00,822 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-10 19:04:00,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 19:04:00,823 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:00,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1230029085, now seen corresponding path program 1 times [2020-07-10 19:04:00,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:00,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1498580243] [2020-07-10 19:04:00,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:01,256 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-10 19:04:01,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {3382#true} #valid := #valid[0 := 0]; {3382#true} is VALID [2020-07-10 19:04:01,257 INFO L280 TraceCheckUtils]: 2: Hoare triple {3382#true} assume 0 < #StackHeapBarrier; {3382#true} is VALID [2020-07-10 19:04:01,257 INFO L280 TraceCheckUtils]: 3: Hoare triple {3382#true} assume true; {3382#true} is VALID [2020-07-10 19:04:01,258 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3382#true} {3382#true} #187#return; {3382#true} is VALID [2020-07-10 19:04:01,259 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-10 19:04:01,259 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-10 19:04:01,260 INFO L280 TraceCheckUtils]: 2: Hoare triple {3382#true} #valid := #valid[0 := 0]; {3382#true} is VALID [2020-07-10 19:04:01,260 INFO L280 TraceCheckUtils]: 3: Hoare triple {3382#true} assume 0 < #StackHeapBarrier; {3382#true} is VALID [2020-07-10 19:04:01,260 INFO L280 TraceCheckUtils]: 4: Hoare triple {3382#true} assume true; {3382#true} is VALID [2020-07-10 19:04:01,260 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3382#true} {3382#true} #187#return; {3382#true} is VALID [2020-07-10 19:04:01,261 INFO L263 TraceCheckUtils]: 6: Hoare triple {3382#true} call #t~ret18 := main(); {3382#true} is VALID [2020-07-10 19:04:01,261 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-10 19:04:01,262 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-10 19:04:01,264 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-10 19:04:01,265 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-10 19:04:01,267 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-10 19:04:01,268 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-10 19:04:01,272 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-10 19:04:01,274 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-10 19:04:01,277 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-10 19:04:01,278 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-10 19:04:01,279 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-10 19:04:01,280 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-10 19:04:01,280 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-10 19:04:01,281 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-10 19:04:01,282 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-10 19:04:01,283 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-10 19:04:01,284 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-10 19:04:01,285 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-10 19:04:01,286 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-10 19:04:01,286 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-10 19:04:01,287 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-10 19:04:01,288 INFO L280 TraceCheckUtils]: 28: Hoare triple {3399#|main_#t~short13|} assume !#t~short13; {3383#false} is VALID [2020-07-10 19:04:01,289 INFO L280 TraceCheckUtils]: 29: Hoare triple {3383#false} assume !#t~short13; {3383#false} is VALID [2020-07-10 19:04:01,289 INFO L280 TraceCheckUtils]: 30: Hoare triple {3383#false} havoc #t~mem11; {3383#false} is VALID [2020-07-10 19:04:01,289 INFO L280 TraceCheckUtils]: 31: Hoare triple {3383#false} havoc #t~mem8.base, #t~mem8.offset; {3383#false} is VALID [2020-07-10 19:04:01,290 INFO L280 TraceCheckUtils]: 32: Hoare triple {3383#false} havoc #t~mem9; {3383#false} is VALID [2020-07-10 19:04:01,290 INFO L280 TraceCheckUtils]: 33: Hoare triple {3383#false} havoc #t~mem12; {3383#false} is VALID [2020-07-10 19:04:01,290 INFO L280 TraceCheckUtils]: 34: Hoare triple {3383#false} havoc #t~short13; {3383#false} is VALID [2020-07-10 19:04:01,290 INFO L280 TraceCheckUtils]: 35: Hoare triple {3383#false} havoc #t~mem10.base, #t~mem10.offset; {3383#false} is VALID [2020-07-10 19:04:01,291 INFO L280 TraceCheckUtils]: 36: Hoare triple {3383#false} assume !false; {3383#false} is VALID [2020-07-10 19:04:01,297 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-10 19:04:01,297 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:01,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1498580243] [2020-07-10 19:04:01,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:01,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-10 19:04:01,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830192627] [2020-07-10 19:04:01,298 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2020-07-10 19:04:01,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:01,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 19:04:01,346 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-10 19:04:01,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 19:04:01,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:01,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 19:04:01,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-10 19:04:01,347 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 14 states. [2020-07-10 19:04:04,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:04,335 INFO L93 Difference]: Finished difference Result 215 states and 228 transitions. [2020-07-10 19:04:04,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-10 19:04:04,335 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2020-07-10 19:04:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 19:04:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 187 transitions. [2020-07-10 19:04:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 19:04:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 187 transitions. [2020-07-10 19:04:04,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 187 transitions. [2020-07-10 19:04:04,606 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-10 19:04:04,611 INFO L225 Difference]: With dead ends: 215 [2020-07-10 19:04:04,611 INFO L226 Difference]: Without dead ends: 185 [2020-07-10 19:04:04,612 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2020-07-10 19:04:04,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-10 19:04:05,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 133. [2020-07-10 19:04:05,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:05,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 133 states. [2020-07-10 19:04:05,208 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 133 states. [2020-07-10 19:04:05,208 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 133 states. [2020-07-10 19:04:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:05,214 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2020-07-10 19:04:05,214 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2020-07-10 19:04:05,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:05,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:05,215 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 185 states. [2020-07-10 19:04:05,215 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 185 states. [2020-07-10 19:04:05,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:05,222 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2020-07-10 19:04:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2020-07-10 19:04:05,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:05,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:05,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:05,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-07-10 19:04:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2020-07-10 19:04:05,227 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 37 [2020-07-10 19:04:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:05,228 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2020-07-10 19:04:05,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 19:04:05,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 133 states and 143 transitions. [2020-07-10 19:04:05,504 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-10 19:04:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2020-07-10 19:04:05,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 19:04:05,505 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:05,506 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-10 19:04:05,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 19:04:05,506 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:05,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:05,507 INFO L82 PathProgramCache]: Analyzing trace with hash 626563183, now seen corresponding path program 1 times [2020-07-10 19:04:05,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:05,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2051055660] [2020-07-10 19:04:05,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:06,004 INFO L280 TraceCheckUtils]: 0: Hoare triple {4522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4503#true} is VALID [2020-07-10 19:04:06,005 INFO L280 TraceCheckUtils]: 1: Hoare triple {4503#true} #valid := #valid[0 := 0]; {4503#true} is VALID [2020-07-10 19:04:06,005 INFO L280 TraceCheckUtils]: 2: Hoare triple {4503#true} assume 0 < #StackHeapBarrier; {4503#true} is VALID [2020-07-10 19:04:06,005 INFO L280 TraceCheckUtils]: 3: Hoare triple {4503#true} assume true; {4503#true} is VALID [2020-07-10 19:04:06,006 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4503#true} {4503#true} #187#return; {4503#true} is VALID [2020-07-10 19:04:06,007 INFO L263 TraceCheckUtils]: 0: Hoare triple {4503#true} call ULTIMATE.init(); {4522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:06,007 INFO L280 TraceCheckUtils]: 1: Hoare triple {4522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4503#true} is VALID [2020-07-10 19:04:06,007 INFO L280 TraceCheckUtils]: 2: Hoare triple {4503#true} #valid := #valid[0 := 0]; {4503#true} is VALID [2020-07-10 19:04:06,008 INFO L280 TraceCheckUtils]: 3: Hoare triple {4503#true} assume 0 < #StackHeapBarrier; {4503#true} is VALID [2020-07-10 19:04:06,008 INFO L280 TraceCheckUtils]: 4: Hoare triple {4503#true} assume true; {4503#true} is VALID [2020-07-10 19:04:06,008 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4503#true} {4503#true} #187#return; {4503#true} is VALID [2020-07-10 19:04:06,008 INFO L263 TraceCheckUtils]: 6: Hoare triple {4503#true} call #t~ret18 := main(); {4503#true} is VALID [2020-07-10 19:04:06,009 INFO L280 TraceCheckUtils]: 7: Hoare triple {4503#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {4510#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-10 19:04:06,010 INFO L280 TraceCheckUtils]: 8: Hoare triple {4510#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {4511#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-10 19:04:06,011 INFO L280 TraceCheckUtils]: 9: Hoare triple {4511#(= 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 {4511#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-10 19:04:06,011 INFO L280 TraceCheckUtils]: 10: Hoare triple {4511#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {4511#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-10 19:04:06,014 INFO L280 TraceCheckUtils]: 11: Hoare triple {4511#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {4512#(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-10 19:04:06,016 INFO L280 TraceCheckUtils]: 12: Hoare triple {4512#(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; {4512#(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-10 19:04:06,017 INFO L280 TraceCheckUtils]: 13: Hoare triple {4512#(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; {4512#(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-10 19:04:06,018 INFO L280 TraceCheckUtils]: 14: Hoare triple {4512#(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); {4512#(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-10 19:04:06,018 INFO L280 TraceCheckUtils]: 15: Hoare triple {4512#(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; {4512#(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-10 19:04:06,022 INFO L280 TraceCheckUtils]: 16: Hoare triple {4512#(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 {4513#(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-10 19:04:06,023 INFO L280 TraceCheckUtils]: 17: Hoare triple {4513#(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 {4514#(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-10 19:04:06,024 INFO L280 TraceCheckUtils]: 18: Hoare triple {4514#(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 {4515#(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-10 19:04:06,026 INFO L280 TraceCheckUtils]: 19: Hoare triple {4515#(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 {4514#(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-10 19:04:06,027 INFO L280 TraceCheckUtils]: 20: Hoare triple {4514#(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; {4514#(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-10 19:04:06,028 INFO L280 TraceCheckUtils]: 21: Hoare triple {4514#(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 {4516#(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-10 19:04:06,029 INFO L280 TraceCheckUtils]: 22: Hoare triple {4516#(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; {4517#(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-10 19:04:06,030 INFO L280 TraceCheckUtils]: 23: Hoare triple {4517#(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; {4517#(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-10 19:04:06,030 INFO L280 TraceCheckUtils]: 24: Hoare triple {4517#(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 {4517#(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-10 19:04:06,031 INFO L280 TraceCheckUtils]: 25: Hoare triple {4517#(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; {4517#(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-10 19:04:06,032 INFO L280 TraceCheckUtils]: 26: Hoare triple {4517#(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); {4517#(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-10 19:04:06,036 INFO L280 TraceCheckUtils]: 27: Hoare triple {4517#(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; {4517#(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-10 19:04:06,038 INFO L280 TraceCheckUtils]: 28: Hoare triple {4517#(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 {4517#(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-10 19:04:06,038 INFO L280 TraceCheckUtils]: 29: Hoare triple {4517#(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); {4518#(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-10 19:04:06,040 INFO L280 TraceCheckUtils]: 30: Hoare triple {4518#(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; {4518#(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-10 19:04:06,041 INFO L280 TraceCheckUtils]: 31: Hoare triple {4518#(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; {4518#(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-10 19:04:06,042 INFO L280 TraceCheckUtils]: 32: Hoare triple {4518#(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); {4518#(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-10 19:04:06,042 INFO L280 TraceCheckUtils]: 33: Hoare triple {4518#(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; {4518#(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-10 19:04:06,043 INFO L280 TraceCheckUtils]: 34: Hoare triple {4518#(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 {4519#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-10 19:04:06,044 INFO L280 TraceCheckUtils]: 35: Hoare triple {4519#(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 {4520#(not (= 0 |main_#t~mem6.base|))} is VALID [2020-07-10 19:04:06,045 INFO L280 TraceCheckUtils]: 36: Hoare triple {4520#(not (= 0 |main_#t~mem6.base|))} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset; {4521#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:06,047 INFO L280 TraceCheckUtils]: 37: Hoare triple {4521#(not (= 0 main_~x~0.base))} havoc #t~mem6.base, #t~mem6.offset; {4521#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:06,050 INFO L280 TraceCheckUtils]: 38: Hoare triple {4521#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {4504#false} is VALID [2020-07-10 19:04:06,051 INFO L280 TraceCheckUtils]: 39: Hoare triple {4504#false} assume !false; {4504#false} is VALID [2020-07-10 19:04:06,056 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-10 19:04:06,056 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:06,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2051055660] [2020-07-10 19:04:06,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:06,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 19:04:06,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423482514] [2020-07-10 19:04:06,058 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2020-07-10 19:04:06,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:06,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 19:04:06,111 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-10 19:04:06,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 19:04:06,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:06,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 19:04:06,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2020-07-10 19:04:06,112 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 15 states. [2020-07-10 19:04:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:09,829 INFO L93 Difference]: Finished difference Result 227 states and 241 transitions. [2020-07-10 19:04:09,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-10 19:04:09,829 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2020-07-10 19:04:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 19:04:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 192 transitions. [2020-07-10 19:04:09,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 19:04:09,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 192 transitions. [2020-07-10 19:04:09,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 192 transitions. [2020-07-10 19:04:10,094 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-10 19:04:10,100 INFO L225 Difference]: With dead ends: 227 [2020-07-10 19:04:10,100 INFO L226 Difference]: Without dead ends: 225 [2020-07-10 19:04:10,101 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 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-10 19:04:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-07-10 19:04:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 145. [2020-07-10 19:04:10,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:10,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand 145 states. [2020-07-10 19:04:10,817 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 145 states. [2020-07-10 19:04:10,817 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 145 states. [2020-07-10 19:04:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:10,826 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2020-07-10 19:04:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 239 transitions. [2020-07-10 19:04:10,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:10,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:10,827 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 225 states. [2020-07-10 19:04:10,827 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 225 states. [2020-07-10 19:04:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:10,834 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2020-07-10 19:04:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 239 transitions. [2020-07-10 19:04:10,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:10,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:10,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:10,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-07-10 19:04:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2020-07-10 19:04:10,839 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 40 [2020-07-10 19:04:10,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:10,840 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2020-07-10 19:04:10,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 19:04:10,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 145 states and 157 transitions. [2020-07-10 19:04:11,231 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-10 19:04:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2020-07-10 19:04:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 19:04:11,233 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:11,233 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-10 19:04:11,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 19:04:11,234 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1667005657, now seen corresponding path program 1 times [2020-07-10 19:04:11,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:11,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1212353414] [2020-07-10 19:04:11,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 19:04:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 19:04:11,304 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:11,304 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-10 19:04:11,305 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 19:04:11,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 19:04:11,324 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 19:04:11,324 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 19:04:11,324 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 19:04:11,324 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 19:04:11,324 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:04:11,325 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:04:11,325 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:04:11,325 WARN L170 areAnnotationChecker]: L986 has no Hoare annotation [2020-07-10 19:04:11,325 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-10 19:04:11,325 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 19:04:11,325 WARN L170 areAnnotationChecker]: L987 has no Hoare annotation [2020-07-10 19:04:11,325 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 19:04:11,325 WARN L170 areAnnotationChecker]: L987-1 has no Hoare annotation [2020-07-10 19:04:11,325 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 19:04:11,325 WARN L170 areAnnotationChecker]: L988 has no Hoare annotation [2020-07-10 19:04:11,326 WARN L170 areAnnotationChecker]: L991 has no Hoare annotation [2020-07-10 19:04:11,326 WARN L170 areAnnotationChecker]: L1014-4 has no Hoare annotation [2020-07-10 19:04:11,326 WARN L170 areAnnotationChecker]: L1014-4 has no Hoare annotation [2020-07-10 19:04:11,326 WARN L170 areAnnotationChecker]: L994-5 has no Hoare annotation [2020-07-10 19:04:11,326 WARN L170 areAnnotationChecker]: L994-1 has no Hoare annotation [2020-07-10 19:04:11,326 WARN L170 areAnnotationChecker]: L994-1 has no Hoare annotation [2020-07-10 19:04:11,326 WARN L170 areAnnotationChecker]: L1016 has no Hoare annotation [2020-07-10 19:04:11,326 WARN L170 areAnnotationChecker]: L994-2 has no Hoare annotation [2020-07-10 19:04:11,326 WARN L170 areAnnotationChecker]: L994-4 has no Hoare annotation [2020-07-10 19:04:11,326 WARN L170 areAnnotationChecker]: L1018 has no Hoare annotation [2020-07-10 19:04:11,327 WARN L170 areAnnotationChecker]: L997 has no Hoare annotation [2020-07-10 19:04:11,327 WARN L170 areAnnotationChecker]: L1018-1 has no Hoare annotation [2020-07-10 19:04:11,327 WARN L170 areAnnotationChecker]: L997-1 has no Hoare annotation [2020-07-10 19:04:11,327 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-10 19:04:11,327 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-10 19:04:11,327 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-10 19:04:11,327 WARN L170 areAnnotationChecker]: L997-2 has no Hoare annotation [2020-07-10 19:04:11,327 WARN L170 areAnnotationChecker]: L1021-4 has no Hoare annotation [2020-07-10 19:04:11,327 WARN L170 areAnnotationChecker]: L1021-4 has no Hoare annotation [2020-07-10 19:04:11,327 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2020-07-10 19:04:11,328 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2020-07-10 19:04:11,328 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2020-07-10 19:04:11,328 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2020-07-10 19:04:11,328 WARN L170 areAnnotationChecker]: L998 has no Hoare annotation [2020-07-10 19:04:11,328 WARN L170 areAnnotationChecker]: L1021-5 has no Hoare annotation [2020-07-10 19:04:11,328 WARN L170 areAnnotationChecker]: L1021 has no Hoare annotation [2020-07-10 19:04:11,328 WARN L170 areAnnotationChecker]: L1021 has no Hoare annotation [2020-07-10 19:04:11,328 WARN L170 areAnnotationChecker]: L998-1 has no Hoare annotation [2020-07-10 19:04:11,328 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-10 19:04:11,328 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-10 19:04:11,329 WARN L170 areAnnotationChecker]: L1021-3 has no Hoare annotation [2020-07-10 19:04:11,329 WARN L170 areAnnotationChecker]: L999 has no Hoare annotation [2020-07-10 19:04:11,329 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2020-07-10 19:04:11,329 WARN L170 areAnnotationChecker]: L1023-25 has no Hoare annotation [2020-07-10 19:04:11,329 WARN L170 areAnnotationChecker]: L1023-25 has no Hoare annotation [2020-07-10 19:04:11,329 WARN L170 areAnnotationChecker]: L999-1 has no Hoare annotation [2020-07-10 19:04:11,329 WARN L170 areAnnotationChecker]: L1033-1 has no Hoare annotation [2020-07-10 19:04:11,329 WARN L170 areAnnotationChecker]: L1033-1 has no Hoare annotation [2020-07-10 19:04:11,329 WARN L170 areAnnotationChecker]: L1023-1 has no Hoare annotation [2020-07-10 19:04:11,329 WARN L170 areAnnotationChecker]: L1023-26 has no Hoare annotation [2020-07-10 19:04:11,330 WARN L170 areAnnotationChecker]: L999-2 has no Hoare annotation [2020-07-10 19:04:11,330 WARN L170 areAnnotationChecker]: L1029-5 has no Hoare annotation [2020-07-10 19:04:11,330 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-10 19:04:11,330 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-10 19:04:11,330 WARN L170 areAnnotationChecker]: L1023-2 has no Hoare annotation [2020-07-10 19:04:11,330 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-10 19:04:11,330 WARN L170 areAnnotationChecker]: L1000 has no Hoare annotation [2020-07-10 19:04:11,330 WARN L170 areAnnotationChecker]: L1035 has no Hoare annotation [2020-07-10 19:04:11,330 WARN L170 areAnnotationChecker]: L1029-2 has no Hoare annotation [2020-07-10 19:04:11,330 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-10 19:04:11,330 WARN L170 areAnnotationChecker]: L1023-3 has no Hoare annotation [2020-07-10 19:04:11,331 WARN L170 areAnnotationChecker]: L1023-3 has no Hoare annotation [2020-07-10 19:04:11,331 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2020-07-10 19:04:11,331 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-10 19:04:11,331 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 19:04:11,331 WARN L170 areAnnotationChecker]: L1031 has no Hoare annotation [2020-07-10 19:04:11,331 WARN L170 areAnnotationChecker]: L1023-4 has no Hoare annotation [2020-07-10 19:04:11,331 WARN L170 areAnnotationChecker]: L1023-9 has no Hoare annotation [2020-07-10 19:04:11,332 WARN L170 areAnnotationChecker]: L1023-9 has no Hoare annotation [2020-07-10 19:04:11,332 WARN L170 areAnnotationChecker]: L1002 has no Hoare annotation [2020-07-10 19:04:11,332 WARN L170 areAnnotationChecker]: L1002 has no Hoare annotation [2020-07-10 19:04:11,333 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 19:04:11,333 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-10 19:04:11,333 WARN L170 areAnnotationChecker]: L1023-5 has no Hoare annotation [2020-07-10 19:04:11,333 WARN L170 areAnnotationChecker]: L1023-10 has no Hoare annotation [2020-07-10 19:04:11,333 WARN L170 areAnnotationChecker]: L1023-18 has no Hoare annotation [2020-07-10 19:04:11,333 WARN L170 areAnnotationChecker]: L1002-1 has no Hoare annotation [2020-07-10 19:04:11,333 WARN L170 areAnnotationChecker]: L1002-2 has no Hoare annotation [2020-07-10 19:04:11,333 WARN L170 areAnnotationChecker]: L1032-1 has no Hoare annotation [2020-07-10 19:04:11,333 WARN L170 areAnnotationChecker]: L1023-6 has no Hoare annotation [2020-07-10 19:04:11,334 WARN L170 areAnnotationChecker]: L1023-11 has no Hoare annotation [2020-07-10 19:04:11,334 WARN L170 areAnnotationChecker]: L1023-19 has no Hoare annotation [2020-07-10 19:04:11,334 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-10 19:04:11,334 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-10 19:04:11,334 WARN L170 areAnnotationChecker]: L1002-3 has no Hoare annotation [2020-07-10 19:04:11,334 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-10 19:04:11,334 WARN L170 areAnnotationChecker]: L1023-7 has no Hoare annotation [2020-07-10 19:04:11,334 WARN L170 areAnnotationChecker]: L1023-12 has no Hoare annotation [2020-07-10 19:04:11,334 WARN L170 areAnnotationChecker]: L1023-20 has no Hoare annotation [2020-07-10 19:04:11,335 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2020-07-10 19:04:11,335 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2020-07-10 19:04:11,335 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2020-07-10 19:04:11,335 WARN L170 areAnnotationChecker]: L1014-3 has no Hoare annotation [2020-07-10 19:04:11,335 WARN L170 areAnnotationChecker]: L1014-3 has no Hoare annotation [2020-07-10 19:04:11,335 WARN L170 areAnnotationChecker]: L1014-3 has no Hoare annotation [2020-07-10 19:04:11,335 WARN L170 areAnnotationChecker]: L1033 has no Hoare annotation [2020-07-10 19:04:11,335 WARN L170 areAnnotationChecker]: L1023-13 has no Hoare annotation [2020-07-10 19:04:11,335 WARN L170 areAnnotationChecker]: L1023-21 has no Hoare annotation [2020-07-10 19:04:11,335 WARN L170 areAnnotationChecker]: L1007 has no Hoare annotation [2020-07-10 19:04:11,336 WARN L170 areAnnotationChecker]: L1014 has no Hoare annotation [2020-07-10 19:04:11,336 WARN L170 areAnnotationChecker]: L1014 has no Hoare annotation [2020-07-10 19:04:11,336 WARN L170 areAnnotationChecker]: L1014-2 has no Hoare annotation [2020-07-10 19:04:11,336 WARN L170 areAnnotationChecker]: L1014-2 has no Hoare annotation [2020-07-10 19:04:11,336 WARN L170 areAnnotationChecker]: L1023-14 has no Hoare annotation [2020-07-10 19:04:11,336 WARN L170 areAnnotationChecker]: L1023-22 has no Hoare annotation [2020-07-10 19:04:11,336 WARN L170 areAnnotationChecker]: L1023-15 has no Hoare annotation [2020-07-10 19:04:11,336 WARN L170 areAnnotationChecker]: L1023-23 has no Hoare annotation [2020-07-10 19:04:11,336 WARN L170 areAnnotationChecker]: L1023-16 has no Hoare annotation [2020-07-10 19:04:11,336 WARN L170 areAnnotationChecker]: L1023-16 has no Hoare annotation [2020-07-10 19:04:11,337 WARN L170 areAnnotationChecker]: L1023-24 has no Hoare annotation [2020-07-10 19:04:11,337 WARN L170 areAnnotationChecker]: L1023-24 has no Hoare annotation [2020-07-10 19:04:11,337 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-10 19:04:11,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 07:04:11 BoogieIcfgContainer [2020-07-10 19:04:11,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 19:04:11,346 INFO L168 Benchmark]: Toolchain (without parser) took 21860.30 ms. Allocated memory was 137.4 MB in the beginning and 440.4 MB in the end (delta: 303.0 MB). Free memory was 101.6 MB in the beginning and 190.8 MB in the end (delta: -89.2 MB). Peak memory consumption was 213.9 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:11,347 INFO L168 Benchmark]: CDTParser took 1.07 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 19:04:11,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.09 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 101.4 MB in the beginning and 168.5 MB in the end (delta: -67.1 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:11,350 INFO L168 Benchmark]: Boogie Preprocessor took 74.06 ms. Allocated memory is still 201.9 MB. Free memory was 168.5 MB in the beginning and 165.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:11,350 INFO L168 Benchmark]: RCFGBuilder took 883.18 ms. Allocated memory is still 201.9 MB. Free memory was 165.0 MB in the beginning and 100.9 MB in the end (delta: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:11,351 INFO L168 Benchmark]: TraceAbstraction took 20222.28 ms. Allocated memory was 201.9 MB in the beginning and 440.4 MB in the end (delta: 238.6 MB). Free memory was 100.2 MB in the beginning and 190.8 MB in the end (delta: -90.6 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:11,354 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 675.09 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 101.4 MB in the beginning and 168.5 MB in the end (delta: -67.1 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.06 ms. Allocated memory is still 201.9 MB. Free memory was 168.5 MB in the beginning and 165.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 883.18 ms. Allocated memory is still 201.9 MB. Free memory was 165.0 MB in the beginning and 100.9 MB in the end (delta: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20222.28 ms. Allocated memory was 201.9 MB in the beginning and 440.4 MB in the end (delta: 238.6 MB). Free memory was 100.2 MB in the beginning and 190.8 MB in the end (delta: -90.6 MB). Peak memory consumption was 148.0 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: 20.1s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 479 SDtfs, 1412 SDslu, 2133 SDs, 0 SdLazy, 1460 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.2s 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...