/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-token-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:04:00,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:04:00,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:04:01,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:04:01,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:04:01,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:04:01,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:04:01,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:04:01,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:04:01,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:04:01,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:04:01,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:04:01,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:04:01,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:04:01,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:04:01,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:04:01,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:04:01,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:04:01,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:04:01,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:04:01,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:04:01,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:04:01,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:04:01,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:04:01,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:04:01,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:04:01,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:04:01,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:04:01,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:04:01,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:04:01,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:04:01,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:04:01,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:04:01,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:04:01,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:04:01,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:04:01,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:04:01,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:04:01,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:04:01,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:04:01,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:04:01,062 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:04:01,071 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:04:01,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:04:01,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:04:01,073 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:04:01,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:04:01,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:04:01,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:04:01,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:04:01,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:04:01,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:04:01,074 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:04:01,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:04:01,074 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:04:01,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:04:01,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:04:01,075 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:04:01,075 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:04:01,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:04:01,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:04:01,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:04:01,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:04:01,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:04:01,076 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:04:01,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:04:01,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:04:01,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:04:01,417 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:04:01,418 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:04:01,419 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token-2.i [2020-07-10 19:04:01,521 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/784a44f14/14472e4cd1574fc19ea0a501ab0105a2/FLAG9701be69d [2020-07-10 19:04:02,088 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:04:02,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-token-2.i [2020-07-10 19:04:02,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/784a44f14/14472e4cd1574fc19ea0a501ab0105a2/FLAG9701be69d [2020-07-10 19:04:02,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/784a44f14/14472e4cd1574fc19ea0a501ab0105a2 [2020-07-10 19:04:02,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:04:02,361 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:04:02,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:04:02,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:04:02,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:04:02,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:04:02" (1/1) ... [2020-07-10 19:04:02,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59e526ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:02, skipping insertion in model container [2020-07-10 19:04:02,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:04:02" (1/1) ... [2020-07-10 19:04:02,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:04:02,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:04:02,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:04:02,963 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:04:03,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:04:03,109 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:04:03,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:03 WrapperNode [2020-07-10 19:04:03,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:04:03,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:04:03,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:04:03,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:04:03,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:03" (1/1) ... [2020-07-10 19:04:03,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:03" (1/1) ... [2020-07-10 19:04:03,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:03" (1/1) ... [2020-07-10 19:04:03,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:03" (1/1) ... [2020-07-10 19:04:03,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:03" (1/1) ... [2020-07-10 19:04:03,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:03" (1/1) ... [2020-07-10 19:04:03,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:03" (1/1) ... [2020-07-10 19:04:03,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:04:03,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:04:03,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:04:03,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:04:03,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:03" (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:04:03,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:04:03,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:04:03,252 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:04:03,253 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 19:04:03,253 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 19:04:03,253 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 19:04:03,253 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 19:04:03,253 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 19:04:03,253 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 19:04:03,253 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 19:04:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 19:04:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 19:04:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 19:04:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 19:04:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 19:04:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 19:04:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 19:04:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 19:04:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 19:04:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 19:04:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 19:04:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 19:04:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 19:04:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 19:04:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 19:04:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 19:04:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 19:04:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 19:04:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 19:04:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 19:04:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 19:04:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 19:04:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 19:04:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 19:04:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 19:04:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 19:04:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 19:04:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 19:04:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 19:04:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 19:04:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 19:04:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 19:04:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 19:04:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 19:04:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 19:04:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 19:04:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 19:04:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 19:04:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 19:04:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 19:04:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 19:04:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 19:04:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 19:04:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 19:04:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 19:04:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 19:04:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 19:04:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 19:04:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 19:04:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 19:04:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 19:04:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 19:04:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 19:04:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 19:04:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 19:04:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 19:04:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 19:04:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 19:04:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 19:04:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 19:04:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 19:04:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 19:04:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 19:04:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 19:04:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 19:04:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 19:04:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 19:04:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 19:04:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 19:04:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 19:04:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 19:04:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 19:04:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 19:04:03,265 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 19:04:03,265 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 19:04:03,265 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 19:04:03,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 19:04:03,265 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 19:04:03,265 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 19:04:03,265 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 19:04:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 19:04:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 19:04:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 19:04:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 19:04:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 19:04:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 19:04:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 19:04:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 19:04:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 19:04:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 19:04:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 19:04:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 19:04:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 19:04:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 19:04:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 19:04:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 19:04:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 19:04:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:04:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:04:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 19:04:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 19:04:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 19:04:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 19:04:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 19:04:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:04:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:04:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:04:03,978 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:04:03,978 INFO L295 CfgBuilder]: Removed 15 assume(true) statements. [2020-07-10 19:04:03,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:04:03 BoogieIcfgContainer [2020-07-10 19:04:03,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:04:03,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:04:03,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:04:03,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:04:03,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:04:02" (1/3) ... [2020-07-10 19:04:03,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ff2ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:04:03, skipping insertion in model container [2020-07-10 19:04:03,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:03" (2/3) ... [2020-07-10 19:04:03,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ff2ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:04:03, skipping insertion in model container [2020-07-10 19:04:03,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:04:03" (3/3) ... [2020-07-10 19:04:03,992 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-token-2.i [2020-07-10 19:04:04,004 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:04:04,014 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-07-10 19:04:04,031 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-07-10 19:04:04,055 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:04:04,056 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:04:04,056 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:04:04,056 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:04:04,057 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:04:04,057 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:04:04,057 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:04:04,057 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:04:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2020-07-10 19:04:04,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 19:04:04,090 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:04,091 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:04,092 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:04,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:04,099 INFO L82 PathProgramCache]: Analyzing trace with hash 536950687, now seen corresponding path program 1 times [2020-07-10 19:04:04,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:04,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1824428899] [2020-07-10 19:04:04,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:04,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {111#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {104#true} is VALID [2020-07-10 19:04:04,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {104#true} #valid := #valid[0 := 0]; {104#true} is VALID [2020-07-10 19:04:04,417 INFO L280 TraceCheckUtils]: 2: Hoare triple {104#true} assume 0 < #StackHeapBarrier; {104#true} is VALID [2020-07-10 19:04:04,418 INFO L280 TraceCheckUtils]: 3: Hoare triple {104#true} assume true; {104#true} is VALID [2020-07-10 19:04:04,418 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {104#true} {104#true} #213#return; {104#true} is VALID [2020-07-10 19:04:04,424 INFO L263 TraceCheckUtils]: 0: Hoare triple {104#true} call ULTIMATE.init(); {111#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:04,425 INFO L280 TraceCheckUtils]: 1: Hoare triple {111#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {104#true} is VALID [2020-07-10 19:04:04,425 INFO L280 TraceCheckUtils]: 2: Hoare triple {104#true} #valid := #valid[0 := 0]; {104#true} is VALID [2020-07-10 19:04:04,425 INFO L280 TraceCheckUtils]: 3: Hoare triple {104#true} assume 0 < #StackHeapBarrier; {104#true} is VALID [2020-07-10 19:04:04,426 INFO L280 TraceCheckUtils]: 4: Hoare triple {104#true} assume true; {104#true} is VALID [2020-07-10 19:04:04,426 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {104#true} {104#true} #213#return; {104#true} is VALID [2020-07-10 19:04:04,426 INFO L263 TraceCheckUtils]: 6: Hoare triple {104#true} call #t~ret18 := main(); {104#true} is VALID [2020-07-10 19:04:04,427 INFO L280 TraceCheckUtils]: 7: Hoare triple {104#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {104#true} is VALID [2020-07-10 19:04:04,427 INFO L280 TraceCheckUtils]: 8: Hoare triple {104#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {104#true} is VALID [2020-07-10 19:04:04,427 INFO L280 TraceCheckUtils]: 9: Hoare triple {104#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {104#true} is VALID [2020-07-10 19:04:04,428 INFO L280 TraceCheckUtils]: 10: Hoare triple {104#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {104#true} is VALID [2020-07-10 19:04:04,428 INFO L280 TraceCheckUtils]: 11: Hoare triple {104#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {104#true} is VALID [2020-07-10 19:04:04,428 INFO L280 TraceCheckUtils]: 12: Hoare triple {104#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {104#true} is VALID [2020-07-10 19:04:04,430 INFO L280 TraceCheckUtils]: 13: Hoare triple {104#true} assume !true; {105#false} is VALID [2020-07-10 19:04:04,430 INFO L280 TraceCheckUtils]: 14: Hoare triple {105#false} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-5 {105#false} is VALID [2020-07-10 19:04:04,430 INFO L280 TraceCheckUtils]: 15: Hoare triple {105#false} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); srcloc: L1010 {105#false} is VALID [2020-07-10 19:04:04,431 INFO L280 TraceCheckUtils]: 16: Hoare triple {105#false} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {105#false} is VALID [2020-07-10 19:04:04,431 INFO L280 TraceCheckUtils]: 17: Hoare triple {105#false} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {105#false} is VALID [2020-07-10 19:04:04,431 INFO L280 TraceCheckUtils]: 18: Hoare triple {105#false} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {105#false} is VALID [2020-07-10 19:04:04,432 INFO L280 TraceCheckUtils]: 19: Hoare triple {105#false} havoc #t~mem6.base, #t~mem6.offset; {105#false} is VALID [2020-07-10 19:04:04,432 INFO L280 TraceCheckUtils]: 20: Hoare triple {105#false} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {105#false} is VALID [2020-07-10 19:04:04,433 INFO L280 TraceCheckUtils]: 21: Hoare triple {105#false} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {105#false} is VALID [2020-07-10 19:04:04,433 INFO L280 TraceCheckUtils]: 22: Hoare triple {105#false} havoc #t~mem7.base, #t~mem7.offset; {105#false} is VALID [2020-07-10 19:04:04,433 INFO L280 TraceCheckUtils]: 23: Hoare triple {105#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {105#false} is VALID [2020-07-10 19:04:04,434 INFO L280 TraceCheckUtils]: 24: Hoare triple {105#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {105#false} is VALID [2020-07-10 19:04:04,434 INFO L280 TraceCheckUtils]: 25: Hoare triple {105#false} assume !false; {105#false} is VALID [2020-07-10 19:04:04,437 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:04,438 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:04,440 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1824428899] [2020-07-10 19:04:04,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:04,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 19:04:04,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30661135] [2020-07-10 19:04:04,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 19:04:04,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:04,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 19:04:04,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:04,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 19:04:04,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:04,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 19:04:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 19:04:04,522 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 3 states. [2020-07-10 19:04:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:05,031 INFO L93 Difference]: Finished difference Result 189 states and 235 transitions. [2020-07-10 19:04:05,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 19:04:05,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 19:04:05,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 19:04:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2020-07-10 19:04:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 19:04:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2020-07-10 19:04:05,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 235 transitions. [2020-07-10 19:04:05,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:05,362 INFO L225 Difference]: With dead ends: 189 [2020-07-10 19:04:05,363 INFO L226 Difference]: Without dead ends: 90 [2020-07-10 19:04:05,387 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:04:05,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-10 19:04:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-07-10 19:04:05,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:05,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 90 states. [2020-07-10 19:04:05,506 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2020-07-10 19:04:05,506 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2020-07-10 19:04:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:05,520 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2020-07-10 19:04:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2020-07-10 19:04:05,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:05,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:05,523 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2020-07-10 19:04:05,523 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2020-07-10 19:04:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:05,537 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2020-07-10 19:04:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2020-07-10 19:04:05,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:05,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:05,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:05,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-10 19:04:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2020-07-10 19:04:05,561 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 26 [2020-07-10 19:04:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:05,561 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2020-07-10 19:04:05,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 19:04:05,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 90 states and 92 transitions. [2020-07-10 19:04:05,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:05,675 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2020-07-10 19:04:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 19:04:05,676 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:05,676 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:05,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:04:05,678 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:05,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:05,679 INFO L82 PathProgramCache]: Analyzing trace with hash -692885691, now seen corresponding path program 1 times [2020-07-10 19:04:05,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:05,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2053823909] [2020-07-10 19:04:05,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:05,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {852#true} is VALID [2020-07-10 19:04:05,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {852#true} #valid := #valid[0 := 0]; {852#true} is VALID [2020-07-10 19:04:05,983 INFO L280 TraceCheckUtils]: 2: Hoare triple {852#true} assume 0 < #StackHeapBarrier; {852#true} is VALID [2020-07-10 19:04:05,983 INFO L280 TraceCheckUtils]: 3: Hoare triple {852#true} assume true; {852#true} is VALID [2020-07-10 19:04:05,984 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {852#true} {852#true} #213#return; {852#true} is VALID [2020-07-10 19:04:05,985 INFO L263 TraceCheckUtils]: 0: Hoare triple {852#true} call ULTIMATE.init(); {868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:05,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {852#true} is VALID [2020-07-10 19:04:05,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {852#true} #valid := #valid[0 := 0]; {852#true} is VALID [2020-07-10 19:04:05,986 INFO L280 TraceCheckUtils]: 3: Hoare triple {852#true} assume 0 < #StackHeapBarrier; {852#true} is VALID [2020-07-10 19:04:05,986 INFO L280 TraceCheckUtils]: 4: Hoare triple {852#true} assume true; {852#true} is VALID [2020-07-10 19:04:05,987 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {852#true} {852#true} #213#return; {852#true} is VALID [2020-07-10 19:04:05,987 INFO L263 TraceCheckUtils]: 6: Hoare triple {852#true} call #t~ret18 := main(); {852#true} is VALID [2020-07-10 19:04:05,988 INFO L280 TraceCheckUtils]: 7: Hoare triple {852#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {859#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-10 19:04:05,989 INFO L280 TraceCheckUtils]: 8: Hoare triple {859#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {860#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-10 19:04:05,990 INFO L280 TraceCheckUtils]: 9: Hoare triple {860#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {860#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-10 19:04:05,991 INFO L280 TraceCheckUtils]: 10: Hoare triple {860#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {860#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-10 19:04:05,991 INFO L280 TraceCheckUtils]: 11: Hoare triple {860#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {860#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-10 19:04:05,992 INFO L280 TraceCheckUtils]: 12: Hoare triple {860#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {861#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:05,993 INFO L280 TraceCheckUtils]: 13: Hoare triple {861#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {861#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:05,994 INFO L280 TraceCheckUtils]: 14: Hoare triple {861#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1); {861#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:05,995 INFO L280 TraceCheckUtils]: 15: Hoare triple {861#(= 1 (select |#valid| main_~x~0.base))} havoc #t~nondet1; {861#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:05,996 INFO L280 TraceCheckUtils]: 16: Hoare triple {861#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L1004 {862#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-10 19:04:05,997 INFO L280 TraceCheckUtils]: 17: Hoare triple {862#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1004-1 {863#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-10 19:04:05,999 INFO L280 TraceCheckUtils]: 18: Hoare triple {863#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1004-2 {864#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-10 19:04:06,000 INFO L280 TraceCheckUtils]: 19: Hoare triple {864#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L1005 {865#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-10 19:04:06,001 INFO L280 TraceCheckUtils]: 20: Hoare triple {865#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem3.base, #t~mem3.offset; {865#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-10 19:04:06,005 INFO L280 TraceCheckUtils]: 21: Hoare triple {865#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1006 {866#(not (= 0 |main_#t~mem4.base|))} is VALID [2020-07-10 19:04:06,006 INFO L280 TraceCheckUtils]: 22: Hoare triple {866#(not (= 0 |main_#t~mem4.base|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {867#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:06,007 INFO L280 TraceCheckUtils]: 23: Hoare triple {867#(not (= 0 main_~x~0.base))} havoc #t~mem4.base, #t~mem4.offset; {867#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:06,008 INFO L280 TraceCheckUtils]: 24: Hoare triple {867#(not (= 0 main_~x~0.base))} SUMMARY for call write~int(0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1007 {867#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:06,009 INFO L280 TraceCheckUtils]: 25: Hoare triple {867#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {853#false} is VALID [2020-07-10 19:04:06,010 INFO L280 TraceCheckUtils]: 26: Hoare triple {853#false} assume !false; {853#false} is VALID [2020-07-10 19:04:06,012 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,012 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:06,013 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2053823909] [2020-07-10 19:04:06,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:06,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 19:04:06,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44010552] [2020-07-10 19:04:06,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-10 19:04:06,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:06,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 19:04:06,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:06,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 19:04:06,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:06,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 19:04:06,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-10 19:04:06,046 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 12 states. [2020-07-10 19:04:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:08,251 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions. [2020-07-10 19:04:08,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 19:04:08,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-10 19:04:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 19:04:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2020-07-10 19:04:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 19:04:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2020-07-10 19:04:08,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 179 transitions. [2020-07-10 19:04:08,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:08,509 INFO L225 Difference]: With dead ends: 174 [2020-07-10 19:04:08,510 INFO L226 Difference]: Without dead ends: 172 [2020-07-10 19:04:08,511 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:04:08,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-07-10 19:04:08,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 103. [2020-07-10 19:04:08,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:08,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 103 states. [2020-07-10 19:04:08,708 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 103 states. [2020-07-10 19:04:08,708 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 103 states. [2020-07-10 19:04:08,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:08,717 INFO L93 Difference]: Finished difference Result 172 states and 177 transitions. [2020-07-10 19:04:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions. [2020-07-10 19:04:08,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:08,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:08,719 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 172 states. [2020-07-10 19:04:08,719 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 172 states. [2020-07-10 19:04:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:08,727 INFO L93 Difference]: Finished difference Result 172 states and 177 transitions. [2020-07-10 19:04:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions. [2020-07-10 19:04:08,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:08,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:08,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:08,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-07-10 19:04:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2020-07-10 19:04:08,734 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 27 [2020-07-10 19:04:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:08,734 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2020-07-10 19:04:08,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 19:04:08,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 103 states and 106 transitions. [2020-07-10 19:04:08,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2020-07-10 19:04:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 19:04:08,869 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:08,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:08,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:04:08,869 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:08,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:08,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2098857180, now seen corresponding path program 1 times [2020-07-10 19:04:08,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:08,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1121803503] [2020-07-10 19:04:08,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:09,010 INFO L280 TraceCheckUtils]: 0: Hoare triple {1795#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1785#true} is VALID [2020-07-10 19:04:09,011 INFO L280 TraceCheckUtils]: 1: Hoare triple {1785#true} #valid := #valid[0 := 0]; {1785#true} is VALID [2020-07-10 19:04:09,011 INFO L280 TraceCheckUtils]: 2: Hoare triple {1785#true} assume 0 < #StackHeapBarrier; {1785#true} is VALID [2020-07-10 19:04:09,011 INFO L280 TraceCheckUtils]: 3: Hoare triple {1785#true} assume true; {1785#true} is VALID [2020-07-10 19:04:09,012 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1785#true} {1785#true} #213#return; {1785#true} is VALID [2020-07-10 19:04:09,013 INFO L263 TraceCheckUtils]: 0: Hoare triple {1785#true} call ULTIMATE.init(); {1795#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:09,013 INFO L280 TraceCheckUtils]: 1: Hoare triple {1795#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1785#true} is VALID [2020-07-10 19:04:09,013 INFO L280 TraceCheckUtils]: 2: Hoare triple {1785#true} #valid := #valid[0 := 0]; {1785#true} is VALID [2020-07-10 19:04:09,014 INFO L280 TraceCheckUtils]: 3: Hoare triple {1785#true} assume 0 < #StackHeapBarrier; {1785#true} is VALID [2020-07-10 19:04:09,014 INFO L280 TraceCheckUtils]: 4: Hoare triple {1785#true} assume true; {1785#true} is VALID [2020-07-10 19:04:09,014 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1785#true} {1785#true} #213#return; {1785#true} is VALID [2020-07-10 19:04:09,014 INFO L263 TraceCheckUtils]: 6: Hoare triple {1785#true} call #t~ret18 := main(); {1785#true} is VALID [2020-07-10 19:04:09,015 INFO L280 TraceCheckUtils]: 7: Hoare triple {1785#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {1792#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-10 19:04:09,016 INFO L280 TraceCheckUtils]: 8: Hoare triple {1792#(not (= 0 |main_#t~malloc0.base|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,017 INFO L280 TraceCheckUtils]: 9: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,017 INFO L280 TraceCheckUtils]: 10: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,018 INFO L280 TraceCheckUtils]: 11: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,019 INFO L280 TraceCheckUtils]: 12: Hoare triple {1793#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,019 INFO L280 TraceCheckUtils]: 13: Hoare triple {1793#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,020 INFO L280 TraceCheckUtils]: 14: Hoare triple {1793#(not (= 0 main_~head~0.base))} assume !(0 != #t~nondet1); {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,021 INFO L280 TraceCheckUtils]: 15: Hoare triple {1793#(not (= 0 main_~head~0.base))} havoc #t~nondet1; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,021 INFO L280 TraceCheckUtils]: 16: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-5 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,022 INFO L280 TraceCheckUtils]: 17: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); srcloc: L1010 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,022 INFO L280 TraceCheckUtils]: 18: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,023 INFO L280 TraceCheckUtils]: 19: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,024 INFO L280 TraceCheckUtils]: 20: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,024 INFO L280 TraceCheckUtils]: 21: Hoare triple {1793#(not (= 0 main_~head~0.base))} havoc #t~mem6.base, #t~mem6.offset; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,025 INFO L280 TraceCheckUtils]: 22: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,026 INFO L280 TraceCheckUtils]: 23: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,026 INFO L280 TraceCheckUtils]: 24: Hoare triple {1793#(not (= 0 main_~head~0.base))} havoc #t~mem7.base, #t~mem7.offset; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 19:04:09,027 INFO L280 TraceCheckUtils]: 25: Hoare triple {1793#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1794#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:09,028 INFO L280 TraceCheckUtils]: 26: Hoare triple {1794#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {1786#false} is VALID [2020-07-10 19:04:09,028 INFO L280 TraceCheckUtils]: 27: Hoare triple {1786#false} assume !false; {1786#false} is VALID [2020-07-10 19:04:09,030 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:09,030 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:09,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1121803503] [2020-07-10 19:04:09,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:09,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 19:04:09,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671902376] [2020-07-10 19:04:09,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-10 19:04:09,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:09,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 19:04:09,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:09,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 19:04:09,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:09,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 19:04:09,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:04:09,066 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand 6 states. [2020-07-10 19:04:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:10,052 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2020-07-10 19:04:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 19:04:10,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-10 19:04:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:04:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2020-07-10 19:04:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:04:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2020-07-10 19:04:10,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 161 transitions. [2020-07-10 19:04:10,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:10,254 INFO L225 Difference]: With dead ends: 160 [2020-07-10 19:04:10,254 INFO L226 Difference]: Without dead ends: 158 [2020-07-10 19:04:10,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:04:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-10 19:04:10,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 101. [2020-07-10 19:04:10,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:10,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 101 states. [2020-07-10 19:04:10,546 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 101 states. [2020-07-10 19:04:10,546 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 101 states. [2020-07-10 19:04:10,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:10,551 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2020-07-10 19:04:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2020-07-10 19:04:10,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:10,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:10,553 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 158 states. [2020-07-10 19:04:10,553 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 158 states. [2020-07-10 19:04:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:10,559 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2020-07-10 19:04:10,559 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2020-07-10 19:04:10,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:10,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:10,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:10,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-10 19:04:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2020-07-10 19:04:10,564 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 28 [2020-07-10 19:04:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:10,564 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2020-07-10 19:04:10,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 19:04:10,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 101 states and 104 transitions. [2020-07-10 19:04:10,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2020-07-10 19:04:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 19:04:10,732 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:10,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:10,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 19:04:10,733 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash 578708441, now seen corresponding path program 1 times [2020-07-10 19:04:10,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:10,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [180237630] [2020-07-10 19:04:10,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:10,884 INFO L280 TraceCheckUtils]: 0: Hoare triple {2650#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2640#true} is VALID [2020-07-10 19:04:10,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {2640#true} #valid := #valid[0 := 0]; {2640#true} is VALID [2020-07-10 19:04:10,884 INFO L280 TraceCheckUtils]: 2: Hoare triple {2640#true} assume 0 < #StackHeapBarrier; {2640#true} is VALID [2020-07-10 19:04:10,885 INFO L280 TraceCheckUtils]: 3: Hoare triple {2640#true} assume true; {2640#true} is VALID [2020-07-10 19:04:10,885 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2640#true} {2640#true} #213#return; {2640#true} is VALID [2020-07-10 19:04:10,888 INFO L263 TraceCheckUtils]: 0: Hoare triple {2640#true} call ULTIMATE.init(); {2650#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:10,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {2650#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2640#true} is VALID [2020-07-10 19:04:10,889 INFO L280 TraceCheckUtils]: 2: Hoare triple {2640#true} #valid := #valid[0 := 0]; {2640#true} is VALID [2020-07-10 19:04:10,889 INFO L280 TraceCheckUtils]: 3: Hoare triple {2640#true} assume 0 < #StackHeapBarrier; {2640#true} is VALID [2020-07-10 19:04:10,890 INFO L280 TraceCheckUtils]: 4: Hoare triple {2640#true} assume true; {2640#true} is VALID [2020-07-10 19:04:10,890 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2640#true} {2640#true} #213#return; {2640#true} is VALID [2020-07-10 19:04:10,890 INFO L263 TraceCheckUtils]: 6: Hoare triple {2640#true} call #t~ret18 := main(); {2640#true} is VALID [2020-07-10 19:04:10,891 INFO L280 TraceCheckUtils]: 7: Hoare triple {2640#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {2640#true} is VALID [2020-07-10 19:04:10,891 INFO L280 TraceCheckUtils]: 8: Hoare triple {2640#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {2640#true} is VALID [2020-07-10 19:04:10,891 INFO L280 TraceCheckUtils]: 9: Hoare triple {2640#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {2640#true} is VALID [2020-07-10 19:04:10,891 INFO L280 TraceCheckUtils]: 10: Hoare triple {2640#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {2640#true} is VALID [2020-07-10 19:04:10,892 INFO L280 TraceCheckUtils]: 11: Hoare triple {2640#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {2640#true} is VALID [2020-07-10 19:04:10,892 INFO L280 TraceCheckUtils]: 12: Hoare triple {2640#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2640#true} is VALID [2020-07-10 19:04:10,892 INFO L280 TraceCheckUtils]: 13: Hoare triple {2640#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2640#true} is VALID [2020-07-10 19:04:10,892 INFO L280 TraceCheckUtils]: 14: Hoare triple {2640#true} assume !(0 != #t~nondet1); {2640#true} is VALID [2020-07-10 19:04:10,893 INFO L280 TraceCheckUtils]: 15: Hoare triple {2640#true} havoc #t~nondet1; {2640#true} is VALID [2020-07-10 19:04:10,893 INFO L280 TraceCheckUtils]: 16: Hoare triple {2640#true} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-5 {2640#true} is VALID [2020-07-10 19:04:10,893 INFO L280 TraceCheckUtils]: 17: Hoare triple {2640#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); srcloc: L1010 {2640#true} is VALID [2020-07-10 19:04:10,893 INFO L280 TraceCheckUtils]: 18: Hoare triple {2640#true} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {2640#true} is VALID [2020-07-10 19:04:10,894 INFO L280 TraceCheckUtils]: 19: Hoare triple {2640#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {2640#true} is VALID [2020-07-10 19:04:10,894 INFO L280 TraceCheckUtils]: 20: Hoare triple {2640#true} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {2640#true} is VALID [2020-07-10 19:04:10,894 INFO L280 TraceCheckUtils]: 21: Hoare triple {2640#true} havoc #t~mem6.base, #t~mem6.offset; {2640#true} is VALID [2020-07-10 19:04:10,895 INFO L280 TraceCheckUtils]: 22: Hoare triple {2640#true} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {2640#true} is VALID [2020-07-10 19:04:10,895 INFO L280 TraceCheckUtils]: 23: Hoare triple {2640#true} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {2640#true} is VALID [2020-07-10 19:04:10,895 INFO L280 TraceCheckUtils]: 24: Hoare triple {2640#true} havoc #t~mem7.base, #t~mem7.offset; {2640#true} is VALID [2020-07-10 19:04:10,895 INFO L280 TraceCheckUtils]: 25: Hoare triple {2640#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2640#true} is VALID [2020-07-10 19:04:10,896 INFO L280 TraceCheckUtils]: 26: Hoare triple {2640#true} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {2640#true} is VALID [2020-07-10 19:04:10,896 INFO L280 TraceCheckUtils]: 27: Hoare triple {2640#true} goto; {2640#true} is VALID [2020-07-10 19:04:10,897 INFO L280 TraceCheckUtils]: 28: Hoare triple {2640#true} SUMMARY for call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1019-4 {2647#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem8|)} is VALID [2020-07-10 19:04:10,898 INFO L280 TraceCheckUtils]: 29: Hoare triple {2647#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem8|)} assume !(1 != #t~mem8); {2648#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-10 19:04:10,899 INFO L280 TraceCheckUtils]: 30: Hoare triple {2648#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} havoc #t~mem8; {2648#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-10 19:04:10,900 INFO L280 TraceCheckUtils]: 31: Hoare triple {2648#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} SUMMARY for call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1024-6 {2649#(= |main_#t~mem11| 1)} is VALID [2020-07-10 19:04:10,900 INFO L280 TraceCheckUtils]: 32: Hoare triple {2649#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11); {2641#false} is VALID [2020-07-10 19:04:10,900 INFO L280 TraceCheckUtils]: 33: Hoare triple {2641#false} havoc #t~mem11; {2641#false} is VALID [2020-07-10 19:04:10,901 INFO L280 TraceCheckUtils]: 34: Hoare triple {2641#false} assume !false; {2641#false} is VALID [2020-07-10 19:04:10,902 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:10,902 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:10,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [180237630] [2020-07-10 19:04:10,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:10,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 19:04:10,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272933524] [2020-07-10 19:04:10,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-10 19:04:10,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:10,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 19:04:10,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:10,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 19:04:10,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:10,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 19:04:10,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:04:10,975 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 6 states. [2020-07-10 19:04:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:11,720 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2020-07-10 19:04:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 19:04:11,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-10 19:04:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:04:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2020-07-10 19:04:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:04:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2020-07-10 19:04:11,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 90 transitions. [2020-07-10 19:04:11,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:11,820 INFO L225 Difference]: With dead ends: 101 [2020-07-10 19:04:11,820 INFO L226 Difference]: Without dead ends: 98 [2020-07-10 19:04:11,821 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:04:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-10 19:04:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-07-10 19:04:12,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:12,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 98 states. [2020-07-10 19:04:12,119 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2020-07-10 19:04:12,119 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2020-07-10 19:04:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:12,125 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2020-07-10 19:04:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2020-07-10 19:04:12,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:12,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:12,126 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2020-07-10 19:04:12,126 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2020-07-10 19:04:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:12,130 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2020-07-10 19:04:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2020-07-10 19:04:12,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:12,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:12,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:12,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-10 19:04:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2020-07-10 19:04:12,134 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 35 [2020-07-10 19:04:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:12,134 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2020-07-10 19:04:12,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 19:04:12,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 98 states and 101 transitions. [2020-07-10 19:04:12,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2020-07-10 19:04:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 19:04:12,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:12,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:12,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 19:04:12,293 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:12,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:12,293 INFO L82 PathProgramCache]: Analyzing trace with hash 666566073, now seen corresponding path program 1 times [2020-07-10 19:04:12,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:12,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517193562] [2020-07-10 19:04:12,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:12,826 INFO L280 TraceCheckUtils]: 0: Hoare triple {3269#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3251#true} is VALID [2020-07-10 19:04:12,827 INFO L280 TraceCheckUtils]: 1: Hoare triple {3251#true} #valid := #valid[0 := 0]; {3251#true} is VALID [2020-07-10 19:04:12,827 INFO L280 TraceCheckUtils]: 2: Hoare triple {3251#true} assume 0 < #StackHeapBarrier; {3251#true} is VALID [2020-07-10 19:04:12,828 INFO L280 TraceCheckUtils]: 3: Hoare triple {3251#true} assume true; {3251#true} is VALID [2020-07-10 19:04:12,828 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3251#true} {3251#true} #213#return; {3251#true} is VALID [2020-07-10 19:04:12,829 INFO L263 TraceCheckUtils]: 0: Hoare triple {3251#true} call ULTIMATE.init(); {3269#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:12,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {3269#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3251#true} is VALID [2020-07-10 19:04:12,830 INFO L280 TraceCheckUtils]: 2: Hoare triple {3251#true} #valid := #valid[0 := 0]; {3251#true} is VALID [2020-07-10 19:04:12,830 INFO L280 TraceCheckUtils]: 3: Hoare triple {3251#true} assume 0 < #StackHeapBarrier; {3251#true} is VALID [2020-07-10 19:04:12,831 INFO L280 TraceCheckUtils]: 4: Hoare triple {3251#true} assume true; {3251#true} is VALID [2020-07-10 19:04:12,831 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3251#true} {3251#true} #213#return; {3251#true} is VALID [2020-07-10 19:04:12,831 INFO L263 TraceCheckUtils]: 6: Hoare triple {3251#true} call #t~ret18 := main(); {3251#true} is VALID [2020-07-10 19:04:12,838 INFO L280 TraceCheckUtils]: 7: Hoare triple {3251#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {3258#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} is VALID [2020-07-10 19:04:12,839 INFO L280 TraceCheckUtils]: 8: Hoare triple {3258#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:12,840 INFO L280 TraceCheckUtils]: 9: Hoare triple {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:12,841 INFO L280 TraceCheckUtils]: 10: Hoare triple {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:12,842 INFO L280 TraceCheckUtils]: 11: Hoare triple {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:12,843 INFO L280 TraceCheckUtils]: 12: Hoare triple {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:12,843 INFO L280 TraceCheckUtils]: 13: Hoare triple {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:12,844 INFO L280 TraceCheckUtils]: 14: Hoare triple {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} assume !(0 != #t~nondet1); {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:12,844 INFO L280 TraceCheckUtils]: 15: Hoare triple {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} havoc #t~nondet1; {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:12,846 INFO L280 TraceCheckUtils]: 16: Hoare triple {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-5 {3261#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:12,847 INFO L280 TraceCheckUtils]: 17: Hoare triple {3261#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); srcloc: L1010 {3262#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= |main_#t~malloc5.base| main_~x~0.base)))} is VALID [2020-07-10 19:04:12,849 INFO L280 TraceCheckUtils]: 18: Hoare triple {3262#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= |main_#t~malloc5.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-10 19:04:12,850 INFO L280 TraceCheckUtils]: 19: Hoare triple {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {3264#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.base|) (not (= |main_#t~mem6.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:12,852 INFO L280 TraceCheckUtils]: 20: Hoare triple {3264#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.base|) (not (= |main_#t~mem6.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-10 19:04:12,857 INFO L280 TraceCheckUtils]: 21: Hoare triple {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} havoc #t~mem6.base, #t~mem6.offset; {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-10 19:04:12,858 INFO L280 TraceCheckUtils]: 22: Hoare triple {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {3265#(and (not (= |main_#t~mem7.base| main_~head~0.base)) (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} is VALID [2020-07-10 19:04:12,860 INFO L280 TraceCheckUtils]: 23: Hoare triple {3265#(and (not (= |main_#t~mem7.base| main_~head~0.base)) (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {3266#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} is VALID [2020-07-10 19:04:12,861 INFO L280 TraceCheckUtils]: 24: Hoare triple {3266#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} havoc #t~mem7.base, #t~mem7.offset; {3266#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} is VALID [2020-07-10 19:04:12,862 INFO L280 TraceCheckUtils]: 25: Hoare triple {3266#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-10 19:04:12,862 INFO L280 TraceCheckUtils]: 26: Hoare triple {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-10 19:04:12,869 INFO L280 TraceCheckUtils]: 27: Hoare triple {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} goto; {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-10 19:04:12,871 INFO L280 TraceCheckUtils]: 28: Hoare triple {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} SUMMARY for call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1019-4 {3268#(= 1 |main_#t~mem8|)} is VALID [2020-07-10 19:04:12,871 INFO L280 TraceCheckUtils]: 29: Hoare triple {3268#(= 1 |main_#t~mem8|)} assume !!(1 != #t~mem8); {3252#false} is VALID [2020-07-10 19:04:12,871 INFO L280 TraceCheckUtils]: 30: Hoare triple {3252#false} havoc #t~mem8; {3252#false} is VALID [2020-07-10 19:04:12,872 INFO L280 TraceCheckUtils]: 31: Hoare triple {3252#false} SUMMARY for call #t~mem9 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-7 {3252#false} is VALID [2020-07-10 19:04:12,872 INFO L280 TraceCheckUtils]: 32: Hoare triple {3252#false} assume !(0 == #t~mem9); {3252#false} is VALID [2020-07-10 19:04:12,872 INFO L280 TraceCheckUtils]: 33: Hoare triple {3252#false} havoc #t~mem9; {3252#false} is VALID [2020-07-10 19:04:12,872 INFO L280 TraceCheckUtils]: 34: Hoare triple {3252#false} assume !false; {3252#false} is VALID [2020-07-10 19:04:12,875 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:12,875 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:12,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517193562] [2020-07-10 19:04:12,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:12,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-10 19:04:12,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691174062] [2020-07-10 19:04:12,879 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-07-10 19:04:12,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:12,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 19:04:12,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:12,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 19:04:12,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:12,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 19:04:12,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-10 19:04:12,926 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 14 states. [2020-07-10 19:04:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:15,906 INFO L93 Difference]: Finished difference Result 229 states and 235 transitions. [2020-07-10 19:04:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-10 19:04:15,907 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-07-10 19:04:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:15,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 19:04:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 232 transitions. [2020-07-10 19:04:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 19:04:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 232 transitions. [2020-07-10 19:04:15,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 232 transitions. [2020-07-10 19:04:16,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:16,194 INFO L225 Difference]: With dead ends: 229 [2020-07-10 19:04:16,194 INFO L226 Difference]: Without dead ends: 186 [2020-07-10 19:04:16,196 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2020-07-10 19:04:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-07-10 19:04:16,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 113. [2020-07-10 19:04:16,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:16,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 113 states. [2020-07-10 19:04:16,707 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 113 states. [2020-07-10 19:04:16,707 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 113 states. [2020-07-10 19:04:16,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:16,714 INFO L93 Difference]: Finished difference Result 186 states and 190 transitions. [2020-07-10 19:04:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 190 transitions. [2020-07-10 19:04:16,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:16,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:16,715 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 186 states. [2020-07-10 19:04:16,715 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 186 states. [2020-07-10 19:04:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:16,722 INFO L93 Difference]: Finished difference Result 186 states and 190 transitions. [2020-07-10 19:04:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 190 transitions. [2020-07-10 19:04:16,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:16,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:16,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:16,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-10 19:04:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2020-07-10 19:04:16,727 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 35 [2020-07-10 19:04:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:16,727 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2020-07-10 19:04:16,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 19:04:16,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 113 states and 116 transitions. [2020-07-10 19:04:16,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2020-07-10 19:04:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 19:04:16,963 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:16,963 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:16,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 19:04:16,963 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:16,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:16,964 INFO L82 PathProgramCache]: Analyzing trace with hash 323200756, now seen corresponding path program 1 times [2020-07-10 19:04:16,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:16,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [448161428] [2020-07-10 19:04:16,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:17,371 INFO L280 TraceCheckUtils]: 0: Hoare triple {4373#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4352#true} is VALID [2020-07-10 19:04:17,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {4352#true} #valid := #valid[0 := 0]; {4352#true} is VALID [2020-07-10 19:04:17,371 INFO L280 TraceCheckUtils]: 2: Hoare triple {4352#true} assume 0 < #StackHeapBarrier; {4352#true} is VALID [2020-07-10 19:04:17,372 INFO L280 TraceCheckUtils]: 3: Hoare triple {4352#true} assume true; {4352#true} is VALID [2020-07-10 19:04:17,372 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4352#true} {4352#true} #213#return; {4352#true} is VALID [2020-07-10 19:04:17,373 INFO L263 TraceCheckUtils]: 0: Hoare triple {4352#true} call ULTIMATE.init(); {4373#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:17,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {4373#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4352#true} is VALID [2020-07-10 19:04:17,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {4352#true} #valid := #valid[0 := 0]; {4352#true} is VALID [2020-07-10 19:04:17,374 INFO L280 TraceCheckUtils]: 3: Hoare triple {4352#true} assume 0 < #StackHeapBarrier; {4352#true} is VALID [2020-07-10 19:04:17,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {4352#true} assume true; {4352#true} is VALID [2020-07-10 19:04:17,374 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4352#true} {4352#true} #213#return; {4352#true} is VALID [2020-07-10 19:04:17,374 INFO L263 TraceCheckUtils]: 6: Hoare triple {4352#true} call #t~ret18 := main(); {4352#true} is VALID [2020-07-10 19:04:17,376 INFO L280 TraceCheckUtils]: 7: Hoare triple {4352#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {4359#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-10 19:04:17,377 INFO L280 TraceCheckUtils]: 8: Hoare triple {4359#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {4360#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-10 19:04:17,378 INFO L280 TraceCheckUtils]: 9: Hoare triple {4360#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {4360#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-10 19:04:17,379 INFO L280 TraceCheckUtils]: 10: Hoare triple {4360#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {4360#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-10 19:04:17,383 INFO L280 TraceCheckUtils]: 11: Hoare triple {4360#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {4360#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-10 19:04:17,384 INFO L280 TraceCheckUtils]: 12: Hoare triple {4360#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:17,385 INFO L280 TraceCheckUtils]: 13: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:17,385 INFO L280 TraceCheckUtils]: 14: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1); {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:17,386 INFO L280 TraceCheckUtils]: 15: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} havoc #t~nondet1; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:17,386 INFO L280 TraceCheckUtils]: 16: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L1004 {4362#(and (= (select |#valid| |main_#t~malloc2.base|) 1) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-10 19:04:17,387 INFO L280 TraceCheckUtils]: 17: Hoare triple {4362#(and (= (select |#valid| |main_#t~malloc2.base|) 1) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1004-1 {4363#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-10 19:04:17,388 INFO L280 TraceCheckUtils]: 18: Hoare triple {4363#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1004-2 {4364#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-10 19:04:17,390 INFO L280 TraceCheckUtils]: 19: Hoare triple {4364#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L1005 {4365#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-10 19:04:17,390 INFO L280 TraceCheckUtils]: 20: Hoare triple {4365#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem3.base, #t~mem3.offset; {4365#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-10 19:04:17,391 INFO L280 TraceCheckUtils]: 21: Hoare triple {4365#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1006 {4366#(= 1 (select |#valid| |main_#t~mem4.base|))} is VALID [2020-07-10 19:04:17,393 INFO L280 TraceCheckUtils]: 22: Hoare triple {4366#(= 1 (select |#valid| |main_#t~mem4.base|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:17,396 INFO L280 TraceCheckUtils]: 23: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} havoc #t~mem4.base, #t~mem4.offset; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:17,397 INFO L280 TraceCheckUtils]: 24: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call write~int(0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1007 {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:17,398 INFO L280 TraceCheckUtils]: 25: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:17,398 INFO L280 TraceCheckUtils]: 26: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} goto; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:17,399 INFO L280 TraceCheckUtils]: 27: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:17,399 INFO L280 TraceCheckUtils]: 28: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1); {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:17,400 INFO L280 TraceCheckUtils]: 29: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} havoc #t~nondet1; {4361#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 19:04:17,400 INFO L280 TraceCheckUtils]: 30: Hoare triple {4361#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L1004 {4367#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-10 19:04:17,401 INFO L280 TraceCheckUtils]: 31: Hoare triple {4367#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1004-1 {4368#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-10 19:04:17,402 INFO L280 TraceCheckUtils]: 32: Hoare triple {4368#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1004-2 {4369#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-10 19:04:17,403 INFO L280 TraceCheckUtils]: 33: Hoare triple {4369#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L1005 {4370#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-10 19:04:17,403 INFO L280 TraceCheckUtils]: 34: Hoare triple {4370#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem3.base, #t~mem3.offset; {4370#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-10 19:04:17,404 INFO L280 TraceCheckUtils]: 35: Hoare triple {4370#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1006 {4371#(not (= 0 |main_#t~mem4.base|))} is VALID [2020-07-10 19:04:17,405 INFO L280 TraceCheckUtils]: 36: Hoare triple {4371#(not (= 0 |main_#t~mem4.base|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {4372#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:17,405 INFO L280 TraceCheckUtils]: 37: Hoare triple {4372#(not (= 0 main_~x~0.base))} havoc #t~mem4.base, #t~mem4.offset; {4372#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:17,406 INFO L280 TraceCheckUtils]: 38: Hoare triple {4372#(not (= 0 main_~x~0.base))} SUMMARY for call write~int(0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1007 {4372#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:17,406 INFO L280 TraceCheckUtils]: 39: Hoare triple {4372#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {4353#false} is VALID [2020-07-10 19:04:17,407 INFO L280 TraceCheckUtils]: 40: Hoare triple {4353#false} assume !false; {4353#false} is VALID [2020-07-10 19:04:17,411 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:17,411 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:17,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [448161428] [2020-07-10 19:04:17,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:17,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-10 19:04:17,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664296065] [2020-07-10 19:04:17,413 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2020-07-10 19:04:17,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:17,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-10 19:04:17,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:17,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-10 19:04:17,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:17,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-10 19:04:17,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2020-07-10 19:04:17,464 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand 17 states. [2020-07-10 19:04:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:20,967 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2020-07-10 19:04:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 19:04:20,967 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2020-07-10 19:04:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 19:04:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 143 transitions. [2020-07-10 19:04:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 19:04:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 143 transitions. [2020-07-10 19:04:20,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 143 transitions. [2020-07-10 19:04:21,158 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:21,162 INFO L225 Difference]: With dead ends: 146 [2020-07-10 19:04:21,162 INFO L226 Difference]: Without dead ends: 144 [2020-07-10 19:04:21,162 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2020-07-10 19:04:21,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-10 19:04:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 100. [2020-07-10 19:04:21,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:21,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 100 states. [2020-07-10 19:04:21,616 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 100 states. [2020-07-10 19:04:21,616 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 100 states. [2020-07-10 19:04:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:21,621 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2020-07-10 19:04:21,621 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2020-07-10 19:04:21,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:21,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:21,622 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 144 states. [2020-07-10 19:04:21,622 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 144 states. [2020-07-10 19:04:21,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:21,627 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2020-07-10 19:04:21,627 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2020-07-10 19:04:21,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:21,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:21,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:21,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-10 19:04:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2020-07-10 19:04:21,631 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 41 [2020-07-10 19:04:21,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:21,631 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2020-07-10 19:04:21,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-10 19:04:21,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 100 states and 103 transitions. [2020-07-10 19:04:21,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2020-07-10 19:04:21,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 19:04:21,869 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:21,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:21,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 19:04:21,870 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:21,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:21,870 INFO L82 PathProgramCache]: Analyzing trace with hash 957359950, now seen corresponding path program 1 times [2020-07-10 19:04:21,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:21,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [854674125] [2020-07-10 19:04:21,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 19:04:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 19:04:21,990 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:21,991 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-10 19:04:21,991 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 19:04:21,992 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 19:04:22,009 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 19:04:22,010 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 19:04:22,010 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 19:04:22,010 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 19:04:22,010 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:04:22,010 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:04:22,010 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:04:22,010 WARN L170 areAnnotationChecker]: L993 has no Hoare annotation [2020-07-10 19:04:22,010 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-10 19:04:22,011 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 19:04:22,011 WARN L170 areAnnotationChecker]: L994 has no Hoare annotation [2020-07-10 19:04:22,011 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 19:04:22,011 WARN L170 areAnnotationChecker]: L994-1 has no Hoare annotation [2020-07-10 19:04:22,011 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 19:04:22,011 WARN L170 areAnnotationChecker]: L995 has no Hoare annotation [2020-07-10 19:04:22,011 WARN L170 areAnnotationChecker]: L996 has no Hoare annotation [2020-07-10 19:04:22,011 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-10 19:04:22,011 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-10 19:04:22,011 WARN L170 areAnnotationChecker]: L1001-5 has no Hoare annotation [2020-07-10 19:04:22,012 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2020-07-10 19:04:22,012 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2020-07-10 19:04:22,012 WARN L170 areAnnotationChecker]: L1010 has no Hoare annotation [2020-07-10 19:04:22,012 WARN L170 areAnnotationChecker]: L1001-2 has no Hoare annotation [2020-07-10 19:04:22,012 WARN L170 areAnnotationChecker]: L1001-4 has no Hoare annotation [2020-07-10 19:04:22,012 WARN L170 areAnnotationChecker]: L1011 has no Hoare annotation [2020-07-10 19:04:22,012 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-10 19:04:22,012 WARN L170 areAnnotationChecker]: L1011-1 has no Hoare annotation [2020-07-10 19:04:22,012 WARN L170 areAnnotationChecker]: L1004-1 has no Hoare annotation [2020-07-10 19:04:22,012 WARN L170 areAnnotationChecker]: L1012 has no Hoare annotation [2020-07-10 19:04:22,013 WARN L170 areAnnotationChecker]: L1004-2 has no Hoare annotation [2020-07-10 19:04:22,013 WARN L170 areAnnotationChecker]: L1012-1 has no Hoare annotation [2020-07-10 19:04:22,013 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2020-07-10 19:04:22,013 WARN L170 areAnnotationChecker]: L1013 has no Hoare annotation [2020-07-10 19:04:22,013 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2020-07-10 19:04:22,013 WARN L170 areAnnotationChecker]: L1013-1 has no Hoare annotation [2020-07-10 19:04:22,013 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2020-07-10 19:04:22,013 WARN L170 areAnnotationChecker]: L1013-2 has no Hoare annotation [2020-07-10 19:04:22,013 WARN L170 areAnnotationChecker]: L1006-1 has no Hoare annotation [2020-07-10 19:04:22,013 WARN L170 areAnnotationChecker]: L1015 has no Hoare annotation [2020-07-10 19:04:22,014 WARN L170 areAnnotationChecker]: L1006-2 has no Hoare annotation [2020-07-10 19:04:22,014 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-10 19:04:22,014 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-10 19:04:22,014 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-10 19:04:22,014 WARN L170 areAnnotationChecker]: L1007 has no Hoare annotation [2020-07-10 19:04:22,014 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-10 19:04:22,014 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-10 19:04:22,014 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-10 19:04:22,014 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-10 19:04:22,015 WARN L170 areAnnotationChecker]: L1017-3 has no Hoare annotation [2020-07-10 19:04:22,015 WARN L170 areAnnotationChecker]: L1017-3 has no Hoare annotation [2020-07-10 19:04:22,015 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-10 19:04:22,015 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-10 19:04:22,015 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-10 19:04:22,015 WARN L170 areAnnotationChecker]: L1024-6 has no Hoare annotation [2020-07-10 19:04:22,015 WARN L170 areAnnotationChecker]: L1024-6 has no Hoare annotation [2020-07-10 19:04:22,015 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-10 19:04:22,015 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-10 19:04:22,016 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-10 19:04:22,016 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-10 19:04:22,016 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-10 19:04:22,016 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-10 19:04:22,016 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-10 19:04:22,016 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-10 19:04:22,016 WARN L170 areAnnotationChecker]: L1024-7 has no Hoare annotation [2020-07-10 19:04:22,016 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2020-07-10 19:04:22,016 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2020-07-10 19:04:22,017 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2020-07-10 19:04:22,017 WARN L170 areAnnotationChecker]: L1024-4 has no Hoare annotation [2020-07-10 19:04:22,017 WARN L170 areAnnotationChecker]: L1025 has no Hoare annotation [2020-07-10 19:04:22,017 WARN L170 areAnnotationChecker]: L1021-7 has no Hoare annotation [2020-07-10 19:04:22,017 WARN L170 areAnnotationChecker]: L1021-7 has no Hoare annotation [2020-07-10 19:04:22,017 WARN L170 areAnnotationChecker]: L1024-2 has no Hoare annotation [2020-07-10 19:04:22,017 WARN L170 areAnnotationChecker]: L1024-2 has no Hoare annotation [2020-07-10 19:04:22,017 WARN L170 areAnnotationChecker]: L1024-5 has no Hoare annotation [2020-07-10 19:04:22,017 WARN L170 areAnnotationChecker]: L1024-5 has no Hoare annotation [2020-07-10 19:04:22,018 WARN L170 areAnnotationChecker]: L1025-1 has no Hoare annotation [2020-07-10 19:04:22,018 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-10 19:04:22,018 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-10 19:04:22,018 WARN L170 areAnnotationChecker]: L1021-8 has no Hoare annotation [2020-07-10 19:04:22,018 WARN L170 areAnnotationChecker]: L1026-7 has no Hoare annotation [2020-07-10 19:04:22,018 WARN L170 areAnnotationChecker]: L1026-7 has no Hoare annotation [2020-07-10 19:04:22,018 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-10 19:04:22,018 WARN L170 areAnnotationChecker]: L1021-5 has no Hoare annotation [2020-07-10 19:04:22,018 WARN L170 areAnnotationChecker]: L1022 has no Hoare annotation [2020-07-10 19:04:22,018 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2020-07-10 19:04:22,019 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2020-07-10 19:04:22,019 WARN L170 areAnnotationChecker]: L1026-8 has no Hoare annotation [2020-07-10 19:04:22,019 WARN L170 areAnnotationChecker]: L1021-3 has no Hoare annotation [2020-07-10 19:04:22,019 WARN L170 areAnnotationChecker]: L1021-3 has no Hoare annotation [2020-07-10 19:04:22,019 WARN L170 areAnnotationChecker]: L1021-6 has no Hoare annotation [2020-07-10 19:04:22,019 WARN L170 areAnnotationChecker]: L1021-6 has no Hoare annotation [2020-07-10 19:04:22,019 WARN L170 areAnnotationChecker]: L1022-1 has no Hoare annotation [2020-07-10 19:04:22,019 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2020-07-10 19:04:22,019 WARN L170 areAnnotationChecker]: L1026-5 has no Hoare annotation [2020-07-10 19:04:22,019 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2020-07-10 19:04:22,020 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2020-07-10 19:04:22,020 WARN L170 areAnnotationChecker]: L1026-3 has no Hoare annotation [2020-07-10 19:04:22,020 WARN L170 areAnnotationChecker]: L1026-3 has no Hoare annotation [2020-07-10 19:04:22,020 WARN L170 areAnnotationChecker]: L1026-6 has no Hoare annotation [2020-07-10 19:04:22,020 WARN L170 areAnnotationChecker]: L1026-6 has no Hoare annotation [2020-07-10 19:04:22,020 WARN L170 areAnnotationChecker]: L1036-6 has no Hoare annotation [2020-07-10 19:04:22,020 WARN L170 areAnnotationChecker]: L1036-6 has no Hoare annotation [2020-07-10 19:04:22,020 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-10 19:04:22,020 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-10 19:04:22,020 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2020-07-10 19:04:22,021 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2020-07-10 19:04:22,021 WARN L170 areAnnotationChecker]: L1036-7 has no Hoare annotation [2020-07-10 19:04:22,021 WARN L170 areAnnotationChecker]: L1030-2 has no Hoare annotation [2020-07-10 19:04:22,021 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2020-07-10 19:04:22,021 WARN L170 areAnnotationChecker]: L1036-1 has no Hoare annotation [2020-07-10 19:04:22,021 WARN L170 areAnnotationChecker]: L1036-4 has no Hoare annotation [2020-07-10 19:04:22,021 WARN L170 areAnnotationChecker]: L1037 has no Hoare annotation [2020-07-10 19:04:22,021 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-10 19:04:22,021 WARN L170 areAnnotationChecker]: L1036-2 has no Hoare annotation [2020-07-10 19:04:22,021 WARN L170 areAnnotationChecker]: L1036-2 has no Hoare annotation [2020-07-10 19:04:22,021 WARN L170 areAnnotationChecker]: L1036-5 has no Hoare annotation [2020-07-10 19:04:22,022 WARN L170 areAnnotationChecker]: L1036-5 has no Hoare annotation [2020-07-10 19:04:22,022 WARN L170 areAnnotationChecker]: L1037-1 has no Hoare annotation [2020-07-10 19:04:22,022 WARN L170 areAnnotationChecker]: L1033 has no Hoare annotation [2020-07-10 19:04:22,022 WARN L170 areAnnotationChecker]: L1038 has no Hoare annotation [2020-07-10 19:04:22,022 WARN L170 areAnnotationChecker]: L1033-1 has no Hoare annotation [2020-07-10 19:04:22,022 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-10 19:04:22,022 WARN L170 areAnnotationChecker]: L1033-2 has no Hoare annotation [2020-07-10 19:04:22,022 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 19:04:22,022 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2020-07-10 19:04:22,023 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 19:04:22,023 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:22,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 07:04:22 BoogieIcfgContainer [2020-07-10 19:04:22,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 19:04:22,030 INFO L168 Benchmark]: Toolchain (without parser) took 19671.56 ms. Allocated memory was 144.7 MB in the beginning and 437.3 MB in the end (delta: 292.6 MB). Free memory was 101.9 MB in the beginning and 389.6 MB in the end (delta: -287.7 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:22,031 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 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:22,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.69 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 168.5 MB in the end (delta: -66.8 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:22,032 INFO L168 Benchmark]: Boogie Preprocessor took 71.85 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:22,033 INFO L168 Benchmark]: RCFGBuilder took 800.73 ms. Allocated memory is still 201.9 MB. Free memory was 165.0 MB in the beginning and 97.5 MB in the end (delta: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:22,034 INFO L168 Benchmark]: TraceAbstraction took 18042.34 ms. Allocated memory was 201.9 MB in the beginning and 437.3 MB in the end (delta: 235.4 MB). Free memory was 97.5 MB in the beginning and 389.6 MB in the end (delta: -292.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 19:04:22,037 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.69 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 168.5 MB in the end (delta: -66.8 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.85 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 800.73 ms. Allocated memory is still 201.9 MB. Free memory was 165.0 MB in the beginning and 97.5 MB in the end (delta: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18042.34 ms. Allocated memory was 201.9 MB in the beginning and 437.3 MB in the end (delta: 235.4 MB). Free memory was 97.5 MB in the beginning and 389.6 MB in the end (delta: -292.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1026]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L993] SLL* head = malloc(sizeof(SLL)); [L994] head->next = ((void*)0) [L995] head->prev = ((void*)0) [L996] head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] x->data = 1 [L1011] x->next = malloc(sizeof(SLL)) [L1012] EXPR x->next [L1012] x->next->prev = x [L1013] EXPR x->next [L1013] x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1019] EXPR x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR x->data [L1024] COND FALSE !(!(1 == x->data)) [L1025] EXPR x->next [L1025] x = x->next [L1026] EXPR x->data [L1026] COND TRUE !(2 != x->data) [L1026] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 101 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.9s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 425 SDtfs, 1389 SDslu, 1656 SDs, 0 SdLazy, 1852 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 6 MinimizatonAttempts, 243 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...