/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/list-properties/list-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:19:41,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:19:41,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:19:41,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:19:41,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:19:41,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:19:41,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:19:41,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:19:41,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:19:41,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:19:41,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:19:41,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:19:41,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:19:41,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:19:41,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:19:41,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:19:41,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:19:41,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:19:41,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:19:41,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:19:41,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:19:41,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:19:41,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:19:41,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:19:41,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:19:41,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:19:41,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:19:41,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:19:41,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:19:41,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:19:41,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:19:41,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:19:41,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:19:41,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:19:41,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:19:41,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:19:41,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:19:41,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:19:41,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:19:41,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:19:41,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:19:41,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:19:41,412 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:19:41,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:19:41,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:19:41,414 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:19:41,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:19:41,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:19:41,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:19:41,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:19:41,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:19:41,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:19:41,415 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:19:41,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:19:41,416 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:19:41,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:19:41,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:19:41,416 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:19:41,417 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:19:41,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:19:41,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:19:41,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:19:41,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:19:41,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:19:41,418 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:19:41,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:19:41,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:19:41,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:19:41,736 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:19:41,737 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:19:41,738 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list-2.i [2020-07-18 00:19:41,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f350cf1/99af8530acb34a86a168e8ead6ac34b3/FLAGf004c7982 [2020-07-18 00:19:42,370 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:19:42,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list-2.i [2020-07-18 00:19:42,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f350cf1/99af8530acb34a86a168e8ead6ac34b3/FLAGf004c7982 [2020-07-18 00:19:42,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f350cf1/99af8530acb34a86a168e8ead6ac34b3 [2020-07-18 00:19:42,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:19:42,733 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:19:42,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:19:42,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:19:42,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:19:42,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:19:42" (1/1) ... [2020-07-18 00:19:42,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dbfca2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:19:42, skipping insertion in model container [2020-07-18 00:19:42,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:19:42" (1/1) ... [2020-07-18 00:19:42,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:19:42,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:19:43,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:19:43,259 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:19:43,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:19:43,401 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:19:43,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:19:43 WrapperNode [2020-07-18 00:19:43,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:19:43,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:19:43,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:19:43,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:19:43,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:19:43" (1/1) ... [2020-07-18 00:19:43,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:19:43" (1/1) ... [2020-07-18 00:19:43,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:19:43" (1/1) ... [2020-07-18 00:19:43,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:19:43" (1/1) ... [2020-07-18 00:19:43,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:19:43" (1/1) ... [2020-07-18 00:19:43,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:19:43" (1/1) ... [2020-07-18 00:19:43,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:19:43" (1/1) ... [2020-07-18 00:19:43,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:19:43,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:19:43,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:19:43,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:19:43,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:19:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:19:43,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:19:43,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:19:43,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-18 00:19:43,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-18 00:19:43,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-18 00:19:43,584 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-18 00:19:43,584 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-18 00:19:43,584 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-18 00:19:43,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:19:43,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:19:43,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:19:43,585 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-18 00:19:43,585 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-18 00:19:43,585 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-18 00:19:43,585 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-18 00:19:43,585 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-18 00:19:43,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-18 00:19:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-18 00:19:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-18 00:19:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-18 00:19:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-18 00:19:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-18 00:19:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-18 00:19:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-18 00:19:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-18 00:19:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-18 00:19:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-18 00:19:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-18 00:19:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-18 00:19:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-18 00:19:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-18 00:19:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-18 00:19:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-18 00:19:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-18 00:19:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-18 00:19:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-18 00:19:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-18 00:19:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-18 00:19:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-18 00:19:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-18 00:19:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-18 00:19:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-18 00:19:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-18 00:19:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-18 00:19:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-18 00:19:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-18 00:19:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-18 00:19:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-18 00:19:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-18 00:19:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-18 00:19:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-18 00:19:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-18 00:19:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-18 00:19:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-18 00:19:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-18 00:19:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-18 00:19:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-18 00:19:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-18 00:19:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-18 00:19:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-18 00:19:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-18 00:19:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-18 00:19:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-18 00:19:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-18 00:19:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-18 00:19:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-18 00:19:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:19:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-18 00:19:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-18 00:19:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 00:19:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-18 00:19:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-18 00:19:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-18 00:19:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-18 00:19:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:19:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-18 00:19:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-18 00:19:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-18 00:19:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-18 00:19:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-18 00:19:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-18 00:19:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-18 00:19:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-18 00:19:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-18 00:19:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-18 00:19:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-18 00:19:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-18 00:19:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-18 00:19:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-18 00:19:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-18 00:19:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-18 00:19:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-18 00:19:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-18 00:19:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-18 00:19:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-18 00:19:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-18 00:19:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-18 00:19:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-18 00:19:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-18 00:19:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-18 00:19:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-18 00:19:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-18 00:19:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-18 00:19:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-18 00:19:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-18 00:19:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-18 00:19:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-18 00:19:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-18 00:19:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-18 00:19:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-18 00:19:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-18 00:19:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-18 00:19:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-18 00:19:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-18 00:19:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-18 00:19:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-18 00:19:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-18 00:19:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-18 00:19:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-18 00:19:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:19:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:19:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:19:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 00:19:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 00:19:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:19:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:19:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:19:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:19:43,962 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-18 00:19:44,284 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:19:44,285 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-18 00:19:44,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:19:44 BoogieIcfgContainer [2020-07-18 00:19:44,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:19:44,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:19:44,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:19:44,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:19:44,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:19:42" (1/3) ... [2020-07-18 00:19:44,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238ad8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:19:44, skipping insertion in model container [2020-07-18 00:19:44,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:19:43" (2/3) ... [2020-07-18 00:19:44,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238ad8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:19:44, skipping insertion in model container [2020-07-18 00:19:44,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:19:44" (3/3) ... [2020-07-18 00:19:44,299 INFO L109 eAbstractionObserver]: Analyzing ICFG list-2.i [2020-07-18 00:19:44,311 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:19:44,321 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:19:44,337 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:19:44,360 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:19:44,361 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:19:44,361 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:19:44,362 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:19:44,362 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:19:44,363 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:19:44,363 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:19:44,363 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:19:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2020-07-18 00:19:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-18 00:19:44,394 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:19:44,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:19:44,396 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:19:44,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:19:44,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1227115345, now seen corresponding path program 1 times [2020-07-18 00:19:44,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:19:44,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1045715033] [2020-07-18 00:19:44,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:19:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:19:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:19:44,669 INFO L280 TraceCheckUtils]: 0: Hoare triple {78#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {71#true} is VALID [2020-07-18 00:19:44,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {71#true} #valid := #valid[0 := 0]; {71#true} is VALID [2020-07-18 00:19:44,670 INFO L280 TraceCheckUtils]: 2: Hoare triple {71#true} assume 0 < #StackHeapBarrier; {71#true} is VALID [2020-07-18 00:19:44,671 INFO L280 TraceCheckUtils]: 3: Hoare triple {71#true} assume true; {71#true} is VALID [2020-07-18 00:19:44,671 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {71#true} {71#true} #155#return; {71#true} is VALID [2020-07-18 00:19:44,677 INFO L263 TraceCheckUtils]: 0: Hoare triple {71#true} call ULTIMATE.init(); {78#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:19:44,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {71#true} is VALID [2020-07-18 00:19:44,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {71#true} #valid := #valid[0 := 0]; {71#true} is VALID [2020-07-18 00:19:44,678 INFO L280 TraceCheckUtils]: 3: Hoare triple {71#true} assume 0 < #StackHeapBarrier; {71#true} is VALID [2020-07-18 00:19:44,679 INFO L280 TraceCheckUtils]: 4: Hoare triple {71#true} assume true; {71#true} is VALID [2020-07-18 00:19:44,679 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {71#true} {71#true} #155#return; {71#true} is VALID [2020-07-18 00:19:44,679 INFO L263 TraceCheckUtils]: 6: Hoare triple {71#true} call #t~ret14 := main(); {71#true} is VALID [2020-07-18 00:19:44,680 INFO L280 TraceCheckUtils]: 7: Hoare triple {71#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {71#true} is VALID [2020-07-18 00:19:44,680 INFO L280 TraceCheckUtils]: 8: Hoare triple {71#true} ~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {71#true} is VALID [2020-07-18 00:19:44,680 INFO L280 TraceCheckUtils]: 9: Hoare triple {71#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {71#true} is VALID [2020-07-18 00:19:44,681 INFO L280 TraceCheckUtils]: 10: Hoare triple {71#true} havoc ~t~0.base, ~t~0.offset; {71#true} is VALID [2020-07-18 00:19:44,681 INFO L280 TraceCheckUtils]: 11: Hoare triple {71#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {71#true} is VALID [2020-07-18 00:19:44,682 INFO L280 TraceCheckUtils]: 12: Hoare triple {71#true} assume !true; {72#false} is VALID [2020-07-18 00:19:44,683 INFO L280 TraceCheckUtils]: 13: Hoare triple {72#false} assume !true; {72#false} is VALID [2020-07-18 00:19:44,683 INFO L280 TraceCheckUtils]: 14: Hoare triple {72#false} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L532-5 {72#false} is VALID [2020-07-18 00:19:44,683 INFO L280 TraceCheckUtils]: 15: Hoare triple {72#false} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {72#false} is VALID [2020-07-18 00:19:44,684 INFO L280 TraceCheckUtils]: 16: Hoare triple {72#false} assume !true; {72#false} is VALID [2020-07-18 00:19:44,684 INFO L280 TraceCheckUtils]: 17: Hoare triple {72#false} assume !true; {72#false} is VALID [2020-07-18 00:19:44,684 INFO L280 TraceCheckUtils]: 18: Hoare triple {72#false} SUMMARY for call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-5 {72#false} is VALID [2020-07-18 00:19:44,685 INFO L280 TraceCheckUtils]: 19: Hoare triple {72#false} assume 3 != #t~mem13; {72#false} is VALID [2020-07-18 00:19:44,685 INFO L280 TraceCheckUtils]: 20: Hoare triple {72#false} havoc #t~mem13; {72#false} is VALID [2020-07-18 00:19:44,686 INFO L280 TraceCheckUtils]: 21: Hoare triple {72#false} assume !false; {72#false} is VALID [2020-07-18 00:19:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:19:44,691 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:19:44,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1045715033] [2020-07-18 00:19:44,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:19:44,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:19:44,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536429082] [2020-07-18 00:19:44,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-18 00:19:44,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:19:44,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:19:44,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:44,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:19:44,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:19:44,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:19:44,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:19:44,762 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2020-07-18 00:19:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:45,106 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2020-07-18 00:19:45,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:19:45,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-18 00:19:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:19:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:19:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2020-07-18 00:19:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:19:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2020-07-18 00:19:45,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2020-07-18 00:19:45,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:45,290 INFO L225 Difference]: With dead ends: 110 [2020-07-18 00:19:45,290 INFO L226 Difference]: Without dead ends: 57 [2020-07-18 00:19:45,294 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:19:45,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-18 00:19:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-07-18 00:19:45,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:19:45,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2020-07-18 00:19:45,365 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2020-07-18 00:19:45,366 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2020-07-18 00:19:45,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:45,372 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2020-07-18 00:19:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2020-07-18 00:19:45,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:45,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:45,373 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2020-07-18 00:19:45,374 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2020-07-18 00:19:45,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:45,379 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2020-07-18 00:19:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2020-07-18 00:19:45,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:45,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:45,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:19:45,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:19:45,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-18 00:19:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2020-07-18 00:19:45,387 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 22 [2020-07-18 00:19:45,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:19:45,387 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2020-07-18 00:19:45,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:19:45,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 60 transitions. [2020-07-18 00:19:45,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:45,459 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2020-07-18 00:19:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 00:19:45,460 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:19:45,460 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] [2020-07-18 00:19:45,461 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:19:45,461 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:19:45,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:19:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1237633361, now seen corresponding path program 1 times [2020-07-18 00:19:45,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:19:45,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [324482466] [2020-07-18 00:19:45,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:19:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:19:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:19:45,677 INFO L280 TraceCheckUtils]: 0: Hoare triple {540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {529#true} is VALID [2020-07-18 00:19:45,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {529#true} #valid := #valid[0 := 0]; {529#true} is VALID [2020-07-18 00:19:45,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {529#true} assume 0 < #StackHeapBarrier; {529#true} is VALID [2020-07-18 00:19:45,679 INFO L280 TraceCheckUtils]: 3: Hoare triple {529#true} assume true; {529#true} is VALID [2020-07-18 00:19:45,679 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {529#true} {529#true} #155#return; {529#true} is VALID [2020-07-18 00:19:45,681 INFO L263 TraceCheckUtils]: 0: Hoare triple {529#true} call ULTIMATE.init(); {540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:19:45,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {529#true} is VALID [2020-07-18 00:19:45,682 INFO L280 TraceCheckUtils]: 2: Hoare triple {529#true} #valid := #valid[0 := 0]; {529#true} is VALID [2020-07-18 00:19:45,682 INFO L280 TraceCheckUtils]: 3: Hoare triple {529#true} assume 0 < #StackHeapBarrier; {529#true} is VALID [2020-07-18 00:19:45,683 INFO L280 TraceCheckUtils]: 4: Hoare triple {529#true} assume true; {529#true} is VALID [2020-07-18 00:19:45,683 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {529#true} {529#true} #155#return; {529#true} is VALID [2020-07-18 00:19:45,683 INFO L263 TraceCheckUtils]: 6: Hoare triple {529#true} call #t~ret14 := main(); {529#true} is VALID [2020-07-18 00:19:45,684 INFO L280 TraceCheckUtils]: 7: Hoare triple {529#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {529#true} is VALID [2020-07-18 00:19:45,684 INFO L280 TraceCheckUtils]: 8: Hoare triple {529#true} ~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {529#true} is VALID [2020-07-18 00:19:45,684 INFO L280 TraceCheckUtils]: 9: Hoare triple {529#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {529#true} is VALID [2020-07-18 00:19:45,685 INFO L280 TraceCheckUtils]: 10: Hoare triple {529#true} havoc ~t~0.base, ~t~0.offset; {529#true} is VALID [2020-07-18 00:19:45,689 INFO L280 TraceCheckUtils]: 11: Hoare triple {529#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {536#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:45,691 INFO L280 TraceCheckUtils]: 12: Hoare triple {536#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {536#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:45,692 INFO L280 TraceCheckUtils]: 13: Hoare triple {536#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3); {536#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:45,693 INFO L280 TraceCheckUtils]: 14: Hoare triple {536#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet3; {536#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:45,695 INFO L280 TraceCheckUtils]: 15: Hoare triple {536#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {536#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:45,697 INFO L280 TraceCheckUtils]: 16: Hoare triple {536#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet6); {536#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:45,698 INFO L280 TraceCheckUtils]: 17: Hoare triple {536#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet6; {536#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:45,700 INFO L280 TraceCheckUtils]: 18: Hoare triple {536#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L532-5 {537#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-18 00:19:45,705 INFO L280 TraceCheckUtils]: 19: Hoare triple {537#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {538#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:45,706 INFO L280 TraceCheckUtils]: 20: Hoare triple {538#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L541-5 {538#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:45,707 INFO L280 TraceCheckUtils]: 21: Hoare triple {538#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9); {538#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:45,708 INFO L280 TraceCheckUtils]: 22: Hoare triple {538#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} havoc #t~mem9; {538#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:45,709 INFO L280 TraceCheckUtils]: 23: Hoare triple {538#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-4 {538#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:45,710 INFO L280 TraceCheckUtils]: 24: Hoare triple {538#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem11); {538#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:45,711 INFO L280 TraceCheckUtils]: 25: Hoare triple {538#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} havoc #t~mem11; {538#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:45,712 INFO L280 TraceCheckUtils]: 26: Hoare triple {538#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-5 {539#(= |main_#t~mem13| 3)} is VALID [2020-07-18 00:19:45,713 INFO L280 TraceCheckUtils]: 27: Hoare triple {539#(= |main_#t~mem13| 3)} assume 3 != #t~mem13; {530#false} is VALID [2020-07-18 00:19:45,714 INFO L280 TraceCheckUtils]: 28: Hoare triple {530#false} havoc #t~mem13; {530#false} is VALID [2020-07-18 00:19:45,714 INFO L280 TraceCheckUtils]: 29: Hoare triple {530#false} assume !false; {530#false} is VALID [2020-07-18 00:19:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:19:45,725 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:19:45,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [324482466] [2020-07-18 00:19:45,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:19:45,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:19:45,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810241951] [2020-07-18 00:19:45,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-07-18 00:19:45,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:19:45,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:19:45,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:45,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:19:45,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:19:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:19:45,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:19:45,799 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 7 states. [2020-07-18 00:19:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:46,674 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2020-07-18 00:19:46,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:19:46,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-07-18 00:19:46,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:19:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:19:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2020-07-18 00:19:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:19:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2020-07-18 00:19:46,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 142 transitions. [2020-07-18 00:19:46,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:46,900 INFO L225 Difference]: With dead ends: 134 [2020-07-18 00:19:46,900 INFO L226 Difference]: Without dead ends: 128 [2020-07-18 00:19:46,902 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:19:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-18 00:19:46,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 70. [2020-07-18 00:19:46,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:19:46,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 70 states. [2020-07-18 00:19:46,975 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 70 states. [2020-07-18 00:19:46,975 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 70 states. [2020-07-18 00:19:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:46,982 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2020-07-18 00:19:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2020-07-18 00:19:46,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:46,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:46,984 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 128 states. [2020-07-18 00:19:46,984 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 128 states. [2020-07-18 00:19:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:46,991 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2020-07-18 00:19:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2020-07-18 00:19:46,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:46,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:46,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:19:46,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:19:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-18 00:19:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2020-07-18 00:19:46,997 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 30 [2020-07-18 00:19:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:19:46,997 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2020-07-18 00:19:46,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:19:46,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 76 transitions. [2020-07-18 00:19:47,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2020-07-18 00:19:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-18 00:19:47,068 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:19:47,069 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:19:47,069 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:19:47,069 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:19:47,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:19:47,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1213729417, now seen corresponding path program 1 times [2020-07-18 00:19:47,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:19:47,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1199379968] [2020-07-18 00:19:47,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:19:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:19:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:19:47,217 INFO L280 TraceCheckUtils]: 0: Hoare triple {1222#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1211#true} is VALID [2020-07-18 00:19:47,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {1211#true} #valid := #valid[0 := 0]; {1211#true} is VALID [2020-07-18 00:19:47,218 INFO L280 TraceCheckUtils]: 2: Hoare triple {1211#true} assume 0 < #StackHeapBarrier; {1211#true} is VALID [2020-07-18 00:19:47,218 INFO L280 TraceCheckUtils]: 3: Hoare triple {1211#true} assume true; {1211#true} is VALID [2020-07-18 00:19:47,218 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1211#true} {1211#true} #155#return; {1211#true} is VALID [2020-07-18 00:19:47,219 INFO L263 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1222#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:19:47,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {1222#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1211#true} is VALID [2020-07-18 00:19:47,220 INFO L280 TraceCheckUtils]: 2: Hoare triple {1211#true} #valid := #valid[0 := 0]; {1211#true} is VALID [2020-07-18 00:19:47,220 INFO L280 TraceCheckUtils]: 3: Hoare triple {1211#true} assume 0 < #StackHeapBarrier; {1211#true} is VALID [2020-07-18 00:19:47,220 INFO L280 TraceCheckUtils]: 4: Hoare triple {1211#true} assume true; {1211#true} is VALID [2020-07-18 00:19:47,221 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1211#true} {1211#true} #155#return; {1211#true} is VALID [2020-07-18 00:19:47,221 INFO L263 TraceCheckUtils]: 6: Hoare triple {1211#true} call #t~ret14 := main(); {1211#true} is VALID [2020-07-18 00:19:47,221 INFO L280 TraceCheckUtils]: 7: Hoare triple {1211#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {1211#true} is VALID [2020-07-18 00:19:47,222 INFO L280 TraceCheckUtils]: 8: Hoare triple {1211#true} ~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1211#true} is VALID [2020-07-18 00:19:47,222 INFO L280 TraceCheckUtils]: 9: Hoare triple {1211#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1211#true} is VALID [2020-07-18 00:19:47,222 INFO L280 TraceCheckUtils]: 10: Hoare triple {1211#true} havoc ~t~0.base, ~t~0.offset; {1211#true} is VALID [2020-07-18 00:19:47,223 INFO L280 TraceCheckUtils]: 11: Hoare triple {1211#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1218#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:47,224 INFO L280 TraceCheckUtils]: 12: Hoare triple {1218#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1218#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:47,225 INFO L280 TraceCheckUtils]: 13: Hoare triple {1218#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3); {1218#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:47,225 INFO L280 TraceCheckUtils]: 14: Hoare triple {1218#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet3; {1218#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:47,226 INFO L280 TraceCheckUtils]: 15: Hoare triple {1218#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1218#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:47,227 INFO L280 TraceCheckUtils]: 16: Hoare triple {1218#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet6); {1218#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:47,228 INFO L280 TraceCheckUtils]: 17: Hoare triple {1218#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet6; {1218#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:47,229 INFO L280 TraceCheckUtils]: 18: Hoare triple {1218#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L532-5 {1219#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-18 00:19:47,230 INFO L280 TraceCheckUtils]: 19: Hoare triple {1219#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1220#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:47,230 INFO L280 TraceCheckUtils]: 20: Hoare triple {1220#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L541-5 {1220#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:47,231 INFO L280 TraceCheckUtils]: 21: Hoare triple {1220#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9); {1220#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:47,232 INFO L280 TraceCheckUtils]: 22: Hoare triple {1220#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} havoc #t~mem9; {1220#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:47,232 INFO L280 TraceCheckUtils]: 23: Hoare triple {1220#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-4 {1221#(= |main_#t~mem11| 3)} is VALID [2020-07-18 00:19:47,233 INFO L280 TraceCheckUtils]: 24: Hoare triple {1221#(= |main_#t~mem11| 3)} assume !!(1 == #t~mem11); {1212#false} is VALID [2020-07-18 00:19:47,233 INFO L280 TraceCheckUtils]: 25: Hoare triple {1212#false} havoc #t~mem11; {1212#false} is VALID [2020-07-18 00:19:47,234 INFO L280 TraceCheckUtils]: 26: Hoare triple {1212#false} SUMMARY for call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L544 {1212#false} is VALID [2020-07-18 00:19:47,234 INFO L280 TraceCheckUtils]: 27: Hoare triple {1212#false} ~p~0.base, ~p~0.offset := #t~mem12.base, #t~mem12.offset; {1212#false} is VALID [2020-07-18 00:19:47,234 INFO L280 TraceCheckUtils]: 28: Hoare triple {1212#false} havoc #t~mem12.base, #t~mem12.offset; {1212#false} is VALID [2020-07-18 00:19:47,235 INFO L280 TraceCheckUtils]: 29: Hoare triple {1212#false} SUMMARY for call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-4 {1212#false} is VALID [2020-07-18 00:19:47,235 INFO L280 TraceCheckUtils]: 30: Hoare triple {1212#false} assume !(1 == #t~mem11); {1212#false} is VALID [2020-07-18 00:19:47,235 INFO L280 TraceCheckUtils]: 31: Hoare triple {1212#false} havoc #t~mem11; {1212#false} is VALID [2020-07-18 00:19:47,235 INFO L280 TraceCheckUtils]: 32: Hoare triple {1212#false} SUMMARY for call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-5 {1212#false} is VALID [2020-07-18 00:19:47,236 INFO L280 TraceCheckUtils]: 33: Hoare triple {1212#false} assume 3 != #t~mem13; {1212#false} is VALID [2020-07-18 00:19:47,236 INFO L280 TraceCheckUtils]: 34: Hoare triple {1212#false} havoc #t~mem13; {1212#false} is VALID [2020-07-18 00:19:47,236 INFO L280 TraceCheckUtils]: 35: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2020-07-18 00:19:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:19:47,242 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:19:47,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1199379968] [2020-07-18 00:19:47,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:19:47,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:19:47,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156122667] [2020-07-18 00:19:47,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-18 00:19:47,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:19:47,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:19:47,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:47,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:19:47,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:19:47,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:19:47,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:19:47,286 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 7 states. [2020-07-18 00:19:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:48,068 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2020-07-18 00:19:48,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:19:48,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-18 00:19:48,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:19:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:19:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2020-07-18 00:19:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:19:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2020-07-18 00:19:48,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 145 transitions. [2020-07-18 00:19:48,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:48,228 INFO L225 Difference]: With dead ends: 137 [2020-07-18 00:19:48,229 INFO L226 Difference]: Without dead ends: 122 [2020-07-18 00:19:48,229 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:19:48,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-18 00:19:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 67. [2020-07-18 00:19:48,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:19:48,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 67 states. [2020-07-18 00:19:48,286 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 67 states. [2020-07-18 00:19:48,286 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 67 states. [2020-07-18 00:19:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:48,295 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2020-07-18 00:19:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2020-07-18 00:19:48,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:48,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:48,296 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 122 states. [2020-07-18 00:19:48,296 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 122 states. [2020-07-18 00:19:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:48,304 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2020-07-18 00:19:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2020-07-18 00:19:48,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:48,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:48,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:19:48,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:19:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-18 00:19:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2020-07-18 00:19:48,308 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 36 [2020-07-18 00:19:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:19:48,308 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2020-07-18 00:19:48,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:19:48,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 72 transitions. [2020-07-18 00:19:48,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2020-07-18 00:19:48,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-18 00:19:48,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:19:48,381 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:19:48,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:19:48,381 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:19:48,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:19:48,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2044556103, now seen corresponding path program 1 times [2020-07-18 00:19:48,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:19:48,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [690474204] [2020-07-18 00:19:48,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:19:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:19:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:19:48,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {1892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1881#true} is VALID [2020-07-18 00:19:48,537 INFO L280 TraceCheckUtils]: 1: Hoare triple {1881#true} #valid := #valid[0 := 0]; {1881#true} is VALID [2020-07-18 00:19:48,537 INFO L280 TraceCheckUtils]: 2: Hoare triple {1881#true} assume 0 < #StackHeapBarrier; {1881#true} is VALID [2020-07-18 00:19:48,538 INFO L280 TraceCheckUtils]: 3: Hoare triple {1881#true} assume true; {1881#true} is VALID [2020-07-18 00:19:48,538 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1881#true} {1881#true} #155#return; {1881#true} is VALID [2020-07-18 00:19:48,546 INFO L263 TraceCheckUtils]: 0: Hoare triple {1881#true} call ULTIMATE.init(); {1892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:19:48,546 INFO L280 TraceCheckUtils]: 1: Hoare triple {1892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1881#true} is VALID [2020-07-18 00:19:48,547 INFO L280 TraceCheckUtils]: 2: Hoare triple {1881#true} #valid := #valid[0 := 0]; {1881#true} is VALID [2020-07-18 00:19:48,547 INFO L280 TraceCheckUtils]: 3: Hoare triple {1881#true} assume 0 < #StackHeapBarrier; {1881#true} is VALID [2020-07-18 00:19:48,547 INFO L280 TraceCheckUtils]: 4: Hoare triple {1881#true} assume true; {1881#true} is VALID [2020-07-18 00:19:48,547 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1881#true} {1881#true} #155#return; {1881#true} is VALID [2020-07-18 00:19:48,547 INFO L263 TraceCheckUtils]: 6: Hoare triple {1881#true} call #t~ret14 := main(); {1881#true} is VALID [2020-07-18 00:19:48,548 INFO L280 TraceCheckUtils]: 7: Hoare triple {1881#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {1881#true} is VALID [2020-07-18 00:19:48,548 INFO L280 TraceCheckUtils]: 8: Hoare triple {1881#true} ~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1881#true} is VALID [2020-07-18 00:19:48,548 INFO L280 TraceCheckUtils]: 9: Hoare triple {1881#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1881#true} is VALID [2020-07-18 00:19:48,548 INFO L280 TraceCheckUtils]: 10: Hoare triple {1881#true} havoc ~t~0.base, ~t~0.offset; {1881#true} is VALID [2020-07-18 00:19:48,549 INFO L280 TraceCheckUtils]: 11: Hoare triple {1881#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1888#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:48,550 INFO L280 TraceCheckUtils]: 12: Hoare triple {1888#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1888#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:48,551 INFO L280 TraceCheckUtils]: 13: Hoare triple {1888#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3); {1888#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:48,551 INFO L280 TraceCheckUtils]: 14: Hoare triple {1888#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet3; {1888#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:48,553 INFO L280 TraceCheckUtils]: 15: Hoare triple {1888#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1888#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:48,553 INFO L280 TraceCheckUtils]: 16: Hoare triple {1888#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet6); {1888#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:48,554 INFO L280 TraceCheckUtils]: 17: Hoare triple {1888#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet6; {1888#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:48,555 INFO L280 TraceCheckUtils]: 18: Hoare triple {1888#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L532-5 {1889#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-18 00:19:48,556 INFO L280 TraceCheckUtils]: 19: Hoare triple {1889#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1890#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:48,557 INFO L280 TraceCheckUtils]: 20: Hoare triple {1890#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L541-5 {1891#(= 3 |main_#t~mem9|)} is VALID [2020-07-18 00:19:48,557 INFO L280 TraceCheckUtils]: 21: Hoare triple {1891#(= 3 |main_#t~mem9|)} assume !!(2 == #t~mem9); {1882#false} is VALID [2020-07-18 00:19:48,558 INFO L280 TraceCheckUtils]: 22: Hoare triple {1882#false} havoc #t~mem9; {1882#false} is VALID [2020-07-18 00:19:48,558 INFO L280 TraceCheckUtils]: 23: Hoare triple {1882#false} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L542 {1882#false} is VALID [2020-07-18 00:19:48,558 INFO L280 TraceCheckUtils]: 24: Hoare triple {1882#false} ~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset; {1882#false} is VALID [2020-07-18 00:19:48,558 INFO L280 TraceCheckUtils]: 25: Hoare triple {1882#false} havoc #t~mem10.base, #t~mem10.offset; {1882#false} is VALID [2020-07-18 00:19:48,559 INFO L280 TraceCheckUtils]: 26: Hoare triple {1882#false} SUMMARY for call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L541-5 {1882#false} is VALID [2020-07-18 00:19:48,559 INFO L280 TraceCheckUtils]: 27: Hoare triple {1882#false} assume !(2 == #t~mem9); {1882#false} is VALID [2020-07-18 00:19:48,559 INFO L280 TraceCheckUtils]: 28: Hoare triple {1882#false} havoc #t~mem9; {1882#false} is VALID [2020-07-18 00:19:48,560 INFO L280 TraceCheckUtils]: 29: Hoare triple {1882#false} SUMMARY for call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-4 {1882#false} is VALID [2020-07-18 00:19:48,560 INFO L280 TraceCheckUtils]: 30: Hoare triple {1882#false} assume !(1 == #t~mem11); {1882#false} is VALID [2020-07-18 00:19:48,560 INFO L280 TraceCheckUtils]: 31: Hoare triple {1882#false} havoc #t~mem11; {1882#false} is VALID [2020-07-18 00:19:48,560 INFO L280 TraceCheckUtils]: 32: Hoare triple {1882#false} SUMMARY for call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-5 {1882#false} is VALID [2020-07-18 00:19:48,561 INFO L280 TraceCheckUtils]: 33: Hoare triple {1882#false} assume 3 != #t~mem13; {1882#false} is VALID [2020-07-18 00:19:48,561 INFO L280 TraceCheckUtils]: 34: Hoare triple {1882#false} havoc #t~mem13; {1882#false} is VALID [2020-07-18 00:19:48,561 INFO L280 TraceCheckUtils]: 35: Hoare triple {1882#false} assume !false; {1882#false} is VALID [2020-07-18 00:19:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:19:48,566 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:19:48,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [690474204] [2020-07-18 00:19:48,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:19:48,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:19:48,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784087089] [2020-07-18 00:19:48,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-18 00:19:48,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:19:48,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:19:48,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:48,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:19:48,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:19:48,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:19:48,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:19:48,610 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 7 states. [2020-07-18 00:19:49,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:49,274 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2020-07-18 00:19:49,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:19:49,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-18 00:19:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:19:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:19:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2020-07-18 00:19:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:19:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2020-07-18 00:19:49,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 126 transitions. [2020-07-18 00:19:49,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:49,421 INFO L225 Difference]: With dead ends: 119 [2020-07-18 00:19:49,421 INFO L226 Difference]: Without dead ends: 95 [2020-07-18 00:19:49,422 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:19:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-18 00:19:49,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 62. [2020-07-18 00:19:49,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:19:49,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 62 states. [2020-07-18 00:19:49,457 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 62 states. [2020-07-18 00:19:49,458 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 62 states. [2020-07-18 00:19:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:49,462 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2020-07-18 00:19:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2020-07-18 00:19:49,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:49,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:49,462 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 95 states. [2020-07-18 00:19:49,463 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 95 states. [2020-07-18 00:19:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:49,466 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2020-07-18 00:19:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2020-07-18 00:19:49,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:49,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:49,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:19:49,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:19:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-18 00:19:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2020-07-18 00:19:49,469 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 36 [2020-07-18 00:19:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:19:49,470 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2020-07-18 00:19:49,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:19:49,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 66 transitions. [2020-07-18 00:19:49,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2020-07-18 00:19:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-18 00:19:49,543 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:19:49,543 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:19:49,544 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:19:49,544 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:19:49,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:19:49,544 INFO L82 PathProgramCache]: Analyzing trace with hash -833752717, now seen corresponding path program 1 times [2020-07-18 00:19:49,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:19:49,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2047169361] [2020-07-18 00:19:49,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:19:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:19:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:19:49,941 INFO L280 TraceCheckUtils]: 0: Hoare triple {2470#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2451#true} is VALID [2020-07-18 00:19:49,941 INFO L280 TraceCheckUtils]: 1: Hoare triple {2451#true} #valid := #valid[0 := 0]; {2451#true} is VALID [2020-07-18 00:19:49,942 INFO L280 TraceCheckUtils]: 2: Hoare triple {2451#true} assume 0 < #StackHeapBarrier; {2451#true} is VALID [2020-07-18 00:19:49,942 INFO L280 TraceCheckUtils]: 3: Hoare triple {2451#true} assume true; {2451#true} is VALID [2020-07-18 00:19:49,943 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2451#true} {2451#true} #155#return; {2451#true} is VALID [2020-07-18 00:19:49,944 INFO L263 TraceCheckUtils]: 0: Hoare triple {2451#true} call ULTIMATE.init(); {2470#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:19:49,944 INFO L280 TraceCheckUtils]: 1: Hoare triple {2470#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2451#true} is VALID [2020-07-18 00:19:49,944 INFO L280 TraceCheckUtils]: 2: Hoare triple {2451#true} #valid := #valid[0 := 0]; {2451#true} is VALID [2020-07-18 00:19:49,945 INFO L280 TraceCheckUtils]: 3: Hoare triple {2451#true} assume 0 < #StackHeapBarrier; {2451#true} is VALID [2020-07-18 00:19:49,945 INFO L280 TraceCheckUtils]: 4: Hoare triple {2451#true} assume true; {2451#true} is VALID [2020-07-18 00:19:49,945 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2451#true} {2451#true} #155#return; {2451#true} is VALID [2020-07-18 00:19:49,945 INFO L263 TraceCheckUtils]: 6: Hoare triple {2451#true} call #t~ret14 := main(); {2451#true} is VALID [2020-07-18 00:19:49,947 INFO L280 TraceCheckUtils]: 7: Hoare triple {2451#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {2458#(= (select |#valid| |main_#t~malloc2.base|) 1)} is VALID [2020-07-18 00:19:49,947 INFO L280 TraceCheckUtils]: 8: Hoare triple {2458#(= (select |#valid| |main_#t~malloc2.base|) 1)} ~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2459#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-18 00:19:49,949 INFO L280 TraceCheckUtils]: 9: Hoare triple {2459#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2459#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-18 00:19:49,949 INFO L280 TraceCheckUtils]: 10: Hoare triple {2459#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset; {2459#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-18 00:19:49,950 INFO L280 TraceCheckUtils]: 11: Hoare triple {2459#(= 1 (select |#valid| main_~a~0.base))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2460#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:49,951 INFO L280 TraceCheckUtils]: 12: Hoare triple {2460#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2460#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:49,952 INFO L280 TraceCheckUtils]: 13: Hoare triple {2460#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3); {2460#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:49,952 INFO L280 TraceCheckUtils]: 14: Hoare triple {2460#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet3; {2460#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:49,954 INFO L280 TraceCheckUtils]: 15: Hoare triple {2460#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2460#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:49,954 INFO L280 TraceCheckUtils]: 16: Hoare triple {2460#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet6); {2460#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:49,955 INFO L280 TraceCheckUtils]: 17: Hoare triple {2460#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet6; {2460#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:49,956 INFO L280 TraceCheckUtils]: 18: Hoare triple {2460#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(2, ~p~0.base, ~p~0.offset, 4); srcloc: L533 {2461#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:49,957 INFO L280 TraceCheckUtils]: 19: Hoare triple {2461#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8); srcloc: L533-1 {2462#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= |main_#t~malloc7.base| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:49,958 INFO L280 TraceCheckUtils]: 20: Hoare triple {2462#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= |main_#t~malloc7.base| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} ~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2463#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:49,959 INFO L280 TraceCheckUtils]: 21: Hoare triple {2463#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2463#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:49,961 INFO L280 TraceCheckUtils]: 22: Hoare triple {2463#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L535-3 {2464#(and (= main_~a~0.base main_~p~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:49,962 INFO L280 TraceCheckUtils]: 23: Hoare triple {2464#(and (= main_~a~0.base main_~p~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L536 {2465#(and (not (= |main_#t~mem8.base| main_~a~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:49,962 INFO L280 TraceCheckUtils]: 24: Hoare triple {2465#(and (not (= |main_#t~mem8.base| main_~a~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} ~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset; {2466#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:49,963 INFO L280 TraceCheckUtils]: 25: Hoare triple {2466#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} havoc #t~mem8.base, #t~mem8.offset; {2466#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:49,964 INFO L280 TraceCheckUtils]: 26: Hoare triple {2466#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2466#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:49,964 INFO L280 TraceCheckUtils]: 27: Hoare triple {2466#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet6); {2466#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:49,965 INFO L280 TraceCheckUtils]: 28: Hoare triple {2466#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} havoc #t~nondet6; {2466#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:49,966 INFO L280 TraceCheckUtils]: 29: Hoare triple {2466#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L532-5 {2467#(= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-18 00:19:49,969 INFO L280 TraceCheckUtils]: 30: Hoare triple {2467#(= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2468#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:49,970 INFO L280 TraceCheckUtils]: 31: Hoare triple {2468#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L541-5 {2469#(= 2 |main_#t~mem9|)} is VALID [2020-07-18 00:19:49,971 INFO L280 TraceCheckUtils]: 32: Hoare triple {2469#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9); {2452#false} is VALID [2020-07-18 00:19:49,971 INFO L280 TraceCheckUtils]: 33: Hoare triple {2452#false} havoc #t~mem9; {2452#false} is VALID [2020-07-18 00:19:49,971 INFO L280 TraceCheckUtils]: 34: Hoare triple {2452#false} SUMMARY for call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-4 {2452#false} is VALID [2020-07-18 00:19:49,971 INFO L280 TraceCheckUtils]: 35: Hoare triple {2452#false} assume !(1 == #t~mem11); {2452#false} is VALID [2020-07-18 00:19:49,972 INFO L280 TraceCheckUtils]: 36: Hoare triple {2452#false} havoc #t~mem11; {2452#false} is VALID [2020-07-18 00:19:49,972 INFO L280 TraceCheckUtils]: 37: Hoare triple {2452#false} SUMMARY for call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-5 {2452#false} is VALID [2020-07-18 00:19:49,972 INFO L280 TraceCheckUtils]: 38: Hoare triple {2452#false} assume 3 != #t~mem13; {2452#false} is VALID [2020-07-18 00:19:49,972 INFO L280 TraceCheckUtils]: 39: Hoare triple {2452#false} havoc #t~mem13; {2452#false} is VALID [2020-07-18 00:19:49,973 INFO L280 TraceCheckUtils]: 40: Hoare triple {2452#false} assume !false; {2452#false} is VALID [2020-07-18 00:19:49,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:19:49,982 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:19:49,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2047169361] [2020-07-18 00:19:49,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:19:49,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-18 00:19:49,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570318860] [2020-07-18 00:19:49,984 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-18 00:19:49,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:19:49,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 00:19:50,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:50,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 00:19:50,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:19:50,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 00:19:50,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-07-18 00:19:50,033 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 15 states. [2020-07-18 00:19:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:52,132 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2020-07-18 00:19:52,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-18 00:19:52,132 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-18 00:19:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:19:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:19:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 166 transitions. [2020-07-18 00:19:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:19:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 166 transitions. [2020-07-18 00:19:52,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 166 transitions. [2020-07-18 00:19:52,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:52,364 INFO L225 Difference]: With dead ends: 157 [2020-07-18 00:19:52,364 INFO L226 Difference]: Without dead ends: 144 [2020-07-18 00:19:52,365 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2020-07-18 00:19:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-18 00:19:52,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 78. [2020-07-18 00:19:52,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:19:52,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 78 states. [2020-07-18 00:19:52,555 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 78 states. [2020-07-18 00:19:52,556 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 78 states. [2020-07-18 00:19:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:52,562 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2020-07-18 00:19:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2020-07-18 00:19:52,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:52,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:52,563 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 144 states. [2020-07-18 00:19:52,563 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 144 states. [2020-07-18 00:19:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:52,568 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2020-07-18 00:19:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2020-07-18 00:19:52,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:52,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:52,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:19:52,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:19:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-18 00:19:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2020-07-18 00:19:52,572 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 41 [2020-07-18 00:19:52,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:19:52,572 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2020-07-18 00:19:52,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 00:19:52,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 83 transitions. [2020-07-18 00:19:52,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2020-07-18 00:19:52,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-18 00:19:52,707 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:19:52,708 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:19:52,708 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:19:52,708 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:19:52,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:19:52,708 INFO L82 PathProgramCache]: Analyzing trace with hash 865863745, now seen corresponding path program 1 times [2020-07-18 00:19:52,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:19:52,709 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [191300837] [2020-07-18 00:19:52,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:19:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:19:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:19:53,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {3284#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3265#true} is VALID [2020-07-18 00:19:53,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {3265#true} #valid := #valid[0 := 0]; {3265#true} is VALID [2020-07-18 00:19:53,046 INFO L280 TraceCheckUtils]: 2: Hoare triple {3265#true} assume 0 < #StackHeapBarrier; {3265#true} is VALID [2020-07-18 00:19:53,046 INFO L280 TraceCheckUtils]: 3: Hoare triple {3265#true} assume true; {3265#true} is VALID [2020-07-18 00:19:53,046 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3265#true} {3265#true} #155#return; {3265#true} is VALID [2020-07-18 00:19:53,049 INFO L263 TraceCheckUtils]: 0: Hoare triple {3265#true} call ULTIMATE.init(); {3284#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:19:53,049 INFO L280 TraceCheckUtils]: 1: Hoare triple {3284#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3265#true} is VALID [2020-07-18 00:19:53,050 INFO L280 TraceCheckUtils]: 2: Hoare triple {3265#true} #valid := #valid[0 := 0]; {3265#true} is VALID [2020-07-18 00:19:53,050 INFO L280 TraceCheckUtils]: 3: Hoare triple {3265#true} assume 0 < #StackHeapBarrier; {3265#true} is VALID [2020-07-18 00:19:53,050 INFO L280 TraceCheckUtils]: 4: Hoare triple {3265#true} assume true; {3265#true} is VALID [2020-07-18 00:19:53,050 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3265#true} {3265#true} #155#return; {3265#true} is VALID [2020-07-18 00:19:53,050 INFO L263 TraceCheckUtils]: 6: Hoare triple {3265#true} call #t~ret14 := main(); {3265#true} is VALID [2020-07-18 00:19:53,051 INFO L280 TraceCheckUtils]: 7: Hoare triple {3265#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {3272#(= (select |#valid| |main_#t~malloc2.base|) 1)} is VALID [2020-07-18 00:19:53,052 INFO L280 TraceCheckUtils]: 8: Hoare triple {3272#(= (select |#valid| |main_#t~malloc2.base|) 1)} ~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {3273#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-18 00:19:53,053 INFO L280 TraceCheckUtils]: 9: Hoare triple {3273#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {3273#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-18 00:19:53,053 INFO L280 TraceCheckUtils]: 10: Hoare triple {3273#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset; {3273#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-18 00:19:53,054 INFO L280 TraceCheckUtils]: 11: Hoare triple {3273#(= 1 (select |#valid| main_~a~0.base))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3274#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:53,055 INFO L280 TraceCheckUtils]: 12: Hoare triple {3274#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3274#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:53,055 INFO L280 TraceCheckUtils]: 13: Hoare triple {3274#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet3); {3274#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:53,056 INFO L280 TraceCheckUtils]: 14: Hoare triple {3274#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet3; {3274#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:53,057 INFO L280 TraceCheckUtils]: 15: Hoare triple {3274#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L526 {3275#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:53,058 INFO L280 TraceCheckUtils]: 16: Hoare triple {3275#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8); srcloc: L526-1 {3276#(and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:53,059 INFO L280 TraceCheckUtils]: 17: Hoare triple {3276#(and (not (= |main_#t~malloc4.base| main_~p~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset))} ~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {3277#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:53,060 INFO L280 TraceCheckUtils]: 18: Hoare triple {3277#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {3277#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:53,061 INFO L280 TraceCheckUtils]: 19: Hoare triple {3277#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L528-3 {3278#(and (= main_~a~0.base main_~p~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:19:53,061 INFO L280 TraceCheckUtils]: 20: Hoare triple {3278#(and (= main_~a~0.base main_~p~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L529 {3279#(and (not (= |main_#t~mem5.base| main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:53,062 INFO L280 TraceCheckUtils]: 21: Hoare triple {3279#(and (not (= |main_#t~mem5.base| main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} ~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset; {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:53,063 INFO L280 TraceCheckUtils]: 22: Hoare triple {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} havoc #t~mem5.base, #t~mem5.offset; {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:53,063 INFO L280 TraceCheckUtils]: 23: Hoare triple {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:53,064 INFO L280 TraceCheckUtils]: 24: Hoare triple {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet3); {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:53,064 INFO L280 TraceCheckUtils]: 25: Hoare triple {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} havoc #t~nondet3; {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:53,065 INFO L280 TraceCheckUtils]: 26: Hoare triple {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:53,065 INFO L280 TraceCheckUtils]: 27: Hoare triple {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet6); {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:53,066 INFO L280 TraceCheckUtils]: 28: Hoare triple {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} havoc #t~nondet6; {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-18 00:19:53,067 INFO L280 TraceCheckUtils]: 29: Hoare triple {3280#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L532-5 {3281#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-18 00:19:53,067 INFO L280 TraceCheckUtils]: 30: Hoare triple {3281#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3282#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:53,068 INFO L280 TraceCheckUtils]: 31: Hoare triple {3282#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L541-5 {3282#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:53,068 INFO L280 TraceCheckUtils]: 32: Hoare triple {3282#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9); {3282#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:53,069 INFO L280 TraceCheckUtils]: 33: Hoare triple {3282#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} havoc #t~mem9; {3282#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:19:53,069 INFO L280 TraceCheckUtils]: 34: Hoare triple {3282#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-4 {3283#(= |main_#t~mem11| 1)} is VALID [2020-07-18 00:19:53,070 INFO L280 TraceCheckUtils]: 35: Hoare triple {3283#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11); {3266#false} is VALID [2020-07-18 00:19:53,070 INFO L280 TraceCheckUtils]: 36: Hoare triple {3266#false} havoc #t~mem11; {3266#false} is VALID [2020-07-18 00:19:53,070 INFO L280 TraceCheckUtils]: 37: Hoare triple {3266#false} SUMMARY for call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-5 {3266#false} is VALID [2020-07-18 00:19:53,070 INFO L280 TraceCheckUtils]: 38: Hoare triple {3266#false} assume 3 != #t~mem13; {3266#false} is VALID [2020-07-18 00:19:53,070 INFO L280 TraceCheckUtils]: 39: Hoare triple {3266#false} havoc #t~mem13; {3266#false} is VALID [2020-07-18 00:19:53,071 INFO L280 TraceCheckUtils]: 40: Hoare triple {3266#false} assume !false; {3266#false} is VALID [2020-07-18 00:19:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:19:53,076 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:19:53,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [191300837] [2020-07-18 00:19:53,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:19:53,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-18 00:19:53,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254913741] [2020-07-18 00:19:53,077 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-18 00:19:53,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:19:53,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 00:19:53,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:53,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 00:19:53,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:19:53,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 00:19:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-07-18 00:19:53,125 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 15 states. [2020-07-18 00:19:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:55,977 INFO L93 Difference]: Finished difference Result 181 states and 193 transitions. [2020-07-18 00:19:55,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-18 00:19:55,977 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-18 00:19:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:19:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:19:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 184 transitions. [2020-07-18 00:19:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:19:55,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 184 transitions. [2020-07-18 00:19:55,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 184 transitions. [2020-07-18 00:19:56,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:56,210 INFO L225 Difference]: With dead ends: 181 [2020-07-18 00:19:56,210 INFO L226 Difference]: Without dead ends: 175 [2020-07-18 00:19:56,211 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2020-07-18 00:19:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-07-18 00:19:56,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 100. [2020-07-18 00:19:56,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:19:56,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand 100 states. [2020-07-18 00:19:56,503 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 100 states. [2020-07-18 00:19:56,503 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 100 states. [2020-07-18 00:19:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:56,509 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2020-07-18 00:19:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 187 transitions. [2020-07-18 00:19:56,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:56,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:56,510 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 175 states. [2020-07-18 00:19:56,511 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 175 states. [2020-07-18 00:19:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:56,517 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2020-07-18 00:19:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 187 transitions. [2020-07-18 00:19:56,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:56,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:56,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:19:56,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:19:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-18 00:19:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2020-07-18 00:19:56,521 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 41 [2020-07-18 00:19:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:19:56,522 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2020-07-18 00:19:56,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 00:19:56,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 100 states and 108 transitions. [2020-07-18 00:19:56,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2020-07-18 00:19:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-18 00:19:56,711 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:19:56,711 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:19:56,711 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:19:56,712 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:19:56,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:19:56,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1077832869, now seen corresponding path program 1 times [2020-07-18 00:19:56,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:19:56,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [587490256] [2020-07-18 00:19:56,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:19:56,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:19:56,727 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:19:56,738 INFO L168 Benchmark]: Toolchain (without parser) took 14002.58 ms. Allocated memory was 143.1 MB in the beginning and 396.9 MB in the end (delta: 253.8 MB). Free memory was 98.2 MB in the beginning and 190.7 MB in the end (delta: -92.5 MB). Peak memory consumption was 161.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:19:56,739 INFO L168 Benchmark]: CDTParser took 1.00 ms. Allocated memory is still 143.1 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-18 00:19:56,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.94 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 97.8 MB in the beginning and 164.6 MB in the end (delta: -66.8 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:19:56,752 INFO L168 Benchmark]: Boogie Preprocessor took 118.05 ms. Allocated memory is still 199.8 MB. Free memory was 164.6 MB in the beginning and 160.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:19:56,753 INFO L168 Benchmark]: RCFGBuilder took 768.84 ms. Allocated memory is still 199.8 MB. Free memory was 160.6 MB in the beginning and 99.1 MB in the end (delta: 61.5 MB). Peak memory consumption was 61.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:19:56,754 INFO L168 Benchmark]: TraceAbstraction took 12440.49 ms. Allocated memory was 199.8 MB in the beginning and 396.9 MB in the end (delta: 197.1 MB). Free memory was 99.1 MB in the beginning and 190.7 MB in the end (delta: -91.6 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:19:56,766 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00 ms. Allocated memory is still 143.1 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 667.94 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 97.8 MB in the beginning and 164.6 MB in the end (delta: -66.8 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.05 ms. Allocated memory is still 199.8 MB. Free memory was 164.6 MB in the beginning and 160.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 768.84 ms. Allocated memory is still 199.8 MB. Free memory was 160.6 MB in the beginning and 99.1 MB in the end (delta: 61.5 MB). Peak memory consumption was 61.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12440.49 ms. Allocated memory was 199.8 MB in the beginning and 396.9 MB in the end (delta: 197.1 MB). Free memory was 99.1 MB in the beginning and 190.7 MB in the end (delta: -91.6 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...