/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:04:24,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:04:24,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:04:24,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:04:24,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:04:24,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:04:24,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:04:24,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:04:24,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:04:24,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:04:24,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:04:24,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:04:24,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:04:24,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:04:24,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:04:24,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:04:24,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:04:24,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:04:24,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:04:24,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:04:24,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:04:24,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:04:24,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:04:24,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:04:24,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:04:24,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:04:24,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:04:24,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:04:24,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:04:24,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:04:24,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:04:24,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:04:24,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:04:24,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:04:24,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:04:24,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:04:24,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:04:24,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:04:24,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:04:24,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:04:24,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:04:24,492 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 19:04:24,509 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:04:24,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:04:24,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:04:24,512 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:04:24,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:04:24,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:04:24,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:04:24,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:04:24,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:04:24,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:04:24,514 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:04:24,515 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:04:24,515 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:04:24,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:04:24,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:04:24,516 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:04:24,516 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:04:24,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:04:24,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:04:24,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:04:24,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:04:24,518 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:04:24,518 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:04:24,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:04:24,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:04:24,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:04:24,857 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:04:24,858 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:04:24,858 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i [2020-07-10 19:04:24,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb9d0373b/ff596788bcf742d7aeb38dba2441c4e5/FLAG68b3e3046 [2020-07-10 19:04:25,484 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:04:25,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i [2020-07-10 19:04:25,502 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb9d0373b/ff596788bcf742d7aeb38dba2441c4e5/FLAG68b3e3046 [2020-07-10 19:04:25,762 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb9d0373b/ff596788bcf742d7aeb38dba2441c4e5 [2020-07-10 19:04:25,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:04:25,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:04:25,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:04:25,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:04:25,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:04:25,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:04:25" (1/1) ... [2020-07-10 19:04:25,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@763d9581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:25, skipping insertion in model container [2020-07-10 19:04:25,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:04:25" (1/1) ... [2020-07-10 19:04:25,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:04:25,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:04:26,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:04:26,361 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:04:26,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:04:26,525 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:04:26,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:26 WrapperNode [2020-07-10 19:04:26,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:04:26,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:04:26,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:04:26,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:04:26,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:26" (1/1) ... [2020-07-10 19:04:26,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:26" (1/1) ... [2020-07-10 19:04:26,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:26" (1/1) ... [2020-07-10 19:04:26,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:26" (1/1) ... [2020-07-10 19:04:26,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:26" (1/1) ... [2020-07-10 19:04:26,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:26" (1/1) ... [2020-07-10 19:04:26,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:26" (1/1) ... [2020-07-10 19:04:26,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:04:26,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:04:26,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:04:26,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:04:26,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:04:26,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:04:26,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:04:26,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:04:26,702 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 19:04:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 19:04:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 19:04:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 19:04:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 19:04:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 19:04:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 19:04:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 19:04:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 19:04:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 19:04:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 19:04:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 19:04:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 19:04:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 19:04:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 19:04:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 19:04:26,706 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 19:04:26,707 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 19:04:26,707 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 19:04:26,710 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 19:04:26,710 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 19:04:26,710 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 19:04:26,710 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 19:04:26,710 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 19:04:26,711 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 19:04:26,712 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 19:04:26,712 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 19:04:26,712 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 19:04:26,712 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 19:04:26,712 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 19:04:26,714 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 19:04:26,714 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 19:04:26,714 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 19:04:26,714 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 19:04:26,714 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 19:04:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 19:04:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 19:04:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 19:04:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 19:04:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 19:04:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 19:04:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 19:04:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 19:04:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 19:04:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 19:04:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 19:04:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 19:04:26,717 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 19:04:26,717 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 19:04:26,717 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 19:04:26,717 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 19:04:26,717 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 19:04:26,718 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 19:04:26,718 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 19:04:26,718 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 19:04:26,718 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 19:04:26,718 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 19:04:26,719 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 19:04:26,719 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 19:04:26,719 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 19:04:26,719 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 19:04:26,719 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 19:04:26,719 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 19:04:26,719 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 19:04:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 19:04:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 19:04:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 19:04:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 19:04:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 19:04:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 19:04:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 19:04:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 19:04:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 19:04:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 19:04:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 19:04:26,723 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 19:04:26,723 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 19:04:26,724 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 19:04:26,724 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 19:04:26,724 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 19:04:26,724 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 19:04:26,724 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 19:04:26,724 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 19:04:26,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 19:04:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 19:04:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 19:04:26,727 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 19:04:26,727 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 19:04:26,727 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 19:04:26,727 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 19:04:26,727 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 19:04:26,727 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 19:04:26,727 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 19:04:26,728 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 19:04:26,728 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 19:04:26,728 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 19:04:26,729 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 19:04:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 19:04:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 19:04:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 19:04:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 19:04:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 19:04:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 19:04:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 19:04:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:04:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:04:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 19:04:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 19:04:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 19:04:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 19:04:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 19:04:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:04:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:04:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:04:27,479 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:04:27,479 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-10 19:04:27,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:04:27 BoogieIcfgContainer [2020-07-10 19:04:27,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:04:27,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:04:27,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:04:27,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:04:27,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:04:25" (1/3) ... [2020-07-10 19:04:27,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7c09bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:04:27, skipping insertion in model container [2020-07-10 19:04:27,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:26" (2/3) ... [2020-07-10 19:04:27,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7c09bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:04:27, skipping insertion in model container [2020-07-10 19:04:27,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:04:27" (3/3) ... [2020-07-10 19:04:27,494 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.i [2020-07-10 19:04:27,506 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:04:27,516 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-07-10 19:04:27,534 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-07-10 19:04:27,561 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:04:27,561 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:04:27,561 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:04:27,561 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:04:27,561 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:04:27,562 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:04:27,562 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:04:27,562 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:04:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-07-10 19:04:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 19:04:27,595 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:27,596 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] [2020-07-10 19:04:27,597 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:27,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:27,605 INFO L82 PathProgramCache]: Analyzing trace with hash -159181327, now seen corresponding path program 1 times [2020-07-10 19:04:27,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:27,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [840831255] [2020-07-10 19:04:27,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:27,912 INFO L280 TraceCheckUtils]: 0: Hoare triple {108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {101#true} is VALID [2020-07-10 19:04:27,912 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#true} #valid := #valid[0 := 0]; {101#true} is VALID [2020-07-10 19:04:27,913 INFO L280 TraceCheckUtils]: 2: Hoare triple {101#true} assume 0 < #StackHeapBarrier; {101#true} is VALID [2020-07-10 19:04:27,913 INFO L280 TraceCheckUtils]: 3: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-10 19:04:27,914 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {101#true} {101#true} #196#return; {101#true} is VALID [2020-07-10 19:04:27,917 INFO L263 TraceCheckUtils]: 0: Hoare triple {101#true} call ULTIMATE.init(); {108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:27,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {101#true} is VALID [2020-07-10 19:04:27,918 INFO L280 TraceCheckUtils]: 2: Hoare triple {101#true} #valid := #valid[0 := 0]; {101#true} is VALID [2020-07-10 19:04:27,918 INFO L280 TraceCheckUtils]: 3: Hoare triple {101#true} assume 0 < #StackHeapBarrier; {101#true} is VALID [2020-07-10 19:04:27,919 INFO L280 TraceCheckUtils]: 4: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-10 19:04:27,919 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {101#true} {101#true} #196#return; {101#true} is VALID [2020-07-10 19:04:27,919 INFO L263 TraceCheckUtils]: 6: Hoare triple {101#true} call #t~ret17 := main(); {101#true} is VALID [2020-07-10 19:04:27,920 INFO L280 TraceCheckUtils]: 7: Hoare triple {101#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {101#true} is VALID [2020-07-10 19:04:27,920 INFO L280 TraceCheckUtils]: 8: Hoare triple {101#true} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {101#true} is VALID [2020-07-10 19:04:27,921 INFO L280 TraceCheckUtils]: 9: Hoare triple {101#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {101#true} is VALID [2020-07-10 19:04:27,921 INFO L280 TraceCheckUtils]: 10: Hoare triple {101#true} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {101#true} is VALID [2020-07-10 19:04:27,921 INFO L280 TraceCheckUtils]: 11: Hoare triple {101#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {101#true} is VALID [2020-07-10 19:04:27,922 INFO L280 TraceCheckUtils]: 12: Hoare triple {101#true} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {101#true} is VALID [2020-07-10 19:04:27,922 INFO L280 TraceCheckUtils]: 13: Hoare triple {101#true} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {101#true} is VALID [2020-07-10 19:04:27,922 INFO L280 TraceCheckUtils]: 14: Hoare triple {101#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {101#true} is VALID [2020-07-10 19:04:27,923 INFO L280 TraceCheckUtils]: 15: Hoare triple {101#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {101#true} is VALID [2020-07-10 19:04:27,924 INFO L280 TraceCheckUtils]: 16: Hoare triple {101#true} assume !true; {102#false} is VALID [2020-07-10 19:04:27,924 INFO L280 TraceCheckUtils]: 17: Hoare triple {102#false} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; {102#false} is VALID [2020-07-10 19:04:27,925 INFO L280 TraceCheckUtils]: 18: Hoare triple {102#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {102#false} is VALID [2020-07-10 19:04:27,925 INFO L280 TraceCheckUtils]: 19: Hoare triple {102#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {102#false} is VALID [2020-07-10 19:04:27,926 INFO L280 TraceCheckUtils]: 20: Hoare triple {102#false} assume !false; {102#false} is VALID [2020-07-10 19:04:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:27,929 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:27,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [840831255] [2020-07-10 19:04:27,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:27,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 19:04:27,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864049718] [2020-07-10 19:04:27,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 19:04:27,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:27,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 19:04:28,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:28,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 19:04:28,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:28,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 19:04:28,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 19:04:28,015 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-07-10 19:04:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:28,634 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2020-07-10 19:04:28,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 19:04:28,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 19:04:28,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 19:04:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-10 19:04:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 19:04:28,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-10 19:04:28,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2020-07-10 19:04:28,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:28,983 INFO L225 Difference]: With dead ends: 157 [2020-07-10 19:04:28,983 INFO L226 Difference]: Without dead ends: 74 [2020-07-10 19:04:28,992 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 19:04:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-10 19:04:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-10 19:04:29,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:29,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2020-07-10 19:04:29,076 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-10 19:04:29,076 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-10 19:04:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:29,083 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-10 19:04:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-10 19:04:29,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:29,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:29,085 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-10 19:04:29,085 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-10 19:04:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:29,092 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-10 19:04:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-10 19:04:29,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:29,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:29,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:29,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-10 19:04:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2020-07-10 19:04:29,101 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 21 [2020-07-10 19:04:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:29,101 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2020-07-10 19:04:29,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 19:04:29,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 77 transitions. [2020-07-10 19:04:29,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-10 19:04:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 19:04:29,220 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:29,220 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] [2020-07-10 19:04:29,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:04:29,221 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:29,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:29,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1476818129, now seen corresponding path program 1 times [2020-07-10 19:04:29,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:29,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1657087468] [2020-07-10 19:04:29,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:29,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {733#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {721#true} is VALID [2020-07-10 19:04:29,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {721#true} #valid := #valid[0 := 0]; {721#true} is VALID [2020-07-10 19:04:29,410 INFO L280 TraceCheckUtils]: 2: Hoare triple {721#true} assume 0 < #StackHeapBarrier; {721#true} is VALID [2020-07-10 19:04:29,411 INFO L280 TraceCheckUtils]: 3: Hoare triple {721#true} assume true; {721#true} is VALID [2020-07-10 19:04:29,411 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {721#true} {721#true} #196#return; {721#true} is VALID [2020-07-10 19:04:29,412 INFO L263 TraceCheckUtils]: 0: Hoare triple {721#true} call ULTIMATE.init(); {733#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:29,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {733#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {721#true} is VALID [2020-07-10 19:04:29,413 INFO L280 TraceCheckUtils]: 2: Hoare triple {721#true} #valid := #valid[0 := 0]; {721#true} is VALID [2020-07-10 19:04:29,413 INFO L280 TraceCheckUtils]: 3: Hoare triple {721#true} assume 0 < #StackHeapBarrier; {721#true} is VALID [2020-07-10 19:04:29,414 INFO L280 TraceCheckUtils]: 4: Hoare triple {721#true} assume true; {721#true} is VALID [2020-07-10 19:04:29,414 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {721#true} {721#true} #196#return; {721#true} is VALID [2020-07-10 19:04:29,414 INFO L263 TraceCheckUtils]: 6: Hoare triple {721#true} call #t~ret17 := main(); {721#true} is VALID [2020-07-10 19:04:29,416 INFO L280 TraceCheckUtils]: 7: Hoare triple {721#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {728#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-10 19:04:29,417 INFO L280 TraceCheckUtils]: 8: Hoare triple {728#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {729#(= 1 (select |#valid| main_~null~0.base))} is VALID [2020-07-10 19:04:29,418 INFO L280 TraceCheckUtils]: 9: Hoare triple {729#(= 1 (select |#valid| main_~null~0.base))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {729#(= 1 (select |#valid| main_~null~0.base))} is VALID [2020-07-10 19:04:29,419 INFO L280 TraceCheckUtils]: 10: Hoare triple {729#(= 1 (select |#valid| main_~null~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {729#(= 1 (select |#valid| main_~null~0.base))} is VALID [2020-07-10 19:04:29,420 INFO L280 TraceCheckUtils]: 11: Hoare triple {729#(= 1 (select |#valid| main_~null~0.base))} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {730#(not (= |main_#t~malloc1.base| main_~null~0.base))} is VALID [2020-07-10 19:04:29,420 INFO L280 TraceCheckUtils]: 12: Hoare triple {730#(not (= |main_#t~malloc1.base| main_~null~0.base))} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-10 19:04:29,421 INFO L280 TraceCheckUtils]: 13: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-10 19:04:29,422 INFO L280 TraceCheckUtils]: 14: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-10 19:04:29,423 INFO L280 TraceCheckUtils]: 15: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-10 19:04:29,424 INFO L280 TraceCheckUtils]: 16: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-10 19:04:29,424 INFO L280 TraceCheckUtils]: 17: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} assume !(0 != #t~nondet2); {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-10 19:04:29,425 INFO L280 TraceCheckUtils]: 18: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} havoc #t~nondet2; {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-10 19:04:29,426 INFO L280 TraceCheckUtils]: 19: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; {731#(not (= main_~list~0.base main_~null~0.base))} is VALID [2020-07-10 19:04:29,427 INFO L280 TraceCheckUtils]: 20: Hoare triple {731#(not (= main_~list~0.base main_~null~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {732#(not (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-10 19:04:29,428 INFO L280 TraceCheckUtils]: 21: Hoare triple {732#(not (= main_~null~0.base main_~end~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {722#false} is VALID [2020-07-10 19:04:29,428 INFO L280 TraceCheckUtils]: 22: Hoare triple {722#false} assume !false; {722#false} is VALID [2020-07-10 19:04:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:29,430 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:29,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1657087468] [2020-07-10 19:04:29,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:29,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 19:04:29,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51272439] [2020-07-10 19:04:29,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-10 19:04:29,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:29,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 19:04:29,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:29,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 19:04:29,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:29,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 19:04:29,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:04:29,463 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 8 states. [2020-07-10 19:04:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:30,529 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2020-07-10 19:04:30,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 19:04:30,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-10 19:04:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:04:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2020-07-10 19:04:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:04:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2020-07-10 19:04:30,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 97 transitions. [2020-07-10 19:04:30,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:30,694 INFO L225 Difference]: With dead ends: 92 [2020-07-10 19:04:30,694 INFO L226 Difference]: Without dead ends: 90 [2020-07-10 19:04:30,696 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-07-10 19:04:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-10 19:04:30,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2020-07-10 19:04:30,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:30,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 72 states. [2020-07-10 19:04:30,888 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 72 states. [2020-07-10 19:04:30,888 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 72 states. [2020-07-10 19:04:30,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:30,894 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2020-07-10 19:04:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2020-07-10 19:04:30,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:30,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:30,895 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 90 states. [2020-07-10 19:04:30,896 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 90 states. [2020-07-10 19:04:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:30,901 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2020-07-10 19:04:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2020-07-10 19:04:30,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:30,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:30,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:30,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-10 19:04:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2020-07-10 19:04:30,907 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 23 [2020-07-10 19:04:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:30,907 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2020-07-10 19:04:30,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 19:04:30,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 75 transitions. [2020-07-10 19:04:31,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:31,015 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2020-07-10 19:04:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 19:04:31,017 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:31,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:31,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:04:31,018 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:31,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1518762392, now seen corresponding path program 1 times [2020-07-10 19:04:31,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:31,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1098940235] [2020-07-10 19:04:31,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:31,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {1265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1252#true} is VALID [2020-07-10 19:04:31,295 INFO L280 TraceCheckUtils]: 1: Hoare triple {1252#true} #valid := #valid[0 := 0]; {1252#true} is VALID [2020-07-10 19:04:31,295 INFO L280 TraceCheckUtils]: 2: Hoare triple {1252#true} assume 0 < #StackHeapBarrier; {1252#true} is VALID [2020-07-10 19:04:31,296 INFO L280 TraceCheckUtils]: 3: Hoare triple {1252#true} assume true; {1252#true} is VALID [2020-07-10 19:04:31,296 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1252#true} {1252#true} #196#return; {1252#true} is VALID [2020-07-10 19:04:31,297 INFO L263 TraceCheckUtils]: 0: Hoare triple {1252#true} call ULTIMATE.init(); {1265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:31,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {1265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1252#true} is VALID [2020-07-10 19:04:31,298 INFO L280 TraceCheckUtils]: 2: Hoare triple {1252#true} #valid := #valid[0 := 0]; {1252#true} is VALID [2020-07-10 19:04:31,299 INFO L280 TraceCheckUtils]: 3: Hoare triple {1252#true} assume 0 < #StackHeapBarrier; {1252#true} is VALID [2020-07-10 19:04:31,299 INFO L280 TraceCheckUtils]: 4: Hoare triple {1252#true} assume true; {1252#true} is VALID [2020-07-10 19:04:31,299 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1252#true} {1252#true} #196#return; {1252#true} is VALID [2020-07-10 19:04:31,299 INFO L263 TraceCheckUtils]: 6: Hoare triple {1252#true} call #t~ret17 := main(); {1252#true} is VALID [2020-07-10 19:04:31,300 INFO L280 TraceCheckUtils]: 7: Hoare triple {1252#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {1259#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-10 19:04:31,301 INFO L280 TraceCheckUtils]: 8: Hoare triple {1259#(= 0 |main_#t~malloc0.offset|)} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {1252#true} is VALID [2020-07-10 19:04:31,301 INFO L280 TraceCheckUtils]: 9: Hoare triple {1252#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {1252#true} is VALID [2020-07-10 19:04:31,301 INFO L280 TraceCheckUtils]: 10: Hoare triple {1252#true} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {1252#true} is VALID [2020-07-10 19:04:31,302 INFO L280 TraceCheckUtils]: 11: Hoare triple {1252#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {1260#(= 0 |main_#t~malloc1.offset|)} is VALID [2020-07-10 19:04:31,303 INFO L280 TraceCheckUtils]: 12: Hoare triple {1260#(= 0 |main_#t~malloc1.offset|)} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {1261#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:31,304 INFO L280 TraceCheckUtils]: 13: Hoare triple {1261#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {1261#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:31,305 INFO L280 TraceCheckUtils]: 14: Hoare triple {1261#(= 0 main_~list~0.offset)} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {1262#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:31,306 INFO L280 TraceCheckUtils]: 15: Hoare triple {1262#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1262#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:31,308 INFO L280 TraceCheckUtils]: 16: Hoare triple {1262#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1262#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:31,309 INFO L280 TraceCheckUtils]: 17: Hoare triple {1262#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet2); {1262#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:31,310 INFO L280 TraceCheckUtils]: 18: Hoare triple {1262#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet2; {1262#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:31,311 INFO L280 TraceCheckUtils]: 19: Hoare triple {1262#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; {1262#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:31,312 INFO L280 TraceCheckUtils]: 20: Hoare triple {1262#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1263#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:31,312 INFO L280 TraceCheckUtils]: 21: Hoare triple {1263#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1263#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:31,313 INFO L280 TraceCheckUtils]: 22: Hoare triple {1263#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {1263#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:31,314 INFO L280 TraceCheckUtils]: 23: Hoare triple {1263#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1031-6 {1264#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-10 19:04:31,315 INFO L280 TraceCheckUtils]: 24: Hoare triple {1264#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8); {1253#false} is VALID [2020-07-10 19:04:31,315 INFO L280 TraceCheckUtils]: 25: Hoare triple {1253#false} havoc #t~mem8; {1253#false} is VALID [2020-07-10 19:04:31,316 INFO L280 TraceCheckUtils]: 26: Hoare triple {1253#false} assume !false; {1253#false} is VALID [2020-07-10 19:04:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:31,318 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:31,318 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1098940235] [2020-07-10 19:04:31,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:31,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 19:04:31,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414509897] [2020-07-10 19:04:31,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-10 19:04:31,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:31,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 19:04:31,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:31,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 19:04:31,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:31,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 19:04:31,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-10 19:04:31,359 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 9 states. [2020-07-10 19:04:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:32,763 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2020-07-10 19:04:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 19:04:32,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-10 19:04:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 19:04:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2020-07-10 19:04:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 19:04:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2020-07-10 19:04:32,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 126 transitions. [2020-07-10 19:04:32,935 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-10 19:04:32,940 INFO L225 Difference]: With dead ends: 120 [2020-07-10 19:04:32,940 INFO L226 Difference]: Without dead ends: 117 [2020-07-10 19:04:32,941 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-07-10 19:04:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-07-10 19:04:33,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2020-07-10 19:04:33,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:33,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 81 states. [2020-07-10 19:04:33,265 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 81 states. [2020-07-10 19:04:33,265 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 81 states. [2020-07-10 19:04:33,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:33,271 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-07-10 19:04:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2020-07-10 19:04:33,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:33,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:33,273 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 117 states. [2020-07-10 19:04:33,273 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 117 states. [2020-07-10 19:04:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:33,279 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-07-10 19:04:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2020-07-10 19:04:33,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:33,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:33,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:33,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-10 19:04:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2020-07-10 19:04:33,284 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 27 [2020-07-10 19:04:33,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:33,285 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2020-07-10 19:04:33,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 19:04:33,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 85 transitions. [2020-07-10 19:04:33,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2020-07-10 19:04:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-10 19:04:33,464 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:33,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:33,465 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 19:04:33,465 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:33,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:33,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2047332937, now seen corresponding path program 1 times [2020-07-10 19:04:33,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:33,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2002908485] [2020-07-10 19:04:33,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:33,665 INFO L280 TraceCheckUtils]: 0: Hoare triple {1928#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1918#true} is VALID [2020-07-10 19:04:33,666 INFO L280 TraceCheckUtils]: 1: Hoare triple {1918#true} #valid := #valid[0 := 0]; {1918#true} is VALID [2020-07-10 19:04:33,666 INFO L280 TraceCheckUtils]: 2: Hoare triple {1918#true} assume 0 < #StackHeapBarrier; {1918#true} is VALID [2020-07-10 19:04:33,666 INFO L280 TraceCheckUtils]: 3: Hoare triple {1918#true} assume true; {1918#true} is VALID [2020-07-10 19:04:33,666 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1918#true} {1918#true} #196#return; {1918#true} is VALID [2020-07-10 19:04:33,667 INFO L263 TraceCheckUtils]: 0: Hoare triple {1918#true} call ULTIMATE.init(); {1928#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:33,668 INFO L280 TraceCheckUtils]: 1: Hoare triple {1928#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1918#true} is VALID [2020-07-10 19:04:33,668 INFO L280 TraceCheckUtils]: 2: Hoare triple {1918#true} #valid := #valid[0 := 0]; {1918#true} is VALID [2020-07-10 19:04:33,668 INFO L280 TraceCheckUtils]: 3: Hoare triple {1918#true} assume 0 < #StackHeapBarrier; {1918#true} is VALID [2020-07-10 19:04:33,668 INFO L280 TraceCheckUtils]: 4: Hoare triple {1918#true} assume true; {1918#true} is VALID [2020-07-10 19:04:33,669 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1918#true} {1918#true} #196#return; {1918#true} is VALID [2020-07-10 19:04:33,669 INFO L263 TraceCheckUtils]: 6: Hoare triple {1918#true} call #t~ret17 := main(); {1918#true} is VALID [2020-07-10 19:04:33,669 INFO L280 TraceCheckUtils]: 7: Hoare triple {1918#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {1918#true} is VALID [2020-07-10 19:04:33,669 INFO L280 TraceCheckUtils]: 8: Hoare triple {1918#true} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {1918#true} is VALID [2020-07-10 19:04:33,669 INFO L280 TraceCheckUtils]: 9: Hoare triple {1918#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {1918#true} is VALID [2020-07-10 19:04:33,670 INFO L280 TraceCheckUtils]: 10: Hoare triple {1918#true} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {1918#true} is VALID [2020-07-10 19:04:33,670 INFO L280 TraceCheckUtils]: 11: Hoare triple {1918#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {1918#true} is VALID [2020-07-10 19:04:33,670 INFO L280 TraceCheckUtils]: 12: Hoare triple {1918#true} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {1918#true} is VALID [2020-07-10 19:04:33,670 INFO L280 TraceCheckUtils]: 13: Hoare triple {1918#true} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {1918#true} is VALID [2020-07-10 19:04:33,670 INFO L280 TraceCheckUtils]: 14: Hoare triple {1918#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {1918#true} is VALID [2020-07-10 19:04:33,671 INFO L280 TraceCheckUtils]: 15: Hoare triple {1918#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1918#true} is VALID [2020-07-10 19:04:33,671 INFO L280 TraceCheckUtils]: 16: Hoare triple {1918#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1918#true} is VALID [2020-07-10 19:04:33,671 INFO L280 TraceCheckUtils]: 17: Hoare triple {1918#true} assume !(0 != #t~nondet2); {1918#true} is VALID [2020-07-10 19:04:33,671 INFO L280 TraceCheckUtils]: 18: Hoare triple {1918#true} havoc #t~nondet2; {1918#true} is VALID [2020-07-10 19:04:33,671 INFO L280 TraceCheckUtils]: 19: Hoare triple {1918#true} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; {1918#true} is VALID [2020-07-10 19:04:33,672 INFO L280 TraceCheckUtils]: 20: Hoare triple {1918#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1918#true} is VALID [2020-07-10 19:04:33,672 INFO L280 TraceCheckUtils]: 21: Hoare triple {1918#true} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1918#true} is VALID [2020-07-10 19:04:33,672 INFO L280 TraceCheckUtils]: 22: Hoare triple {1918#true} goto; {1918#true} is VALID [2020-07-10 19:04:33,675 INFO L280 TraceCheckUtils]: 23: Hoare triple {1918#true} SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1031-6 {1925#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem8|)} is VALID [2020-07-10 19:04:33,675 INFO L280 TraceCheckUtils]: 24: Hoare triple {1925#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem8|)} assume !!(~unnamed1~0~BLACK == #t~mem8); {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:33,676 INFO L280 TraceCheckUtils]: 25: Hoare triple {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} havoc #t~mem8; {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:33,677 INFO L280 TraceCheckUtils]: 26: Hoare triple {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:33,677 INFO L280 TraceCheckUtils]: 27: Hoare triple {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:33,678 INFO L280 TraceCheckUtils]: 28: Hoare triple {1926#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} SUMMARY for call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1035 {1927#(= ~unnamed1~0~BLACK |main_#t~mem9|)} is VALID [2020-07-10 19:04:33,678 INFO L280 TraceCheckUtils]: 29: Hoare triple {1927#(= ~unnamed1~0~BLACK |main_#t~mem9|)} assume ~unnamed1~0~RED == #t~mem9; {1919#false} is VALID [2020-07-10 19:04:33,679 INFO L280 TraceCheckUtils]: 30: Hoare triple {1919#false} havoc #t~mem9; {1919#false} is VALID [2020-07-10 19:04:33,679 INFO L280 TraceCheckUtils]: 31: Hoare triple {1919#false} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1037 {1919#false} is VALID [2020-07-10 19:04:33,679 INFO L280 TraceCheckUtils]: 32: Hoare triple {1919#false} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {1919#false} is VALID [2020-07-10 19:04:33,679 INFO L280 TraceCheckUtils]: 33: Hoare triple {1919#false} havoc #t~mem10.base, #t~mem10.offset; {1919#false} is VALID [2020-07-10 19:04:33,680 INFO L280 TraceCheckUtils]: 34: Hoare triple {1919#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1919#false} is VALID [2020-07-10 19:04:33,680 INFO L280 TraceCheckUtils]: 35: Hoare triple {1919#false} assume !false; {1919#false} is VALID [2020-07-10 19:04:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:33,682 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:33,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2002908485] [2020-07-10 19:04:33,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:33,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 19:04:33,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710532149] [2020-07-10 19:04:33,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-10 19:04:33,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:33,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 19:04:33,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:33,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 19:04:33,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:33,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 19:04:33,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:04:33,718 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 6 states. [2020-07-10 19:04:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:34,679 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2020-07-10 19:04:34,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 19:04:34,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-10 19:04:34,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:04:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2020-07-10 19:04:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:04:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2020-07-10 19:04:34,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 115 transitions. [2020-07-10 19:04:34,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:34,793 INFO L225 Difference]: With dead ends: 114 [2020-07-10 19:04:34,793 INFO L226 Difference]: Without dead ends: 92 [2020-07-10 19:04:34,794 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:04:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-10 19:04:35,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2020-07-10 19:04:35,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:35,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 84 states. [2020-07-10 19:04:35,111 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 84 states. [2020-07-10 19:04:35,111 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 84 states. [2020-07-10 19:04:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:35,115 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2020-07-10 19:04:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2020-07-10 19:04:35,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:35,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:35,116 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 92 states. [2020-07-10 19:04:35,116 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 92 states. [2020-07-10 19:04:35,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:35,120 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2020-07-10 19:04:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2020-07-10 19:04:35,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:35,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:35,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:35,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-10 19:04:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2020-07-10 19:04:35,124 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 36 [2020-07-10 19:04:35,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:35,125 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2020-07-10 19:04:35,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 19:04:35,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 88 transitions. [2020-07-10 19:04:35,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2020-07-10 19:04:35,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 19:04:35,298 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:35,299 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:35,299 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 19:04:35,299 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:35,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:35,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1237644091, now seen corresponding path program 1 times [2020-07-10 19:04:35,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:35,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1508914940] [2020-07-10 19:04:35,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:35,936 INFO L280 TraceCheckUtils]: 0: Hoare triple {2535#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2515#true} is VALID [2020-07-10 19:04:35,936 INFO L280 TraceCheckUtils]: 1: Hoare triple {2515#true} #valid := #valid[0 := 0]; {2515#true} is VALID [2020-07-10 19:04:35,936 INFO L280 TraceCheckUtils]: 2: Hoare triple {2515#true} assume 0 < #StackHeapBarrier; {2515#true} is VALID [2020-07-10 19:04:35,937 INFO L280 TraceCheckUtils]: 3: Hoare triple {2515#true} assume true; {2515#true} is VALID [2020-07-10 19:04:35,937 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2515#true} {2515#true} #196#return; {2515#true} is VALID [2020-07-10 19:04:35,938 INFO L263 TraceCheckUtils]: 0: Hoare triple {2515#true} call ULTIMATE.init(); {2535#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:35,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {2535#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2515#true} is VALID [2020-07-10 19:04:35,938 INFO L280 TraceCheckUtils]: 2: Hoare triple {2515#true} #valid := #valid[0 := 0]; {2515#true} is VALID [2020-07-10 19:04:35,939 INFO L280 TraceCheckUtils]: 3: Hoare triple {2515#true} assume 0 < #StackHeapBarrier; {2515#true} is VALID [2020-07-10 19:04:35,939 INFO L280 TraceCheckUtils]: 4: Hoare triple {2515#true} assume true; {2515#true} is VALID [2020-07-10 19:04:35,939 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2515#true} {2515#true} #196#return; {2515#true} is VALID [2020-07-10 19:04:35,939 INFO L263 TraceCheckUtils]: 6: Hoare triple {2515#true} call #t~ret17 := main(); {2515#true} is VALID [2020-07-10 19:04:35,940 INFO L280 TraceCheckUtils]: 7: Hoare triple {2515#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {2522#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-10 19:04:35,940 INFO L280 TraceCheckUtils]: 8: Hoare triple {2522#(= 0 |main_#t~malloc0.offset|)} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {2515#true} is VALID [2020-07-10 19:04:35,941 INFO L280 TraceCheckUtils]: 9: Hoare triple {2515#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {2515#true} is VALID [2020-07-10 19:04:35,941 INFO L280 TraceCheckUtils]: 10: Hoare triple {2515#true} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {2515#true} is VALID [2020-07-10 19:04:35,942 INFO L280 TraceCheckUtils]: 11: Hoare triple {2515#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {2523#(and (= 1 (select |#valid| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|))} is VALID [2020-07-10 19:04:35,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {2523#(and (= 1 (select |#valid| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|))} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {2524#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:35,945 INFO L280 TraceCheckUtils]: 13: Hoare triple {2524#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {2524#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:35,946 INFO L280 TraceCheckUtils]: 14: Hoare triple {2524#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {2525#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,947 INFO L280 TraceCheckUtils]: 15: Hoare triple {2525#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2526#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:35,948 INFO L280 TraceCheckUtils]: 16: Hoare triple {2526#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2526#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:35,949 INFO L280 TraceCheckUtils]: 17: Hoare triple {2526#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} assume !!(0 != #t~nondet2); {2526#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:35,950 INFO L280 TraceCheckUtils]: 18: Hoare triple {2526#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} havoc #t~nondet2; {2526#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:35,951 INFO L280 TraceCheckUtils]: 19: Hoare triple {2526#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8); srcloc: L1008 {2527#(and (= 0 main_~list~0.offset) (not (= |main_#t~malloc3.base| main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:35,952 INFO L280 TraceCheckUtils]: 20: Hoare triple {2527#(and (= 0 main_~list~0.offset) (not (= |main_#t~malloc3.base| main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} SUMMARY for call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1008-1 {2528#(and (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:35,953 INFO L280 TraceCheckUtils]: 21: Hoare triple {2528#(and (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1008-2 {2529#(and (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,954 INFO L280 TraceCheckUtils]: 22: Hoare triple {2529#(and (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; {2530#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,955 INFO L280 TraceCheckUtils]: 23: Hoare triple {2530#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem4.base, #t~mem4.offset; {2530#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,956 INFO L280 TraceCheckUtils]: 24: Hoare triple {2530#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1010 {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,957 INFO L280 TraceCheckUtils]: 25: Hoare triple {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,959 INFO L280 TraceCheckUtils]: 26: Hoare triple {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} assume 0 != #t~nondet5; {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,959 INFO L280 TraceCheckUtils]: 27: Hoare triple {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet5; {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,960 INFO L280 TraceCheckUtils]: 28: Hoare triple {2531#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1014 {2532#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,961 INFO L280 TraceCheckUtils]: 29: Hoare triple {2532#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2532#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,962 INFO L280 TraceCheckUtils]: 30: Hoare triple {2532#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet2); {2532#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,963 INFO L280 TraceCheckUtils]: 31: Hoare triple {2532#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet2; {2532#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,963 INFO L280 TraceCheckUtils]: 32: Hoare triple {2532#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; {2532#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,964 INFO L280 TraceCheckUtils]: 33: Hoare triple {2532#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2533#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:35,965 INFO L280 TraceCheckUtils]: 34: Hoare triple {2533#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {2533#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:35,965 INFO L280 TraceCheckUtils]: 35: Hoare triple {2533#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {2533#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:35,966 INFO L280 TraceCheckUtils]: 36: Hoare triple {2533#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1031-6 {2534#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-10 19:04:35,966 INFO L280 TraceCheckUtils]: 37: Hoare triple {2534#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8); {2516#false} is VALID [2020-07-10 19:04:35,967 INFO L280 TraceCheckUtils]: 38: Hoare triple {2516#false} havoc #t~mem8; {2516#false} is VALID [2020-07-10 19:04:35,967 INFO L280 TraceCheckUtils]: 39: Hoare triple {2516#false} assume !false; {2516#false} is VALID [2020-07-10 19:04:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:35,975 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:35,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1508914940] [2020-07-10 19:04:35,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:35,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-10 19:04:35,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858764876] [2020-07-10 19:04:35,977 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-10 19:04:35,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:35,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-10 19:04:36,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:36,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-10 19:04:36,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:36,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-10 19:04:36,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2020-07-10 19:04:36,025 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 16 states. [2020-07-10 19:04:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:39,520 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2020-07-10 19:04:39,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-10 19:04:39,521 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-10 19:04:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 19:04:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 157 transitions. [2020-07-10 19:04:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 19:04:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 157 transitions. [2020-07-10 19:04:39,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 157 transitions. [2020-07-10 19:04:39,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:39,781 INFO L225 Difference]: With dead ends: 155 [2020-07-10 19:04:39,782 INFO L226 Difference]: Without dead ends: 152 [2020-07-10 19:04:39,782 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2020-07-10 19:04:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-10 19:04:40,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 97. [2020-07-10 19:04:40,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:40,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 97 states. [2020-07-10 19:04:40,299 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 97 states. [2020-07-10 19:04:40,299 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 97 states. [2020-07-10 19:04:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:40,306 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2020-07-10 19:04:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2020-07-10 19:04:40,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:40,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:40,308 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 152 states. [2020-07-10 19:04:40,308 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 152 states. [2020-07-10 19:04:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:40,317 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2020-07-10 19:04:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2020-07-10 19:04:40,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:40,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:40,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:40,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-10 19:04:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2020-07-10 19:04:40,323 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 40 [2020-07-10 19:04:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:40,325 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2020-07-10 19:04:40,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-10 19:04:40,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 103 transitions. [2020-07-10 19:04:40,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2020-07-10 19:04:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 19:04:40,589 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:40,589 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] [2020-07-10 19:04:40,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 19:04:40,589 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:40,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:40,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1411163060, now seen corresponding path program 1 times [2020-07-10 19:04:40,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:40,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1506179600] [2020-07-10 19:04:40,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:40,759 INFO L280 TraceCheckUtils]: 0: Hoare triple {3385#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3374#true} is VALID [2020-07-10 19:04:40,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {3374#true} #valid := #valid[0 := 0]; {3374#true} is VALID [2020-07-10 19:04:40,760 INFO L280 TraceCheckUtils]: 2: Hoare triple {3374#true} assume 0 < #StackHeapBarrier; {3374#true} is VALID [2020-07-10 19:04:40,760 INFO L280 TraceCheckUtils]: 3: Hoare triple {3374#true} assume true; {3374#true} is VALID [2020-07-10 19:04:40,761 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3374#true} {3374#true} #196#return; {3374#true} is VALID [2020-07-10 19:04:40,761 INFO L263 TraceCheckUtils]: 0: Hoare triple {3374#true} call ULTIMATE.init(); {3385#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:40,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {3385#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3374#true} is VALID [2020-07-10 19:04:40,762 INFO L280 TraceCheckUtils]: 2: Hoare triple {3374#true} #valid := #valid[0 := 0]; {3374#true} is VALID [2020-07-10 19:04:40,763 INFO L280 TraceCheckUtils]: 3: Hoare triple {3374#true} assume 0 < #StackHeapBarrier; {3374#true} is VALID [2020-07-10 19:04:40,763 INFO L280 TraceCheckUtils]: 4: Hoare triple {3374#true} assume true; {3374#true} is VALID [2020-07-10 19:04:40,763 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3374#true} {3374#true} #196#return; {3374#true} is VALID [2020-07-10 19:04:40,764 INFO L263 TraceCheckUtils]: 6: Hoare triple {3374#true} call #t~ret17 := main(); {3374#true} is VALID [2020-07-10 19:04:40,764 INFO L280 TraceCheckUtils]: 7: Hoare triple {3374#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {3374#true} is VALID [2020-07-10 19:04:40,764 INFO L280 TraceCheckUtils]: 8: Hoare triple {3374#true} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {3374#true} is VALID [2020-07-10 19:04:40,765 INFO L280 TraceCheckUtils]: 9: Hoare triple {3374#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {3374#true} is VALID [2020-07-10 19:04:40,765 INFO L280 TraceCheckUtils]: 10: Hoare triple {3374#true} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {3374#true} is VALID [2020-07-10 19:04:40,767 INFO L280 TraceCheckUtils]: 11: Hoare triple {3374#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {3374#true} is VALID [2020-07-10 19:04:40,767 INFO L280 TraceCheckUtils]: 12: Hoare triple {3374#true} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {3374#true} is VALID [2020-07-10 19:04:40,769 INFO L280 TraceCheckUtils]: 13: Hoare triple {3374#true} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {3381#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))} is VALID [2020-07-10 19:04:40,770 INFO L280 TraceCheckUtils]: 14: Hoare triple {3381#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {3381#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))} is VALID [2020-07-10 19:04:40,772 INFO L280 TraceCheckUtils]: 15: Hoare triple {3381#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3381#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))} is VALID [2020-07-10 19:04:40,773 INFO L280 TraceCheckUtils]: 16: Hoare triple {3381#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3381#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))} is VALID [2020-07-10 19:04:40,774 INFO L280 TraceCheckUtils]: 17: Hoare triple {3381#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))} assume !(0 != #t~nondet2); {3381#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))} is VALID [2020-07-10 19:04:40,775 INFO L280 TraceCheckUtils]: 18: Hoare triple {3381#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))} havoc #t~nondet2; {3381#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))} is VALID [2020-07-10 19:04:40,776 INFO L280 TraceCheckUtils]: 19: Hoare triple {3381#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; {3381#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))} is VALID [2020-07-10 19:04:40,777 INFO L280 TraceCheckUtils]: 20: Hoare triple {3381#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} is VALID [2020-07-10 19:04:40,779 INFO L280 TraceCheckUtils]: 21: Hoare triple {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} is VALID [2020-07-10 19:04:40,780 INFO L280 TraceCheckUtils]: 22: Hoare triple {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} goto; {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} is VALID [2020-07-10 19:04:40,781 INFO L280 TraceCheckUtils]: 23: Hoare triple {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1031-6 {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} is VALID [2020-07-10 19:04:40,781 INFO L280 TraceCheckUtils]: 24: Hoare triple {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} assume !!(~unnamed1~0~BLACK == #t~mem8); {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} is VALID [2020-07-10 19:04:40,782 INFO L280 TraceCheckUtils]: 25: Hoare triple {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} havoc #t~mem8; {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} is VALID [2020-07-10 19:04:40,791 INFO L280 TraceCheckUtils]: 26: Hoare triple {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} goto; {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} is VALID [2020-07-10 19:04:40,792 INFO L280 TraceCheckUtils]: 27: Hoare triple {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} is VALID [2020-07-10 19:04:40,793 INFO L280 TraceCheckUtils]: 28: Hoare triple {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} SUMMARY for call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1035 {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} is VALID [2020-07-10 19:04:40,794 INFO L280 TraceCheckUtils]: 29: Hoare triple {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} assume !(~unnamed1~0~RED == #t~mem9); {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} is VALID [2020-07-10 19:04:40,795 INFO L280 TraceCheckUtils]: 30: Hoare triple {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} havoc #t~mem9; {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} is VALID [2020-07-10 19:04:40,796 INFO L280 TraceCheckUtils]: 31: Hoare triple {3382#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~null~0.offset))} SUMMARY for call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1035-4 {3383#(and (= |main_#t~mem12.offset| main_~null~0.offset) (= |main_#t~mem12.base| main_~null~0.base))} is VALID [2020-07-10 19:04:40,797 INFO L280 TraceCheckUtils]: 32: Hoare triple {3383#(and (= |main_#t~mem12.offset| main_~null~0.offset) (= |main_#t~mem12.base| main_~null~0.base))} ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset; {3384#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-10 19:04:40,798 INFO L280 TraceCheckUtils]: 33: Hoare triple {3384#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base))} havoc #t~mem12.base, #t~mem12.offset; {3384#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base))} is VALID [2020-07-10 19:04:40,798 INFO L280 TraceCheckUtils]: 34: Hoare triple {3384#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {3375#false} is VALID [2020-07-10 19:04:40,799 INFO L280 TraceCheckUtils]: 35: Hoare triple {3375#false} SUMMARY for call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1035 {3375#false} is VALID [2020-07-10 19:04:40,799 INFO L280 TraceCheckUtils]: 36: Hoare triple {3375#false} assume ~unnamed1~0~RED == #t~mem9; {3375#false} is VALID [2020-07-10 19:04:40,800 INFO L280 TraceCheckUtils]: 37: Hoare triple {3375#false} havoc #t~mem9; {3375#false} is VALID [2020-07-10 19:04:40,800 INFO L280 TraceCheckUtils]: 38: Hoare triple {3375#false} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1037 {3375#false} is VALID [2020-07-10 19:04:40,800 INFO L280 TraceCheckUtils]: 39: Hoare triple {3375#false} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {3375#false} is VALID [2020-07-10 19:04:40,800 INFO L280 TraceCheckUtils]: 40: Hoare triple {3375#false} havoc #t~mem10.base, #t~mem10.offset; {3375#false} is VALID [2020-07-10 19:04:40,801 INFO L280 TraceCheckUtils]: 41: Hoare triple {3375#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {3375#false} is VALID [2020-07-10 19:04:40,801 INFO L280 TraceCheckUtils]: 42: Hoare triple {3375#false} assume !false; {3375#false} is VALID [2020-07-10 19:04:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:40,809 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:40,809 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1506179600] [2020-07-10 19:04:40,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:40,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 19:04:40,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462213553] [2020-07-10 19:04:40,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-10 19:04:40,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:40,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 19:04:40,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:40,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 19:04:40,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:40,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 19:04:40,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 19:04:40,861 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 7 states. [2020-07-10 19:04:42,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:42,229 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2020-07-10 19:04:42,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 19:04:42,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-10 19:04:42,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:04:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2020-07-10 19:04:42,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:04:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2020-07-10 19:04:42,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 121 transitions. [2020-07-10 19:04:42,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:42,372 INFO L225 Difference]: With dead ends: 136 [2020-07-10 19:04:42,372 INFO L226 Difference]: Without dead ends: 97 [2020-07-10 19:04:42,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-10 19:04:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-10 19:04:42,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-07-10 19:04:42,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:42,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 97 states. [2020-07-10 19:04:42,880 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-10 19:04:42,881 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-10 19:04:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:42,884 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2020-07-10 19:04:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2020-07-10 19:04:42,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:42,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:42,884 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-10 19:04:42,884 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-10 19:04:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:42,887 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2020-07-10 19:04:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2020-07-10 19:04:42,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:42,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:42,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:42,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-10 19:04:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2020-07-10 19:04:42,892 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 43 [2020-07-10 19:04:42,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:42,892 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2020-07-10 19:04:42,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 19:04:42,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 102 transitions. [2020-07-10 19:04:43,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2020-07-10 19:04:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-10 19:04:43,126 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:43,127 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, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:43,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 19:04:43,127 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:43,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:43,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1215747511, now seen corresponding path program 1 times [2020-07-10 19:04:43,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:43,128 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [734051832] [2020-07-10 19:04:43,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:43,974 INFO L280 TraceCheckUtils]: 0: Hoare triple {4080#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4056#true} is VALID [2020-07-10 19:04:43,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {4056#true} #valid := #valid[0 := 0]; {4056#true} is VALID [2020-07-10 19:04:43,975 INFO L280 TraceCheckUtils]: 2: Hoare triple {4056#true} assume 0 < #StackHeapBarrier; {4056#true} is VALID [2020-07-10 19:04:43,975 INFO L280 TraceCheckUtils]: 3: Hoare triple {4056#true} assume true; {4056#true} is VALID [2020-07-10 19:04:43,975 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4056#true} {4056#true} #196#return; {4056#true} is VALID [2020-07-10 19:04:43,977 INFO L263 TraceCheckUtils]: 0: Hoare triple {4056#true} call ULTIMATE.init(); {4080#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:43,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {4080#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4056#true} is VALID [2020-07-10 19:04:43,978 INFO L280 TraceCheckUtils]: 2: Hoare triple {4056#true} #valid := #valid[0 := 0]; {4056#true} is VALID [2020-07-10 19:04:43,979 INFO L280 TraceCheckUtils]: 3: Hoare triple {4056#true} assume 0 < #StackHeapBarrier; {4056#true} is VALID [2020-07-10 19:04:43,979 INFO L280 TraceCheckUtils]: 4: Hoare triple {4056#true} assume true; {4056#true} is VALID [2020-07-10 19:04:43,979 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4056#true} {4056#true} #196#return; {4056#true} is VALID [2020-07-10 19:04:43,979 INFO L263 TraceCheckUtils]: 6: Hoare triple {4056#true} call #t~ret17 := main(); {4056#true} is VALID [2020-07-10 19:04:43,980 INFO L280 TraceCheckUtils]: 7: Hoare triple {4056#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {4063#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-10 19:04:43,981 INFO L280 TraceCheckUtils]: 8: Hoare triple {4063#(= 0 |main_#t~malloc0.offset|)} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {4056#true} is VALID [2020-07-10 19:04:43,981 INFO L280 TraceCheckUtils]: 9: Hoare triple {4056#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {4056#true} is VALID [2020-07-10 19:04:43,981 INFO L280 TraceCheckUtils]: 10: Hoare triple {4056#true} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {4056#true} is VALID [2020-07-10 19:04:43,982 INFO L280 TraceCheckUtils]: 11: Hoare triple {4056#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {4064#(and (= 1 (select |#valid| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|))} is VALID [2020-07-10 19:04:43,983 INFO L280 TraceCheckUtils]: 12: Hoare triple {4064#(and (= 1 (select |#valid| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|))} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {4065#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:43,984 INFO L280 TraceCheckUtils]: 13: Hoare triple {4065#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {4065#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:43,985 INFO L280 TraceCheckUtils]: 14: Hoare triple {4065#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {4066#(and (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:43,986 INFO L280 TraceCheckUtils]: 15: Hoare triple {4066#(and (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4067#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:43,987 INFO L280 TraceCheckUtils]: 16: Hoare triple {4067#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4067#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:43,988 INFO L280 TraceCheckUtils]: 17: Hoare triple {4067#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} assume !!(0 != #t~nondet2); {4067#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:43,989 INFO L280 TraceCheckUtils]: 18: Hoare triple {4067#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} havoc #t~nondet2; {4067#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:43,991 INFO L280 TraceCheckUtils]: 19: Hoare triple {4067#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8); srcloc: L1008 {4068#(and (not (= |main_#t~malloc3.base| main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:43,993 INFO L280 TraceCheckUtils]: 20: Hoare triple {4068#(and (not (= |main_#t~malloc3.base| main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} SUMMARY for call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1008-1 {4069#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:43,994 INFO L280 TraceCheckUtils]: 21: Hoare triple {4069#(and (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1008-2 {4070#(and (= 1 (select |#valid| main_~list~0.base)) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:43,995 INFO L280 TraceCheckUtils]: 22: Hoare triple {4070#(and (= 1 (select |#valid| main_~list~0.base)) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; {4071#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:43,996 INFO L280 TraceCheckUtils]: 23: Hoare triple {4071#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem4.base, #t~mem4.offset; {4071#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:43,999 INFO L280 TraceCheckUtils]: 24: Hoare triple {4071#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1010 {4071#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:44,000 INFO L280 TraceCheckUtils]: 25: Hoare triple {4071#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4071#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:44,002 INFO L280 TraceCheckUtils]: 26: Hoare triple {4071#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet5); {4071#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:44,003 INFO L280 TraceCheckUtils]: 27: Hoare triple {4071#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet5; {4071#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:44,005 INFO L280 TraceCheckUtils]: 28: Hoare triple {4071#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1018 {4071#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:44,009 INFO L280 TraceCheckUtils]: 29: Hoare triple {4071#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(8); srcloc: L1018-1 {4072#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)))} is VALID [2020-07-10 19:04:44,011 INFO L280 TraceCheckUtils]: 30: Hoare triple {4072#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~malloc6.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1019 {4073#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~list~0.base)))} is VALID [2020-07-10 19:04:44,014 INFO L280 TraceCheckUtils]: 31: Hoare triple {4073#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~list~0.base)))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1019-1 {4074#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem7.base| main_~list~0.base)))} is VALID [2020-07-10 19:04:44,016 INFO L280 TraceCheckUtils]: 32: Hoare triple {4074#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem7.base| main_~list~0.base)))} ~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset; {4075#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:44,017 INFO L280 TraceCheckUtils]: 33: Hoare triple {4075#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem7.base, #t~mem7.offset; {4075#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:44,023 INFO L280 TraceCheckUtils]: 34: Hoare triple {4075#(and (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1021 {4076#(= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-10 19:04:44,024 INFO L280 TraceCheckUtils]: 35: Hoare triple {4076#(= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4)))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1021-1 {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-10 19:04:44,025 INFO L280 TraceCheckUtils]: 36: Hoare triple {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-10 19:04:44,025 INFO L280 TraceCheckUtils]: 37: Hoare triple {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} assume !(0 != #t~nondet2); {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-10 19:04:44,026 INFO L280 TraceCheckUtils]: 38: Hoare triple {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} havoc #t~nondet2; {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-10 19:04:44,026 INFO L280 TraceCheckUtils]: 39: Hoare triple {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-10 19:04:44,027 INFO L280 TraceCheckUtils]: 40: Hoare triple {4077#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4078#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:44,028 INFO L280 TraceCheckUtils]: 41: Hoare triple {4078#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {4078#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:44,028 INFO L280 TraceCheckUtils]: 42: Hoare triple {4078#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {4078#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:44,029 INFO L280 TraceCheckUtils]: 43: Hoare triple {4078#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1031-6 {4079#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-10 19:04:44,030 INFO L280 TraceCheckUtils]: 44: Hoare triple {4079#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8); {4057#false} is VALID [2020-07-10 19:04:44,030 INFO L280 TraceCheckUtils]: 45: Hoare triple {4057#false} havoc #t~mem8; {4057#false} is VALID [2020-07-10 19:04:44,030 INFO L280 TraceCheckUtils]: 46: Hoare triple {4057#false} assume !false; {4057#false} is VALID [2020-07-10 19:04:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:44,042 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:44,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [734051832] [2020-07-10 19:04:44,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:44,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-10 19:04:44,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159767525] [2020-07-10 19:04:44,043 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2020-07-10 19:04:44,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:44,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-10 19:04:44,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:44,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-10 19:04:44,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:44,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-10 19:04:44,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-07-10 19:04:44,115 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 20 states. [2020-07-10 19:04:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:48,156 INFO L93 Difference]: Finished difference Result 163 states and 170 transitions. [2020-07-10 19:04:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-10 19:04:48,156 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2020-07-10 19:04:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 19:04:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 165 transitions. [2020-07-10 19:04:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 19:04:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 165 transitions. [2020-07-10 19:04:48,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 165 transitions. [2020-07-10 19:04:48,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:48,448 INFO L225 Difference]: With dead ends: 163 [2020-07-10 19:04:48,448 INFO L226 Difference]: Without dead ends: 160 [2020-07-10 19:04:48,450 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=353, Invalid=1129, Unknown=0, NotChecked=0, Total=1482 [2020-07-10 19:04:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-07-10 19:04:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 106. [2020-07-10 19:04:49,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:49,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 106 states. [2020-07-10 19:04:49,056 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 106 states. [2020-07-10 19:04:49,056 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 106 states. [2020-07-10 19:04:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:49,062 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2020-07-10 19:04:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2020-07-10 19:04:49,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:49,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:49,063 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 160 states. [2020-07-10 19:04:49,063 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 160 states. [2020-07-10 19:04:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:49,070 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2020-07-10 19:04:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2020-07-10 19:04:49,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:49,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:49,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:49,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-10 19:04:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2020-07-10 19:04:49,075 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 47 [2020-07-10 19:04:49,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:49,075 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2020-07-10 19:04:49,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-10 19:04:49,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 106 states and 111 transitions. [2020-07-10 19:04:49,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2020-07-10 19:04:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-10 19:04:49,346 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:49,346 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:49,346 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 19:04:49,347 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:49,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:49,347 INFO L82 PathProgramCache]: Analyzing trace with hash 231328440, now seen corresponding path program 2 times [2020-07-10 19:04:49,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:49,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [124258106] [2020-07-10 19:04:49,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:50,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {5003#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4979#true} is VALID [2020-07-10 19:04:50,370 INFO L280 TraceCheckUtils]: 1: Hoare triple {4979#true} #valid := #valid[0 := 0]; {4979#true} is VALID [2020-07-10 19:04:50,370 INFO L280 TraceCheckUtils]: 2: Hoare triple {4979#true} assume 0 < #StackHeapBarrier; {4979#true} is VALID [2020-07-10 19:04:50,370 INFO L280 TraceCheckUtils]: 3: Hoare triple {4979#true} assume true; {4979#true} is VALID [2020-07-10 19:04:50,371 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4979#true} {4979#true} #196#return; {4979#true} is VALID [2020-07-10 19:04:50,371 INFO L263 TraceCheckUtils]: 0: Hoare triple {4979#true} call ULTIMATE.init(); {5003#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:50,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {5003#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4979#true} is VALID [2020-07-10 19:04:50,372 INFO L280 TraceCheckUtils]: 2: Hoare triple {4979#true} #valid := #valid[0 := 0]; {4979#true} is VALID [2020-07-10 19:04:50,372 INFO L280 TraceCheckUtils]: 3: Hoare triple {4979#true} assume 0 < #StackHeapBarrier; {4979#true} is VALID [2020-07-10 19:04:50,372 INFO L280 TraceCheckUtils]: 4: Hoare triple {4979#true} assume true; {4979#true} is VALID [2020-07-10 19:04:50,372 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4979#true} {4979#true} #196#return; {4979#true} is VALID [2020-07-10 19:04:50,372 INFO L263 TraceCheckUtils]: 6: Hoare triple {4979#true} call #t~ret17 := main(); {4979#true} is VALID [2020-07-10 19:04:50,378 INFO L280 TraceCheckUtils]: 7: Hoare triple {4979#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {4986#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-10 19:04:50,379 INFO L280 TraceCheckUtils]: 8: Hoare triple {4986#(= 0 |main_#t~malloc0.offset|)} ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; {4979#true} is VALID [2020-07-10 19:04:50,379 INFO L280 TraceCheckUtils]: 9: Hoare triple {4979#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L995 {4979#true} is VALID [2020-07-10 19:04:50,379 INFO L280 TraceCheckUtils]: 10: Hoare triple {4979#true} SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L995-1 {4979#true} is VALID [2020-07-10 19:04:50,381 INFO L280 TraceCheckUtils]: 11: Hoare triple {4979#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {4987#(and (= 1 (select |#valid| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|))} is VALID [2020-07-10 19:04:50,381 INFO L280 TraceCheckUtils]: 12: Hoare triple {4987#(and (= 1 (select |#valid| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|))} ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; {4988#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:50,383 INFO L280 TraceCheckUtils]: 13: Hoare triple {4988#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L999 {4988#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:50,384 INFO L280 TraceCheckUtils]: 14: Hoare triple {4988#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L999-1 {4989#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,385 INFO L280 TraceCheckUtils]: 15: Hoare triple {4989#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4990#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:50,388 INFO L280 TraceCheckUtils]: 16: Hoare triple {4990#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4990#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:50,397 INFO L280 TraceCheckUtils]: 17: Hoare triple {4990#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} assume !!(0 != #t~nondet2); {4990#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:50,398 INFO L280 TraceCheckUtils]: 18: Hoare triple {4990#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} havoc #t~nondet2; {4990#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:50,400 INFO L280 TraceCheckUtils]: 19: Hoare triple {4990#(and (= 0 main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8); srcloc: L1008 {4991#(and (= 0 main_~list~0.offset) (not (= |main_#t~malloc3.base| main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:50,401 INFO L280 TraceCheckUtils]: 20: Hoare triple {4991#(and (= 0 main_~list~0.offset) (not (= |main_#t~malloc3.base| main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} SUMMARY for call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1008-1 {4992#(and (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 19:04:50,402 INFO L280 TraceCheckUtils]: 21: Hoare triple {4992#(and (= 0 main_~list~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1008-2 {4993#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,403 INFO L280 TraceCheckUtils]: 22: Hoare triple {4993#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,403 INFO L280 TraceCheckUtils]: 23: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem4.base, #t~mem4.offset; {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,405 INFO L280 TraceCheckUtils]: 24: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1010 {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,405 INFO L280 TraceCheckUtils]: 25: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,406 INFO L280 TraceCheckUtils]: 26: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume 0 != #t~nondet5; {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,407 INFO L280 TraceCheckUtils]: 27: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet5; {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,408 INFO L280 TraceCheckUtils]: 28: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1014 {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,408 INFO L280 TraceCheckUtils]: 29: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,409 INFO L280 TraceCheckUtils]: 30: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != #t~nondet2); {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,410 INFO L280 TraceCheckUtils]: 31: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet2; {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,411 INFO L280 TraceCheckUtils]: 32: Hoare triple {4994#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8); srcloc: L1008 {4995#(and (not (= main_~list~0.base main_~end~0.base)) (not (= |main_#t~malloc3.base| main_~list~0.base)) (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,413 INFO L280 TraceCheckUtils]: 33: Hoare triple {4995#(and (not (= main_~list~0.base main_~end~0.base)) (not (= |main_#t~malloc3.base| main_~list~0.base)) (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1008-1 {4996#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~list~0.base)))} is VALID [2020-07-10 19:04:50,414 INFO L280 TraceCheckUtils]: 34: Hoare triple {4996#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~list~0.base)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1008-2 {4997#(and (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,415 INFO L280 TraceCheckUtils]: 35: Hoare triple {4997#(and (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; {4998#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,416 INFO L280 TraceCheckUtils]: 36: Hoare triple {4998#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem4.base, #t~mem4.offset; {4998#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,417 INFO L280 TraceCheckUtils]: 37: Hoare triple {4998#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1010 {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,417 INFO L280 TraceCheckUtils]: 38: Hoare triple {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,418 INFO L280 TraceCheckUtils]: 39: Hoare triple {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} assume 0 != #t~nondet5; {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,419 INFO L280 TraceCheckUtils]: 40: Hoare triple {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet5; {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,419 INFO L280 TraceCheckUtils]: 41: Hoare triple {4999#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~BLACK)) main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1014 {5000#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,420 INFO L280 TraceCheckUtils]: 42: Hoare triple {5000#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5000#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,420 INFO L280 TraceCheckUtils]: 43: Hoare triple {5000#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet2); {5000#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,421 INFO L280 TraceCheckUtils]: 44: Hoare triple {5000#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet2; {5000#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,421 INFO L280 TraceCheckUtils]: 45: Hoare triple {5000#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; {5000#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:50,422 INFO L280 TraceCheckUtils]: 46: Hoare triple {5000#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5001#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:50,422 INFO L280 TraceCheckUtils]: 47: Hoare triple {5001#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {5001#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:50,423 INFO L280 TraceCheckUtils]: 48: Hoare triple {5001#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {5001#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 19:04:50,423 INFO L280 TraceCheckUtils]: 49: Hoare triple {5001#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1031-6 {5002#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-10 19:04:50,424 INFO L280 TraceCheckUtils]: 50: Hoare triple {5002#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume !(~unnamed1~0~BLACK == #t~mem8); {4980#false} is VALID [2020-07-10 19:04:50,424 INFO L280 TraceCheckUtils]: 51: Hoare triple {4980#false} havoc #t~mem8; {4980#false} is VALID [2020-07-10 19:04:50,424 INFO L280 TraceCheckUtils]: 52: Hoare triple {4980#false} assume !false; {4980#false} is VALID [2020-07-10 19:04:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:50,436 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:50,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [124258106] [2020-07-10 19:04:50,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:50,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-10 19:04:50,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782546879] [2020-07-10 19:04:50,438 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2020-07-10 19:04:50,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:50,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-10 19:04:50,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:50,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-10 19:04:50,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:50,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-10 19:04:50,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2020-07-10 19:04:50,525 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 20 states. [2020-07-10 19:04:54,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:54,607 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2020-07-10 19:04:54,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-10 19:04:54,608 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2020-07-10 19:04:54,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 19:04:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 152 transitions. [2020-07-10 19:04:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 19:04:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 152 transitions. [2020-07-10 19:04:54,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 152 transitions. [2020-07-10 19:04:54,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:54,862 INFO L225 Difference]: With dead ends: 179 [2020-07-10 19:04:54,862 INFO L226 Difference]: Without dead ends: 176 [2020-07-10 19:04:54,863 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2020-07-10 19:04:54,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-07-10 19:04:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 117. [2020-07-10 19:04:55,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:55,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand 117 states. [2020-07-10 19:04:55,503 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 117 states. [2020-07-10 19:04:55,504 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 117 states. [2020-07-10 19:04:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:55,510 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2020-07-10 19:04:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 185 transitions. [2020-07-10 19:04:55,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:55,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:55,511 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 176 states. [2020-07-10 19:04:55,511 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 176 states. [2020-07-10 19:04:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:55,517 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2020-07-10 19:04:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 185 transitions. [2020-07-10 19:04:55,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:55,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:55,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:55,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-10 19:04:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2020-07-10 19:04:55,521 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 53 [2020-07-10 19:04:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:55,521 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2020-07-10 19:04:55,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-10 19:04:55,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 117 states and 124 transitions. [2020-07-10 19:04:55,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2020-07-10 19:04:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-10 19:04:55,852 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:55,853 INFO L422 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:55,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 19:04:55,853 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:55,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:55,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2144912159, now seen corresponding path program 1 times [2020-07-10 19:04:55,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:55,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [128235024] [2020-07-10 19:04:55,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:55,884 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 19:04:55,884 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:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) 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-10 19:04:55,891 INFO L168 Benchmark]: Toolchain (without parser) took 30116.25 ms. Allocated memory was 143.1 MB in the beginning and 485.0 MB in the end (delta: 341.8 MB). Free memory was 100.5 MB in the beginning and 411.0 MB in the end (delta: -310.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:55,891 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 143.1 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 19:04:55,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.10 ms. Allocated memory was 143.1 MB in the beginning and 201.9 MB in the end (delta: 58.7 MB). Free memory was 100.3 MB in the beginning and 167.8 MB in the end (delta: -67.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:55,893 INFO L168 Benchmark]: Boogie Preprocessor took 87.81 ms. Allocated memory is still 201.9 MB. Free memory was 167.8 MB in the beginning and 164.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:55,893 INFO L168 Benchmark]: RCFGBuilder took 866.36 ms. Allocated memory is still 201.9 MB. Free memory was 164.2 MB in the beginning and 95.4 MB in the end (delta: 68.8 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:55,894 INFO L168 Benchmark]: TraceAbstraction took 28401.89 ms. Allocated memory was 201.9 MB in the beginning and 485.0 MB in the end (delta: 283.1 MB). Free memory was 94.6 MB in the beginning and 411.0 MB in the end (delta: -316.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 19:04:55,897 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 143.1 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 751.10 ms. Allocated memory was 143.1 MB in the beginning and 201.9 MB in the end (delta: 58.7 MB). Free memory was 100.3 MB in the beginning and 167.8 MB in the end (delta: -67.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 87.81 ms. Allocated memory is still 201.9 MB. Free memory was 167.8 MB in the beginning and 164.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 866.36 ms. Allocated memory is still 201.9 MB. Free memory was 164.2 MB in the beginning and 95.4 MB in the end (delta: 68.8 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28401.89 ms. Allocated memory was 201.9 MB in the beginning and 485.0 MB in the end (delta: 283.1 MB). Free memory was 94.6 MB in the beginning and 411.0 MB in the end (delta: -316.4 MB). There was no memory consumed. 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:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...