/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-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 16:25:31,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 16:25:31,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 16:25:31,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 16:25:31,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 16:25:31,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 16:25:31,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 16:25:31,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 16:25:31,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 16:25:31,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 16:25:31,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 16:25:31,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 16:25:31,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 16:25:31,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 16:25:31,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 16:25:31,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 16:25:31,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 16:25:31,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 16:25:31,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 16:25:31,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 16:25:31,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 16:25:31,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 16:25:31,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 16:25:31,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 16:25:31,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 16:25:31,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 16:25:31,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 16:25:31,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 16:25:31,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 16:25:31,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 16:25:31,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 16:25:31,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 16:25:31,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 16:25:31,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 16:25:31,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 16:25:31,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 16:25:31,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 16:25:31,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 16:25:31,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 16:25:31,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 16:25:31,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 16:25:31,616 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 16:25:31,625 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 16:25:31,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 16:25:31,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 16:25:31,627 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 16:25:31,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 16:25:31,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 16:25:31,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 16:25:31,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 16:25:31,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 16:25:31,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 16:25:31,628 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 16:25:31,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 16:25:31,628 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 16:25:31,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 16:25:31,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 16:25:31,629 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 16:25:31,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 16:25:31,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 16:25:31,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 16:25:31,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 16:25:31,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 16:25:31,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 16:25:31,630 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 16:25:31,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 16:25:31,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 16:25:31,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 16:25:31,923 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 16:25:31,924 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 16:25:31,925 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-2.i [2020-07-08 16:25:31,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc203d94/1a86a279e9ea4716a97814b811107ca2/FLAGdbfdfa13e [2020-07-08 16:25:32,540 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 16:25:32,541 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i [2020-07-08 16:25:32,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc203d94/1a86a279e9ea4716a97814b811107ca2/FLAGdbfdfa13e [2020-07-08 16:25:32,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc203d94/1a86a279e9ea4716a97814b811107ca2 [2020-07-08 16:25:32,866 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 16:25:32,868 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 16:25:32,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 16:25:32,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 16:25:32,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 16:25:32,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:25:32" (1/1) ... [2020-07-08 16:25:32,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38bec9c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:25:32, skipping insertion in model container [2020-07-08 16:25:32,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:25:32" (1/1) ... [2020-07-08 16:25:32,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 16:25:32,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 16:25:33,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:25:33,400 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 16:25:33,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:25:33,506 INFO L208 MainTranslator]: Completed translation [2020-07-08 16:25:33,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:25:33 WrapperNode [2020-07-08 16:25:33,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 16:25:33,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 16:25:33,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 16:25:33,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 16:25:33,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:25:33" (1/1) ... [2020-07-08 16:25:33,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:25:33" (1/1) ... [2020-07-08 16:25:33,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:25:33" (1/1) ... [2020-07-08 16:25:33,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:25:33" (1/1) ... [2020-07-08 16:25:33,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:25:33" (1/1) ... [2020-07-08 16:25:33,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:25:33" (1/1) ... [2020-07-08 16:25:33,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:25:33" (1/1) ... [2020-07-08 16:25:33,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 16:25:33,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 16:25:33,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 16:25:33,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 16:25:33,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:25:33" (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-08 16:25:33,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 16:25:33,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 16:25:33,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 16:25:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-08 16:25:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-08 16:25:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-08 16:25:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-08 16:25:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-08 16:25:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-08 16:25:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-08 16:25:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-08 16:25:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-08 16:25:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-08 16:25:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-08 16:25:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-08 16:25:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-08 16:25:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-08 16:25:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-08 16:25:33,671 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-08 16:25:33,671 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-08 16:25:33,672 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-08 16:25:33,672 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-08 16:25:33,675 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-08 16:25:33,675 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-08 16:25:33,675 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-08 16:25:33,675 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-08 16:25:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-08 16:25:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-08 16:25:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-08 16:25:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-08 16:25:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-08 16:25:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-08 16:25:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-08 16:25:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-08 16:25:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-08 16:25:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-08 16:25:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-08 16:25:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-08 16:25:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-08 16:25:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-08 16:25:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-08 16:25:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-08 16:25:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-08 16:25:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-08 16:25:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-08 16:25:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-08 16:25:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-08 16:25:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-08 16:25:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-08 16:25:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-08 16:25:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-08 16:25:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-08 16:25:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-08 16:25:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 16:25:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-08 16:25:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-08 16:25:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-08 16:25:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-08 16:25:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-08 16:25:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-08 16:25:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-08 16:25:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-08 16:25:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 16:25:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-08 16:25:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-08 16:25:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-08 16:25:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-08 16:25:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-08 16:25:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-08 16:25:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-08 16:25:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-08 16:25:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-08 16:25:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-08 16:25:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-08 16:25:33,684 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-08 16:25:33,684 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-08 16:25:33,684 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-08 16:25:33,685 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-08 16:25:33,685 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-08 16:25:33,685 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-08 16:25:33,686 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-08 16:25:33,686 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-08 16:25:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-08 16:25:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-08 16:25:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-08 16:25:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-08 16:25:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-08 16:25:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-08 16:25:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-08 16:25:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-08 16:25:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-08 16:25:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-08 16:25:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-08 16:25:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-08 16:25:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-08 16:25:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-08 16:25:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-08 16:25:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-08 16:25:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-08 16:25:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-08 16:25:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-08 16:25:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-08 16:25:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-08 16:25:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-08 16:25:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-08 16:25:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-08 16:25:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 16:25:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 16:25:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 16:25:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 16:25:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-08 16:25:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-08 16:25:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 16:25:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 16:25:33,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 16:25:34,602 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 16:25:34,602 INFO L295 CfgBuilder]: Removed 30 assume(true) statements. [2020-07-08 16:25:34,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:25:34 BoogieIcfgContainer [2020-07-08 16:25:34,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 16:25:34,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 16:25:34,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 16:25:34,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 16:25:34,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 04:25:32" (1/3) ... [2020-07-08 16:25:34,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5340c267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:25:34, skipping insertion in model container [2020-07-08 16:25:34,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:25:33" (2/3) ... [2020-07-08 16:25:34,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5340c267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:25:34, skipping insertion in model container [2020-07-08 16:25:34,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:25:34" (3/3) ... [2020-07-08 16:25:34,616 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2020-07-08 16:25:34,627 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 16:25:34,635 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-07-08 16:25:34,649 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-07-08 16:25:34,672 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 16:25:34,672 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 16:25:34,672 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 16:25:34,672 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 16:25:34,673 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 16:25:34,673 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 16:25:34,673 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 16:25:34,673 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 16:25:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states. [2020-07-08 16:25:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-08 16:25:34,706 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:25:34,707 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:25:34,707 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:25:34,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:25:34,714 INFO L82 PathProgramCache]: Analyzing trace with hash 885652866, now seen corresponding path program 1 times [2020-07-08 16:25:34,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:25:34,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [853223323] [2020-07-08 16:25:34,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:25:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:34,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {174#true} is VALID [2020-07-08 16:25:34,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {174#true} #valid := #valid[0 := 0]; {174#true} is VALID [2020-07-08 16:25:34,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#true} assume 0 < #StackHeapBarrier; {174#true} is VALID [2020-07-08 16:25:34,986 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-08 16:25:34,987 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {174#true} {174#true} #419#return; {174#true} is VALID [2020-07-08 16:25:34,990 INFO L263 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:25:34,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {174#true} is VALID [2020-07-08 16:25:34,991 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#true} #valid := #valid[0 := 0]; {174#true} is VALID [2020-07-08 16:25:34,991 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#true} assume 0 < #StackHeapBarrier; {174#true} is VALID [2020-07-08 16:25:34,992 INFO L280 TraceCheckUtils]: 4: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-08 16:25:34,992 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {174#true} {174#true} #419#return; {174#true} is VALID [2020-07-08 16:25:34,992 INFO L263 TraceCheckUtils]: 6: Hoare triple {174#true} call #t~ret28 := main(); {174#true} is VALID [2020-07-08 16:25:34,994 INFO L280 TraceCheckUtils]: 7: Hoare triple {174#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {181#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-08 16:25:34,994 INFO L280 TraceCheckUtils]: 8: Hoare triple {181#(not (= 0 |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {182#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:34,995 INFO L280 TraceCheckUtils]: 9: Hoare triple {182#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {182#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:34,996 INFO L280 TraceCheckUtils]: 10: Hoare triple {182#(not (= 0 main_~list~0.base))} assume !(~list~0.base != 0 || ~list~0.offset != 0); {175#false} is VALID [2020-07-08 16:25:34,996 INFO L280 TraceCheckUtils]: 11: Hoare triple {175#false} assume !false; {175#false} is VALID [2020-07-08 16:25:34,998 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-08 16:25:34,999 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:25:35,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [853223323] [2020-07-08 16:25:35,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:25:35,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 16:25:35,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34080691] [2020-07-08 16:25:35,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-08 16:25:35,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:25:35,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 16:25:35,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:35,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 16:25:35,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:25:35,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 16:25:35,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 16:25:35,053 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 5 states. [2020-07-08 16:25:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:36,431 INFO L93 Difference]: Finished difference Result 360 states and 478 transitions. [2020-07-08 16:25:36,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 16:25:36,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-08 16:25:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:25:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 16:25:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2020-07-08 16:25:36,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 16:25:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2020-07-08 16:25:36,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2020-07-08 16:25:37,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:37,089 INFO L225 Difference]: With dead ends: 360 [2020-07-08 16:25:37,089 INFO L226 Difference]: Without dead ends: 194 [2020-07-08 16:25:37,095 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 16:25:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-07-08 16:25:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2020-07-08 16:25:37,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:25:37,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 164 states. [2020-07-08 16:25:37,374 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 164 states. [2020-07-08 16:25:37,374 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 164 states. [2020-07-08 16:25:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:37,396 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2020-07-08 16:25:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2020-07-08 16:25:37,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:37,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:37,400 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 194 states. [2020-07-08 16:25:37,400 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 194 states. [2020-07-08 16:25:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:37,420 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2020-07-08 16:25:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2020-07-08 16:25:37,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:37,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:37,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:25:37,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:25:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-07-08 16:25:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2020-07-08 16:25:37,448 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 12 [2020-07-08 16:25:37,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:25:37,449 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2020-07-08 16:25:37,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 16:25:37,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 164 states and 174 transitions. [2020-07-08 16:25:37,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2020-07-08 16:25:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 16:25:37,650 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:25:37,650 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] [2020-07-08 16:25:37,651 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 16:25:37,652 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:25:37,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:25:37,652 INFO L82 PathProgramCache]: Analyzing trace with hash 684663316, now seen corresponding path program 1 times [2020-07-08 16:25:37,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:25:37,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1528135619] [2020-07-08 16:25:37,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:25:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:37,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {1632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1624#true} is VALID [2020-07-08 16:25:37,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {1624#true} #valid := #valid[0 := 0]; {1624#true} is VALID [2020-07-08 16:25:37,733 INFO L280 TraceCheckUtils]: 2: Hoare triple {1624#true} assume 0 < #StackHeapBarrier; {1624#true} is VALID [2020-07-08 16:25:37,733 INFO L280 TraceCheckUtils]: 3: Hoare triple {1624#true} assume true; {1624#true} is VALID [2020-07-08 16:25:37,733 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1624#true} {1624#true} #419#return; {1624#true} is VALID [2020-07-08 16:25:37,735 INFO L263 TraceCheckUtils]: 0: Hoare triple {1624#true} call ULTIMATE.init(); {1632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:25:37,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {1632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1624#true} is VALID [2020-07-08 16:25:37,735 INFO L280 TraceCheckUtils]: 2: Hoare triple {1624#true} #valid := #valid[0 := 0]; {1624#true} is VALID [2020-07-08 16:25:37,735 INFO L280 TraceCheckUtils]: 3: Hoare triple {1624#true} assume 0 < #StackHeapBarrier; {1624#true} is VALID [2020-07-08 16:25:37,736 INFO L280 TraceCheckUtils]: 4: Hoare triple {1624#true} assume true; {1624#true} is VALID [2020-07-08 16:25:37,736 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1624#true} {1624#true} #419#return; {1624#true} is VALID [2020-07-08 16:25:37,736 INFO L263 TraceCheckUtils]: 6: Hoare triple {1624#true} call #t~ret28 := main(); {1624#true} is VALID [2020-07-08 16:25:37,737 INFO L280 TraceCheckUtils]: 7: Hoare triple {1624#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {1624#true} is VALID [2020-07-08 16:25:37,737 INFO L280 TraceCheckUtils]: 8: Hoare triple {1624#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {1624#true} is VALID [2020-07-08 16:25:37,737 INFO L280 TraceCheckUtils]: 9: Hoare triple {1624#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {1624#true} is VALID [2020-07-08 16:25:37,738 INFO L280 TraceCheckUtils]: 10: Hoare triple {1624#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1624#true} is VALID [2020-07-08 16:25:37,738 INFO L280 TraceCheckUtils]: 11: Hoare triple {1624#true} goto; {1624#true} is VALID [2020-07-08 16:25:37,738 INFO L280 TraceCheckUtils]: 12: Hoare triple {1624#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1624#true} is VALID [2020-07-08 16:25:37,739 INFO L280 TraceCheckUtils]: 13: Hoare triple {1624#true} assume 0 != #t~nondet1; {1624#true} is VALID [2020-07-08 16:25:37,739 INFO L280 TraceCheckUtils]: 14: Hoare triple {1624#true} havoc #t~nondet1; {1624#true} is VALID [2020-07-08 16:25:37,739 INFO L280 TraceCheckUtils]: 15: Hoare triple {1624#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {1624#true} is VALID [2020-07-08 16:25:37,740 INFO L280 TraceCheckUtils]: 16: Hoare triple {1624#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {1624#true} is VALID [2020-07-08 16:25:37,740 INFO L280 TraceCheckUtils]: 17: Hoare triple {1624#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1624#true} is VALID [2020-07-08 16:25:37,741 INFO L280 TraceCheckUtils]: 18: Hoare triple {1624#true} assume #t~short7; {1631#|main_#t~short7|} is VALID [2020-07-08 16:25:37,741 INFO L280 TraceCheckUtils]: 19: Hoare triple {1631#|main_#t~short7|} assume !#t~short7; {1625#false} is VALID [2020-07-08 16:25:37,742 INFO L280 TraceCheckUtils]: 20: Hoare triple {1625#false} havoc #t~mem6.base, #t~mem6.offset; {1625#false} is VALID [2020-07-08 16:25:37,742 INFO L280 TraceCheckUtils]: 21: Hoare triple {1625#false} havoc #t~mem5.base, #t~mem5.offset; {1625#false} is VALID [2020-07-08 16:25:37,742 INFO L280 TraceCheckUtils]: 22: Hoare triple {1625#false} havoc #t~short7; {1625#false} is VALID [2020-07-08 16:25:37,743 INFO L280 TraceCheckUtils]: 23: Hoare triple {1625#false} assume !false; {1625#false} is VALID [2020-07-08 16:25:37,744 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-08 16:25:37,745 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:25:37,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1528135619] [2020-07-08 16:25:37,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:25:37,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 16:25:37,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30620631] [2020-07-08 16:25:37,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-08 16:25:37,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:25:37,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 16:25:37,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:37,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 16:25:37,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:25:37,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 16:25:37,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 16:25:37,769 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 4 states. [2020-07-08 16:25:38,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:38,555 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2020-07-08 16:25:38,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 16:25:38,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-08 16:25:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:25:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:25:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2020-07-08 16:25:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:25:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2020-07-08 16:25:38,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2020-07-08 16:25:38,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:38,744 INFO L225 Difference]: With dead ends: 170 [2020-07-08 16:25:38,744 INFO L226 Difference]: Without dead ends: 165 [2020-07-08 16:25:38,746 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 16:25:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-07-08 16:25:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2020-07-08 16:25:39,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:25:39,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 165 states. [2020-07-08 16:25:39,023 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2020-07-08 16:25:39,023 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2020-07-08 16:25:39,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:39,030 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2020-07-08 16:25:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2020-07-08 16:25:39,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:39,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:39,032 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2020-07-08 16:25:39,032 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2020-07-08 16:25:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:39,039 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2020-07-08 16:25:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2020-07-08 16:25:39,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:39,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:39,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:25:39,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:25:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-07-08 16:25:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2020-07-08 16:25:39,047 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 24 [2020-07-08 16:25:39,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:25:39,047 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2020-07-08 16:25:39,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 16:25:39,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 165 states and 175 transitions. [2020-07-08 16:25:39,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2020-07-08 16:25:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 16:25:39,271 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:25:39,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:25:39,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 16:25:39,272 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:25:39,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:25:39,273 INFO L82 PathProgramCache]: Analyzing trace with hash -265499727, now seen corresponding path program 1 times [2020-07-08 16:25:39,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:25:39,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1354969210] [2020-07-08 16:25:39,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:25:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:39,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {2647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2635#true} is VALID [2020-07-08 16:25:39,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {2635#true} #valid := #valid[0 := 0]; {2635#true} is VALID [2020-07-08 16:25:39,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {2635#true} assume 0 < #StackHeapBarrier; {2635#true} is VALID [2020-07-08 16:25:39,435 INFO L280 TraceCheckUtils]: 3: Hoare triple {2635#true} assume true; {2635#true} is VALID [2020-07-08 16:25:39,435 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2635#true} {2635#true} #419#return; {2635#true} is VALID [2020-07-08 16:25:39,439 INFO L263 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:25:39,439 INFO L280 TraceCheckUtils]: 1: Hoare triple {2647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2635#true} is VALID [2020-07-08 16:25:39,439 INFO L280 TraceCheckUtils]: 2: Hoare triple {2635#true} #valid := #valid[0 := 0]; {2635#true} is VALID [2020-07-08 16:25:39,440 INFO L280 TraceCheckUtils]: 3: Hoare triple {2635#true} assume 0 < #StackHeapBarrier; {2635#true} is VALID [2020-07-08 16:25:39,440 INFO L280 TraceCheckUtils]: 4: Hoare triple {2635#true} assume true; {2635#true} is VALID [2020-07-08 16:25:39,440 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2635#true} {2635#true} #419#return; {2635#true} is VALID [2020-07-08 16:25:39,440 INFO L263 TraceCheckUtils]: 6: Hoare triple {2635#true} call #t~ret28 := main(); {2635#true} is VALID [2020-07-08 16:25:39,441 INFO L280 TraceCheckUtils]: 7: Hoare triple {2635#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {2635#true} is VALID [2020-07-08 16:25:39,441 INFO L280 TraceCheckUtils]: 8: Hoare triple {2635#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {2635#true} is VALID [2020-07-08 16:25:39,441 INFO L280 TraceCheckUtils]: 9: Hoare triple {2635#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {2635#true} is VALID [2020-07-08 16:25:39,441 INFO L280 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2635#true} is VALID [2020-07-08 16:25:39,441 INFO L280 TraceCheckUtils]: 11: Hoare triple {2635#true} goto; {2635#true} is VALID [2020-07-08 16:25:39,442 INFO L280 TraceCheckUtils]: 12: Hoare triple {2635#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2635#true} is VALID [2020-07-08 16:25:39,442 INFO L280 TraceCheckUtils]: 13: Hoare triple {2635#true} assume 0 != #t~nondet1; {2635#true} is VALID [2020-07-08 16:25:39,442 INFO L280 TraceCheckUtils]: 14: Hoare triple {2635#true} havoc #t~nondet1; {2635#true} is VALID [2020-07-08 16:25:39,443 INFO L280 TraceCheckUtils]: 15: Hoare triple {2635#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {2635#true} is VALID [2020-07-08 16:25:39,444 INFO L280 TraceCheckUtils]: 16: Hoare triple {2635#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {2642#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-08 16:25:39,445 INFO L280 TraceCheckUtils]: 17: Hoare triple {2642#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {2643#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2020-07-08 16:25:39,445 INFO L280 TraceCheckUtils]: 18: Hoare triple {2643#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume !#t~short7; {2644#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:39,446 INFO L280 TraceCheckUtils]: 19: Hoare triple {2644#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {2645#(and (= 0 |main_#t~mem6.offset|) (= 0 |main_#t~mem6.base|))} is VALID [2020-07-08 16:25:39,452 INFO L280 TraceCheckUtils]: 20: Hoare triple {2645#(and (= 0 |main_#t~mem6.offset|) (= 0 |main_#t~mem6.base|))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {2646#|main_#t~short7|} is VALID [2020-07-08 16:25:39,453 INFO L280 TraceCheckUtils]: 21: Hoare triple {2646#|main_#t~short7|} assume !#t~short7; {2636#false} is VALID [2020-07-08 16:25:39,453 INFO L280 TraceCheckUtils]: 22: Hoare triple {2636#false} havoc #t~mem6.base, #t~mem6.offset; {2636#false} is VALID [2020-07-08 16:25:39,454 INFO L280 TraceCheckUtils]: 23: Hoare triple {2636#false} havoc #t~mem5.base, #t~mem5.offset; {2636#false} is VALID [2020-07-08 16:25:39,454 INFO L280 TraceCheckUtils]: 24: Hoare triple {2636#false} havoc #t~short7; {2636#false} is VALID [2020-07-08 16:25:39,454 INFO L280 TraceCheckUtils]: 25: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2020-07-08 16:25:39,455 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-08 16:25:39,455 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:25:39,456 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1354969210] [2020-07-08 16:25:39,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:25:39,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 16:25:39,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139627514] [2020-07-08 16:25:39,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-08 16:25:39,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:25:39,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 16:25:39,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:39,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 16:25:39,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:25:39,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 16:25:39,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-08 16:25:39,495 INFO L87 Difference]: Start difference. First operand 165 states and 175 transitions. Second operand 8 states. [2020-07-08 16:25:41,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:41,384 INFO L93 Difference]: Finished difference Result 258 states and 275 transitions. [2020-07-08 16:25:41,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 16:25:41,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-08 16:25:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:25:41,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 16:25:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 275 transitions. [2020-07-08 16:25:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 16:25:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 275 transitions. [2020-07-08 16:25:41,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 275 transitions. [2020-07-08 16:25:41,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:41,718 INFO L225 Difference]: With dead ends: 258 [2020-07-08 16:25:41,719 INFO L226 Difference]: Without dead ends: 253 [2020-07-08 16:25:41,719 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-07-08 16:25:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-07-08 16:25:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 159. [2020-07-08 16:25:42,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:25:42,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand 159 states. [2020-07-08 16:25:42,102 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand 159 states. [2020-07-08 16:25:42,103 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 159 states. [2020-07-08 16:25:42,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:42,112 INFO L93 Difference]: Finished difference Result 253 states and 270 transitions. [2020-07-08 16:25:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 270 transitions. [2020-07-08 16:25:42,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:42,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:42,113 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 253 states. [2020-07-08 16:25:42,113 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 253 states. [2020-07-08 16:25:42,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:42,123 INFO L93 Difference]: Finished difference Result 253 states and 270 transitions. [2020-07-08 16:25:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 270 transitions. [2020-07-08 16:25:42,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:42,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:42,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:25:42,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:25:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-08 16:25:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-07-08 16:25:42,129 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 26 [2020-07-08 16:25:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:25:42,130 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-07-08 16:25:42,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 16:25:42,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states and 169 transitions. [2020-07-08 16:25:42,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-07-08 16:25:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-08 16:25:42,363 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:25:42,363 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] [2020-07-08 16:25:42,363 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 16:25:42,364 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:25:42,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:25:42,364 INFO L82 PathProgramCache]: Analyzing trace with hash 72562886, now seen corresponding path program 1 times [2020-07-08 16:25:42,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:25:42,365 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [347333696] [2020-07-08 16:25:42,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:25:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:42,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {4014#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4004#true} is VALID [2020-07-08 16:25:42,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {4004#true} #valid := #valid[0 := 0]; {4004#true} is VALID [2020-07-08 16:25:42,486 INFO L280 TraceCheckUtils]: 2: Hoare triple {4004#true} assume 0 < #StackHeapBarrier; {4004#true} is VALID [2020-07-08 16:25:42,486 INFO L280 TraceCheckUtils]: 3: Hoare triple {4004#true} assume true; {4004#true} is VALID [2020-07-08 16:25:42,486 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4004#true} {4004#true} #419#return; {4004#true} is VALID [2020-07-08 16:25:42,487 INFO L263 TraceCheckUtils]: 0: Hoare triple {4004#true} call ULTIMATE.init(); {4014#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:25:42,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {4014#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4004#true} is VALID [2020-07-08 16:25:42,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {4004#true} #valid := #valid[0 := 0]; {4004#true} is VALID [2020-07-08 16:25:42,488 INFO L280 TraceCheckUtils]: 3: Hoare triple {4004#true} assume 0 < #StackHeapBarrier; {4004#true} is VALID [2020-07-08 16:25:42,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {4004#true} assume true; {4004#true} is VALID [2020-07-08 16:25:42,488 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4004#true} {4004#true} #419#return; {4004#true} is VALID [2020-07-08 16:25:42,488 INFO L263 TraceCheckUtils]: 6: Hoare triple {4004#true} call #t~ret28 := main(); {4004#true} is VALID [2020-07-08 16:25:42,489 INFO L280 TraceCheckUtils]: 7: Hoare triple {4004#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {4004#true} is VALID [2020-07-08 16:25:42,489 INFO L280 TraceCheckUtils]: 8: Hoare triple {4004#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {4004#true} is VALID [2020-07-08 16:25:42,489 INFO L280 TraceCheckUtils]: 9: Hoare triple {4004#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {4004#true} is VALID [2020-07-08 16:25:42,490 INFO L280 TraceCheckUtils]: 10: Hoare triple {4004#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {4004#true} is VALID [2020-07-08 16:25:42,490 INFO L280 TraceCheckUtils]: 11: Hoare triple {4004#true} goto; {4004#true} is VALID [2020-07-08 16:25:42,490 INFO L280 TraceCheckUtils]: 12: Hoare triple {4004#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4004#true} is VALID [2020-07-08 16:25:42,491 INFO L280 TraceCheckUtils]: 13: Hoare triple {4004#true} assume 0 != #t~nondet1; {4004#true} is VALID [2020-07-08 16:25:42,491 INFO L280 TraceCheckUtils]: 14: Hoare triple {4004#true} havoc #t~nondet1; {4004#true} is VALID [2020-07-08 16:25:42,492 INFO L280 TraceCheckUtils]: 15: Hoare triple {4004#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {4011#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:42,493 INFO L280 TraceCheckUtils]: 16: Hoare triple {4011#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {4012#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} is VALID [2020-07-08 16:25:42,493 INFO L280 TraceCheckUtils]: 17: Hoare triple {4012#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4013#(not |main_#t~short7|)} is VALID [2020-07-08 16:25:42,494 INFO L280 TraceCheckUtils]: 18: Hoare triple {4013#(not |main_#t~short7|)} assume #t~short7; {4005#false} is VALID [2020-07-08 16:25:42,494 INFO L280 TraceCheckUtils]: 19: Hoare triple {4005#false} assume !!#t~short7; {4005#false} is VALID [2020-07-08 16:25:42,495 INFO L280 TraceCheckUtils]: 20: Hoare triple {4005#false} havoc #t~mem6.base, #t~mem6.offset; {4005#false} is VALID [2020-07-08 16:25:42,495 INFO L280 TraceCheckUtils]: 21: Hoare triple {4005#false} havoc #t~mem5.base, #t~mem5.offset; {4005#false} is VALID [2020-07-08 16:25:42,495 INFO L280 TraceCheckUtils]: 22: Hoare triple {4005#false} havoc #t~short7; {4005#false} is VALID [2020-07-08 16:25:42,495 INFO L280 TraceCheckUtils]: 23: Hoare triple {4005#false} goto; {4005#false} is VALID [2020-07-08 16:25:42,496 INFO L280 TraceCheckUtils]: 24: Hoare triple {4005#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4005#false} is VALID [2020-07-08 16:25:42,496 INFO L280 TraceCheckUtils]: 25: Hoare triple {4005#false} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4005#false} is VALID [2020-07-08 16:25:42,496 INFO L280 TraceCheckUtils]: 26: Hoare triple {4005#false} assume !(0 != #t~nondet8); {4005#false} is VALID [2020-07-08 16:25:42,496 INFO L280 TraceCheckUtils]: 27: Hoare triple {4005#false} havoc #t~nondet8; {4005#false} is VALID [2020-07-08 16:25:42,497 INFO L280 TraceCheckUtils]: 28: Hoare triple {4005#false} ~end~0.base, ~end~0.offset := 0, 0; {4005#false} is VALID [2020-07-08 16:25:42,497 INFO L280 TraceCheckUtils]: 29: Hoare triple {4005#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4005#false} is VALID [2020-07-08 16:25:42,497 INFO L280 TraceCheckUtils]: 30: Hoare triple {4005#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {4005#false} is VALID [2020-07-08 16:25:42,498 INFO L280 TraceCheckUtils]: 31: Hoare triple {4005#false} assume !false; {4005#false} is VALID [2020-07-08 16:25:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 16:25:42,499 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:25:42,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [347333696] [2020-07-08 16:25:42,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:25:42,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 16:25:42,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278724123] [2020-07-08 16:25:42,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-07-08 16:25:42,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:25:42,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 16:25:42,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:42,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 16:25:42,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:25:42,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 16:25:42,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 16:25:42,546 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 6 states. [2020-07-08 16:25:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:44,170 INFO L93 Difference]: Finished difference Result 382 states and 407 transitions. [2020-07-08 16:25:44,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 16:25:44,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-07-08 16:25:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:25:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 16:25:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 407 transitions. [2020-07-08 16:25:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 16:25:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 407 transitions. [2020-07-08 16:25:44,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 407 transitions. [2020-07-08 16:25:44,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:44,576 INFO L225 Difference]: With dead ends: 382 [2020-07-08 16:25:44,577 INFO L226 Difference]: Without dead ends: 253 [2020-07-08 16:25:44,581 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-08 16:25:44,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-07-08 16:25:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 162. [2020-07-08 16:25:44,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:25:44,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand 162 states. [2020-07-08 16:25:44,932 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand 162 states. [2020-07-08 16:25:44,932 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 162 states. [2020-07-08 16:25:44,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:44,942 INFO L93 Difference]: Finished difference Result 253 states and 269 transitions. [2020-07-08 16:25:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 269 transitions. [2020-07-08 16:25:44,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:44,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:44,944 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 253 states. [2020-07-08 16:25:44,944 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 253 states. [2020-07-08 16:25:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:44,954 INFO L93 Difference]: Finished difference Result 253 states and 269 transitions. [2020-07-08 16:25:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 269 transitions. [2020-07-08 16:25:44,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:44,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:44,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:25:44,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:25:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-07-08 16:25:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2020-07-08 16:25:44,962 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 32 [2020-07-08 16:25:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:25:44,964 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2020-07-08 16:25:44,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 16:25:44,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 162 states and 172 transitions. [2020-07-08 16:25:45,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2020-07-08 16:25:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 16:25:45,220 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:25:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:25:45,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 16:25:45,221 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:25:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:25:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash 972027235, now seen corresponding path program 1 times [2020-07-08 16:25:45,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:25:45,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [726697691] [2020-07-08 16:25:45,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:25:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:45,318 INFO L280 TraceCheckUtils]: 0: Hoare triple {5625#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5615#true} is VALID [2020-07-08 16:25:45,318 INFO L280 TraceCheckUtils]: 1: Hoare triple {5615#true} #valid := #valid[0 := 0]; {5615#true} is VALID [2020-07-08 16:25:45,318 INFO L280 TraceCheckUtils]: 2: Hoare triple {5615#true} assume 0 < #StackHeapBarrier; {5615#true} is VALID [2020-07-08 16:25:45,318 INFO L280 TraceCheckUtils]: 3: Hoare triple {5615#true} assume true; {5615#true} is VALID [2020-07-08 16:25:45,319 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5615#true} {5615#true} #419#return; {5615#true} is VALID [2020-07-08 16:25:45,319 INFO L263 TraceCheckUtils]: 0: Hoare triple {5615#true} call ULTIMATE.init(); {5625#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:25:45,319 INFO L280 TraceCheckUtils]: 1: Hoare triple {5625#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5615#true} is VALID [2020-07-08 16:25:45,320 INFO L280 TraceCheckUtils]: 2: Hoare triple {5615#true} #valid := #valid[0 := 0]; {5615#true} is VALID [2020-07-08 16:25:45,320 INFO L280 TraceCheckUtils]: 3: Hoare triple {5615#true} assume 0 < #StackHeapBarrier; {5615#true} is VALID [2020-07-08 16:25:45,320 INFO L280 TraceCheckUtils]: 4: Hoare triple {5615#true} assume true; {5615#true} is VALID [2020-07-08 16:25:45,321 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5615#true} {5615#true} #419#return; {5615#true} is VALID [2020-07-08 16:25:45,321 INFO L263 TraceCheckUtils]: 6: Hoare triple {5615#true} call #t~ret28 := main(); {5615#true} is VALID [2020-07-08 16:25:45,325 INFO L280 TraceCheckUtils]: 7: Hoare triple {5615#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {5622#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-08 16:25:45,329 INFO L280 TraceCheckUtils]: 8: Hoare triple {5622#(not (= 0 |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,329 INFO L280 TraceCheckUtils]: 9: Hoare triple {5623#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,334 INFO L280 TraceCheckUtils]: 10: Hoare triple {5623#(not (= 0 main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,335 INFO L280 TraceCheckUtils]: 11: Hoare triple {5623#(not (= 0 main_~list~0.base))} goto; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,335 INFO L280 TraceCheckUtils]: 12: Hoare triple {5623#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,336 INFO L280 TraceCheckUtils]: 13: Hoare triple {5623#(not (= 0 main_~list~0.base))} assume 0 != #t~nondet1; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,337 INFO L280 TraceCheckUtils]: 14: Hoare triple {5623#(not (= 0 main_~list~0.base))} havoc #t~nondet1; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,337 INFO L280 TraceCheckUtils]: 15: Hoare triple {5623#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,338 INFO L280 TraceCheckUtils]: 16: Hoare triple {5623#(not (= 0 main_~list~0.base))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,338 INFO L280 TraceCheckUtils]: 17: Hoare triple {5623#(not (= 0 main_~list~0.base))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,339 INFO L280 TraceCheckUtils]: 18: Hoare triple {5623#(not (= 0 main_~list~0.base))} assume !#t~short7; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,340 INFO L280 TraceCheckUtils]: 19: Hoare triple {5623#(not (= 0 main_~list~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,340 INFO L280 TraceCheckUtils]: 20: Hoare triple {5623#(not (= 0 main_~list~0.base))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,341 INFO L280 TraceCheckUtils]: 21: Hoare triple {5623#(not (= 0 main_~list~0.base))} assume !!#t~short7; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,341 INFO L280 TraceCheckUtils]: 22: Hoare triple {5623#(not (= 0 main_~list~0.base))} havoc #t~mem6.base, #t~mem6.offset; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,342 INFO L280 TraceCheckUtils]: 23: Hoare triple {5623#(not (= 0 main_~list~0.base))} havoc #t~mem5.base, #t~mem5.offset; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,342 INFO L280 TraceCheckUtils]: 24: Hoare triple {5623#(not (= 0 main_~list~0.base))} havoc #t~short7; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,343 INFO L280 TraceCheckUtils]: 25: Hoare triple {5623#(not (= 0 main_~list~0.base))} goto; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,344 INFO L280 TraceCheckUtils]: 26: Hoare triple {5623#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,344 INFO L280 TraceCheckUtils]: 27: Hoare triple {5623#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,345 INFO L280 TraceCheckUtils]: 28: Hoare triple {5623#(not (= 0 main_~list~0.base))} assume !(0 != #t~nondet8); {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,345 INFO L280 TraceCheckUtils]: 29: Hoare triple {5623#(not (= 0 main_~list~0.base))} havoc #t~nondet8; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,346 INFO L280 TraceCheckUtils]: 30: Hoare triple {5623#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0; {5623#(not (= 0 main_~list~0.base))} is VALID [2020-07-08 16:25:45,347 INFO L280 TraceCheckUtils]: 31: Hoare triple {5623#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5624#(not (= 0 main_~end~0.base))} is VALID [2020-07-08 16:25:45,347 INFO L280 TraceCheckUtils]: 32: Hoare triple {5624#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {5616#false} is VALID [2020-07-08 16:25:45,347 INFO L280 TraceCheckUtils]: 33: Hoare triple {5616#false} assume !false; {5616#false} is VALID [2020-07-08 16:25:45,350 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-08 16:25:45,350 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:25:45,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [726697691] [2020-07-08 16:25:45,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:25:45,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 16:25:45,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140672260] [2020-07-08 16:25:45,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-08 16:25:45,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:25:45,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 16:25:45,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:45,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 16:25:45,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:25:45,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 16:25:45,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 16:25:45,387 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 6 states. [2020-07-08 16:25:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:46,727 INFO L93 Difference]: Finished difference Result 271 states and 288 transitions. [2020-07-08 16:25:46,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 16:25:46,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-08 16:25:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:25:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 16:25:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2020-07-08 16:25:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 16:25:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2020-07-08 16:25:46,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 285 transitions. [2020-07-08 16:25:47,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:47,088 INFO L225 Difference]: With dead ends: 271 [2020-07-08 16:25:47,088 INFO L226 Difference]: Without dead ends: 239 [2020-07-08 16:25:47,089 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-08 16:25:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-07-08 16:25:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 161. [2020-07-08 16:25:47,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:25:47,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand 161 states. [2020-07-08 16:25:47,460 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 161 states. [2020-07-08 16:25:47,460 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 161 states. [2020-07-08 16:25:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:47,468 INFO L93 Difference]: Finished difference Result 239 states and 254 transitions. [2020-07-08 16:25:47,468 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2020-07-08 16:25:47,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:47,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:47,469 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 239 states. [2020-07-08 16:25:47,469 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 239 states. [2020-07-08 16:25:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:47,475 INFO L93 Difference]: Finished difference Result 239 states and 254 transitions. [2020-07-08 16:25:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2020-07-08 16:25:47,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:47,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:47,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:25:47,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:25:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-07-08 16:25:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2020-07-08 16:25:47,480 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 34 [2020-07-08 16:25:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:25:47,480 INFO L479 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2020-07-08 16:25:47,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 16:25:47,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 161 states and 171 transitions. [2020-07-08 16:25:47,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:47,749 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2020-07-08 16:25:47,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 16:25:47,750 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:25:47,750 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:25:47,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 16:25:47,751 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:25:47,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:25:47,751 INFO L82 PathProgramCache]: Analyzing trace with hash -401575995, now seen corresponding path program 1 times [2020-07-08 16:25:47,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:25:47,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1934537010] [2020-07-08 16:25:47,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:25:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:47,877 INFO L280 TraceCheckUtils]: 0: Hoare triple {6985#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6974#true} is VALID [2020-07-08 16:25:47,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {6974#true} #valid := #valid[0 := 0]; {6974#true} is VALID [2020-07-08 16:25:47,878 INFO L280 TraceCheckUtils]: 2: Hoare triple {6974#true} assume 0 < #StackHeapBarrier; {6974#true} is VALID [2020-07-08 16:25:47,878 INFO L280 TraceCheckUtils]: 3: Hoare triple {6974#true} assume true; {6974#true} is VALID [2020-07-08 16:25:47,878 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6974#true} {6974#true} #419#return; {6974#true} is VALID [2020-07-08 16:25:47,879 INFO L263 TraceCheckUtils]: 0: Hoare triple {6974#true} call ULTIMATE.init(); {6985#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:25:47,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {6985#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6974#true} is VALID [2020-07-08 16:25:47,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {6974#true} #valid := #valid[0 := 0]; {6974#true} is VALID [2020-07-08 16:25:47,880 INFO L280 TraceCheckUtils]: 3: Hoare triple {6974#true} assume 0 < #StackHeapBarrier; {6974#true} is VALID [2020-07-08 16:25:47,880 INFO L280 TraceCheckUtils]: 4: Hoare triple {6974#true} assume true; {6974#true} is VALID [2020-07-08 16:25:47,880 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6974#true} {6974#true} #419#return; {6974#true} is VALID [2020-07-08 16:25:47,881 INFO L263 TraceCheckUtils]: 6: Hoare triple {6974#true} call #t~ret28 := main(); {6974#true} is VALID [2020-07-08 16:25:47,881 INFO L280 TraceCheckUtils]: 7: Hoare triple {6974#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {6974#true} is VALID [2020-07-08 16:25:47,881 INFO L280 TraceCheckUtils]: 8: Hoare triple {6974#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {6974#true} is VALID [2020-07-08 16:25:47,881 INFO L280 TraceCheckUtils]: 9: Hoare triple {6974#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {6974#true} is VALID [2020-07-08 16:25:47,881 INFO L280 TraceCheckUtils]: 10: Hoare triple {6974#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {6974#true} is VALID [2020-07-08 16:25:47,882 INFO L280 TraceCheckUtils]: 11: Hoare triple {6974#true} goto; {6974#true} is VALID [2020-07-08 16:25:47,882 INFO L280 TraceCheckUtils]: 12: Hoare triple {6974#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6974#true} is VALID [2020-07-08 16:25:47,882 INFO L280 TraceCheckUtils]: 13: Hoare triple {6974#true} assume 0 != #t~nondet1; {6974#true} is VALID [2020-07-08 16:25:47,882 INFO L280 TraceCheckUtils]: 14: Hoare triple {6974#true} havoc #t~nondet1; {6974#true} is VALID [2020-07-08 16:25:47,882 INFO L280 TraceCheckUtils]: 15: Hoare triple {6974#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {6974#true} is VALID [2020-07-08 16:25:47,882 INFO L280 TraceCheckUtils]: 16: Hoare triple {6974#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {6974#true} is VALID [2020-07-08 16:25:47,883 INFO L280 TraceCheckUtils]: 17: Hoare triple {6974#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {6974#true} is VALID [2020-07-08 16:25:47,883 INFO L280 TraceCheckUtils]: 18: Hoare triple {6974#true} assume !#t~short7; {6974#true} is VALID [2020-07-08 16:25:47,883 INFO L280 TraceCheckUtils]: 19: Hoare triple {6974#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {6974#true} is VALID [2020-07-08 16:25:47,883 INFO L280 TraceCheckUtils]: 20: Hoare triple {6974#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {6974#true} is VALID [2020-07-08 16:25:47,883 INFO L280 TraceCheckUtils]: 21: Hoare triple {6974#true} assume !!#t~short7; {6974#true} is VALID [2020-07-08 16:25:47,883 INFO L280 TraceCheckUtils]: 22: Hoare triple {6974#true} havoc #t~mem6.base, #t~mem6.offset; {6974#true} is VALID [2020-07-08 16:25:47,884 INFO L280 TraceCheckUtils]: 23: Hoare triple {6974#true} havoc #t~mem5.base, #t~mem5.offset; {6974#true} is VALID [2020-07-08 16:25:47,884 INFO L280 TraceCheckUtils]: 24: Hoare triple {6974#true} havoc #t~short7; {6974#true} is VALID [2020-07-08 16:25:47,884 INFO L280 TraceCheckUtils]: 25: Hoare triple {6974#true} goto; {6974#true} is VALID [2020-07-08 16:25:47,884 INFO L280 TraceCheckUtils]: 26: Hoare triple {6974#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6974#true} is VALID [2020-07-08 16:25:47,884 INFO L280 TraceCheckUtils]: 27: Hoare triple {6974#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {6974#true} is VALID [2020-07-08 16:25:47,885 INFO L280 TraceCheckUtils]: 28: Hoare triple {6974#true} assume !!(0 != #t~nondet8); {6974#true} is VALID [2020-07-08 16:25:47,885 INFO L280 TraceCheckUtils]: 29: Hoare triple {6974#true} havoc #t~nondet8; {6974#true} is VALID [2020-07-08 16:25:47,886 INFO L280 TraceCheckUtils]: 30: Hoare triple {6974#true} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(8); srcloc: L1001 {6981#(not (= 0 |main_#t~malloc9.base|))} is VALID [2020-07-08 16:25:47,887 INFO L280 TraceCheckUtils]: 31: Hoare triple {6981#(not (= 0 |main_#t~malloc9.base|))} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1001-1 {6982#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 16:25:47,887 INFO L280 TraceCheckUtils]: 32: Hoare triple {6982#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1001-2 {6983#(not (= 0 |main_#t~mem10.base|))} is VALID [2020-07-08 16:25:47,888 INFO L280 TraceCheckUtils]: 33: Hoare triple {6983#(not (= 0 |main_#t~mem10.base|))} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {6984#(not (= 0 main_~end~0.base))} is VALID [2020-07-08 16:25:47,893 INFO L280 TraceCheckUtils]: 34: Hoare triple {6984#(not (= 0 main_~end~0.base))} havoc #t~mem10.base, #t~mem10.offset; {6984#(not (= 0 main_~end~0.base))} is VALID [2020-07-08 16:25:47,893 INFO L280 TraceCheckUtils]: 35: Hoare triple {6984#(not (= 0 main_~end~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1003 {6984#(not (= 0 main_~end~0.base))} is VALID [2020-07-08 16:25:47,894 INFO L280 TraceCheckUtils]: 36: Hoare triple {6984#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {6975#false} is VALID [2020-07-08 16:25:47,894 INFO L280 TraceCheckUtils]: 37: Hoare triple {6975#false} assume !false; {6975#false} is VALID [2020-07-08 16:25:47,895 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-08 16:25:47,896 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:25:47,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1934537010] [2020-07-08 16:25:47,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:25:47,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 16:25:47,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527484030] [2020-07-08 16:25:47,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-08 16:25:47,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:25:47,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 16:25:47,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:47,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 16:25:47,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:25:47,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 16:25:47,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 16:25:47,940 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 7 states. [2020-07-08 16:25:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:49,976 INFO L93 Difference]: Finished difference Result 245 states and 261 transitions. [2020-07-08 16:25:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 16:25:49,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-08 16:25:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:25:49,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 16:25:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 256 transitions. [2020-07-08 16:25:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 16:25:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 256 transitions. [2020-07-08 16:25:49,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 256 transitions. [2020-07-08 16:25:50,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:50,261 INFO L225 Difference]: With dead ends: 245 [2020-07-08 16:25:50,261 INFO L226 Difference]: Without dead ends: 241 [2020-07-08 16:25:50,261 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-07-08 16:25:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-07-08 16:25:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 157. [2020-07-08 16:25:50,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:25:50,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand 157 states. [2020-07-08 16:25:50,631 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 157 states. [2020-07-08 16:25:50,631 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 157 states. [2020-07-08 16:25:50,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:50,637 INFO L93 Difference]: Finished difference Result 241 states and 257 transitions. [2020-07-08 16:25:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 257 transitions. [2020-07-08 16:25:50,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:50,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:50,638 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 241 states. [2020-07-08 16:25:50,638 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 241 states. [2020-07-08 16:25:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:50,644 INFO L93 Difference]: Finished difference Result 241 states and 257 transitions. [2020-07-08 16:25:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 257 transitions. [2020-07-08 16:25:50,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:50,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:50,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:25:50,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:25:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-07-08 16:25:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2020-07-08 16:25:50,649 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 38 [2020-07-08 16:25:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:25:50,650 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2020-07-08 16:25:50,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 16:25:50,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 157 states and 167 transitions. [2020-07-08 16:25:50,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2020-07-08 16:25:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-08 16:25:50,935 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:25:50,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:25:50,935 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 16:25:50,935 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:25:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:25:50,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1938604912, now seen corresponding path program 1 times [2020-07-08 16:25:50,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:25:50,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1200974661] [2020-07-08 16:25:50,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:25:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:51,008 INFO L280 TraceCheckUtils]: 0: Hoare triple {8295#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8287#true} is VALID [2020-07-08 16:25:51,009 INFO L280 TraceCheckUtils]: 1: Hoare triple {8287#true} #valid := #valid[0 := 0]; {8287#true} is VALID [2020-07-08 16:25:51,009 INFO L280 TraceCheckUtils]: 2: Hoare triple {8287#true} assume 0 < #StackHeapBarrier; {8287#true} is VALID [2020-07-08 16:25:51,009 INFO L280 TraceCheckUtils]: 3: Hoare triple {8287#true} assume true; {8287#true} is VALID [2020-07-08 16:25:51,009 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8287#true} {8287#true} #419#return; {8287#true} is VALID [2020-07-08 16:25:51,010 INFO L263 TraceCheckUtils]: 0: Hoare triple {8287#true} call ULTIMATE.init(); {8295#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:25:51,010 INFO L280 TraceCheckUtils]: 1: Hoare triple {8295#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8287#true} is VALID [2020-07-08 16:25:51,011 INFO L280 TraceCheckUtils]: 2: Hoare triple {8287#true} #valid := #valid[0 := 0]; {8287#true} is VALID [2020-07-08 16:25:51,011 INFO L280 TraceCheckUtils]: 3: Hoare triple {8287#true} assume 0 < #StackHeapBarrier; {8287#true} is VALID [2020-07-08 16:25:51,011 INFO L280 TraceCheckUtils]: 4: Hoare triple {8287#true} assume true; {8287#true} is VALID [2020-07-08 16:25:51,011 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8287#true} {8287#true} #419#return; {8287#true} is VALID [2020-07-08 16:25:51,012 INFO L263 TraceCheckUtils]: 6: Hoare triple {8287#true} call #t~ret28 := main(); {8287#true} is VALID [2020-07-08 16:25:51,012 INFO L280 TraceCheckUtils]: 7: Hoare triple {8287#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {8287#true} is VALID [2020-07-08 16:25:51,012 INFO L280 TraceCheckUtils]: 8: Hoare triple {8287#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {8287#true} is VALID [2020-07-08 16:25:51,012 INFO L280 TraceCheckUtils]: 9: Hoare triple {8287#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {8287#true} is VALID [2020-07-08 16:25:51,012 INFO L280 TraceCheckUtils]: 10: Hoare triple {8287#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {8287#true} is VALID [2020-07-08 16:25:51,013 INFO L280 TraceCheckUtils]: 11: Hoare triple {8287#true} goto; {8287#true} is VALID [2020-07-08 16:25:51,013 INFO L280 TraceCheckUtils]: 12: Hoare triple {8287#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8287#true} is VALID [2020-07-08 16:25:51,013 INFO L280 TraceCheckUtils]: 13: Hoare triple {8287#true} assume 0 != #t~nondet1; {8287#true} is VALID [2020-07-08 16:25:51,013 INFO L280 TraceCheckUtils]: 14: Hoare triple {8287#true} havoc #t~nondet1; {8287#true} is VALID [2020-07-08 16:25:51,014 INFO L280 TraceCheckUtils]: 15: Hoare triple {8287#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {8287#true} is VALID [2020-07-08 16:25:51,014 INFO L280 TraceCheckUtils]: 16: Hoare triple {8287#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {8287#true} is VALID [2020-07-08 16:25:51,014 INFO L280 TraceCheckUtils]: 17: Hoare triple {8287#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {8287#true} is VALID [2020-07-08 16:25:51,015 INFO L280 TraceCheckUtils]: 18: Hoare triple {8287#true} assume !#t~short7; {8287#true} is VALID [2020-07-08 16:25:51,015 INFO L280 TraceCheckUtils]: 19: Hoare triple {8287#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {8287#true} is VALID [2020-07-08 16:25:51,015 INFO L280 TraceCheckUtils]: 20: Hoare triple {8287#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {8287#true} is VALID [2020-07-08 16:25:51,015 INFO L280 TraceCheckUtils]: 21: Hoare triple {8287#true} assume !!#t~short7; {8287#true} is VALID [2020-07-08 16:25:51,016 INFO L280 TraceCheckUtils]: 22: Hoare triple {8287#true} havoc #t~mem6.base, #t~mem6.offset; {8287#true} is VALID [2020-07-08 16:25:51,016 INFO L280 TraceCheckUtils]: 23: Hoare triple {8287#true} havoc #t~mem5.base, #t~mem5.offset; {8287#true} is VALID [2020-07-08 16:25:51,016 INFO L280 TraceCheckUtils]: 24: Hoare triple {8287#true} havoc #t~short7; {8287#true} is VALID [2020-07-08 16:25:51,016 INFO L280 TraceCheckUtils]: 25: Hoare triple {8287#true} goto; {8287#true} is VALID [2020-07-08 16:25:51,017 INFO L280 TraceCheckUtils]: 26: Hoare triple {8287#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {8287#true} is VALID [2020-07-08 16:25:51,017 INFO L280 TraceCheckUtils]: 27: Hoare triple {8287#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8287#true} is VALID [2020-07-08 16:25:51,017 INFO L280 TraceCheckUtils]: 28: Hoare triple {8287#true} assume !(0 != #t~nondet8); {8287#true} is VALID [2020-07-08 16:25:51,017 INFO L280 TraceCheckUtils]: 29: Hoare triple {8287#true} havoc #t~nondet8; {8287#true} is VALID [2020-07-08 16:25:51,018 INFO L280 TraceCheckUtils]: 30: Hoare triple {8287#true} ~end~0.base, ~end~0.offset := 0, 0; {8287#true} is VALID [2020-07-08 16:25:51,018 INFO L280 TraceCheckUtils]: 31: Hoare triple {8287#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {8287#true} is VALID [2020-07-08 16:25:51,018 INFO L280 TraceCheckUtils]: 32: Hoare triple {8287#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {8287#true} is VALID [2020-07-08 16:25:51,018 INFO L280 TraceCheckUtils]: 33: Hoare triple {8287#true} goto; {8287#true} is VALID [2020-07-08 16:25:51,018 INFO L280 TraceCheckUtils]: 34: Hoare triple {8287#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {8287#true} is VALID [2020-07-08 16:25:51,019 INFO L280 TraceCheckUtils]: 35: Hoare triple {8287#true} ~len~0 := 0; {8294#(= 0 main_~len~0)} is VALID [2020-07-08 16:25:51,020 INFO L280 TraceCheckUtils]: 36: Hoare triple {8294#(= 0 main_~len~0)} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {8294#(= 0 main_~len~0)} is VALID [2020-07-08 16:25:51,020 INFO L280 TraceCheckUtils]: 37: Hoare triple {8294#(= 0 main_~len~0)} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {8294#(= 0 main_~len~0)} is VALID [2020-07-08 16:25:51,021 INFO L280 TraceCheckUtils]: 38: Hoare triple {8294#(= 0 main_~len~0)} havoc #t~mem18.base, #t~mem18.offset; {8294#(= 0 main_~len~0)} is VALID [2020-07-08 16:25:51,021 INFO L280 TraceCheckUtils]: 39: Hoare triple {8294#(= 0 main_~len~0)} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {8294#(= 0 main_~len~0)} is VALID [2020-07-08 16:25:51,022 INFO L280 TraceCheckUtils]: 40: Hoare triple {8294#(= 0 main_~len~0)} assume !(~len~0 <= 1); {8288#false} is VALID [2020-07-08 16:25:51,022 INFO L280 TraceCheckUtils]: 41: Hoare triple {8288#false} assume !false; {8288#false} is VALID [2020-07-08 16:25:51,024 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-08 16:25:51,024 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:25:51,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1200974661] [2020-07-08 16:25:51,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:25:51,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 16:25:51,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365000697] [2020-07-08 16:25:51,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-08 16:25:51,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:25:51,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 16:25:51,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:51,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 16:25:51,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:25:51,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 16:25:51,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 16:25:51,061 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 4 states. [2020-07-08 16:25:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:52,114 INFO L93 Difference]: Finished difference Result 267 states and 287 transitions. [2020-07-08 16:25:52,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 16:25:52,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-08 16:25:52,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:25:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:25:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2020-07-08 16:25:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:25:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2020-07-08 16:25:52,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 283 transitions. [2020-07-08 16:25:52,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:52,369 INFO L225 Difference]: With dead ends: 267 [2020-07-08 16:25:52,369 INFO L226 Difference]: Without dead ends: 196 [2020-07-08 16:25:52,371 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 16:25:52,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-07-08 16:25:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 160. [2020-07-08 16:25:52,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:25:52,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 160 states. [2020-07-08 16:25:52,779 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 160 states. [2020-07-08 16:25:52,779 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 160 states. [2020-07-08 16:25:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:52,783 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2020-07-08 16:25:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 209 transitions. [2020-07-08 16:25:52,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:52,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:52,785 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 196 states. [2020-07-08 16:25:52,785 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 196 states. [2020-07-08 16:25:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:52,789 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2020-07-08 16:25:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 209 transitions. [2020-07-08 16:25:52,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:52,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:52,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:25:52,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:25:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-07-08 16:25:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2020-07-08 16:25:52,795 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 42 [2020-07-08 16:25:52,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:25:52,795 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2020-07-08 16:25:52,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 16:25:52,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 160 states and 171 transitions. [2020-07-08 16:25:53,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2020-07-08 16:25:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-08 16:25:53,086 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:25:53,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:25:53,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 16:25:53,086 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:25:53,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:25:53,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1017153069, now seen corresponding path program 1 times [2020-07-08 16:25:53,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:25:53,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [629318865] [2020-07-08 16:25:53,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:25:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:53,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {9552#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9544#true} is VALID [2020-07-08 16:25:53,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {9544#true} #valid := #valid[0 := 0]; {9544#true} is VALID [2020-07-08 16:25:53,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {9544#true} assume 0 < #StackHeapBarrier; {9544#true} is VALID [2020-07-08 16:25:53,198 INFO L280 TraceCheckUtils]: 3: Hoare triple {9544#true} assume true; {9544#true} is VALID [2020-07-08 16:25:53,198 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {9544#true} {9544#true} #419#return; {9544#true} is VALID [2020-07-08 16:25:53,199 INFO L263 TraceCheckUtils]: 0: Hoare triple {9544#true} call ULTIMATE.init(); {9552#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:25:53,199 INFO L280 TraceCheckUtils]: 1: Hoare triple {9552#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9544#true} is VALID [2020-07-08 16:25:53,200 INFO L280 TraceCheckUtils]: 2: Hoare triple {9544#true} #valid := #valid[0 := 0]; {9544#true} is VALID [2020-07-08 16:25:53,200 INFO L280 TraceCheckUtils]: 3: Hoare triple {9544#true} assume 0 < #StackHeapBarrier; {9544#true} is VALID [2020-07-08 16:25:53,201 INFO L280 TraceCheckUtils]: 4: Hoare triple {9544#true} assume true; {9544#true} is VALID [2020-07-08 16:25:53,201 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {9544#true} {9544#true} #419#return; {9544#true} is VALID [2020-07-08 16:25:53,201 INFO L263 TraceCheckUtils]: 6: Hoare triple {9544#true} call #t~ret28 := main(); {9544#true} is VALID [2020-07-08 16:25:53,201 INFO L280 TraceCheckUtils]: 7: Hoare triple {9544#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {9544#true} is VALID [2020-07-08 16:25:53,202 INFO L280 TraceCheckUtils]: 8: Hoare triple {9544#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {9544#true} is VALID [2020-07-08 16:25:53,202 INFO L280 TraceCheckUtils]: 9: Hoare triple {9544#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {9544#true} is VALID [2020-07-08 16:25:53,202 INFO L280 TraceCheckUtils]: 10: Hoare triple {9544#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {9544#true} is VALID [2020-07-08 16:25:53,202 INFO L280 TraceCheckUtils]: 11: Hoare triple {9544#true} goto; {9544#true} is VALID [2020-07-08 16:25:53,202 INFO L280 TraceCheckUtils]: 12: Hoare triple {9544#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9544#true} is VALID [2020-07-08 16:25:53,203 INFO L280 TraceCheckUtils]: 13: Hoare triple {9544#true} assume 0 != #t~nondet1; {9544#true} is VALID [2020-07-08 16:25:53,203 INFO L280 TraceCheckUtils]: 14: Hoare triple {9544#true} havoc #t~nondet1; {9544#true} is VALID [2020-07-08 16:25:53,203 INFO L280 TraceCheckUtils]: 15: Hoare triple {9544#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {9544#true} is VALID [2020-07-08 16:25:53,204 INFO L280 TraceCheckUtils]: 16: Hoare triple {9544#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {9544#true} is VALID [2020-07-08 16:25:53,204 INFO L280 TraceCheckUtils]: 17: Hoare triple {9544#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {9544#true} is VALID [2020-07-08 16:25:53,205 INFO L280 TraceCheckUtils]: 18: Hoare triple {9544#true} assume !#t~short7; {9544#true} is VALID [2020-07-08 16:25:53,205 INFO L280 TraceCheckUtils]: 19: Hoare triple {9544#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {9544#true} is VALID [2020-07-08 16:25:53,205 INFO L280 TraceCheckUtils]: 20: Hoare triple {9544#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {9544#true} is VALID [2020-07-08 16:25:53,205 INFO L280 TraceCheckUtils]: 21: Hoare triple {9544#true} assume !!#t~short7; {9544#true} is VALID [2020-07-08 16:25:53,205 INFO L280 TraceCheckUtils]: 22: Hoare triple {9544#true} havoc #t~mem6.base, #t~mem6.offset; {9544#true} is VALID [2020-07-08 16:25:53,206 INFO L280 TraceCheckUtils]: 23: Hoare triple {9544#true} havoc #t~mem5.base, #t~mem5.offset; {9544#true} is VALID [2020-07-08 16:25:53,206 INFO L280 TraceCheckUtils]: 24: Hoare triple {9544#true} havoc #t~short7; {9544#true} is VALID [2020-07-08 16:25:53,206 INFO L280 TraceCheckUtils]: 25: Hoare triple {9544#true} goto; {9544#true} is VALID [2020-07-08 16:25:53,206 INFO L280 TraceCheckUtils]: 26: Hoare triple {9544#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {9544#true} is VALID [2020-07-08 16:25:53,206 INFO L280 TraceCheckUtils]: 27: Hoare triple {9544#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {9544#true} is VALID [2020-07-08 16:25:53,207 INFO L280 TraceCheckUtils]: 28: Hoare triple {9544#true} assume !(0 != #t~nondet8); {9544#true} is VALID [2020-07-08 16:25:53,207 INFO L280 TraceCheckUtils]: 29: Hoare triple {9544#true} havoc #t~nondet8; {9544#true} is VALID [2020-07-08 16:25:53,207 INFO L280 TraceCheckUtils]: 30: Hoare triple {9544#true} ~end~0.base, ~end~0.offset := 0, 0; {9544#true} is VALID [2020-07-08 16:25:53,207 INFO L280 TraceCheckUtils]: 31: Hoare triple {9544#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {9544#true} is VALID [2020-07-08 16:25:53,208 INFO L280 TraceCheckUtils]: 32: Hoare triple {9544#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {9544#true} is VALID [2020-07-08 16:25:53,208 INFO L280 TraceCheckUtils]: 33: Hoare triple {9544#true} goto; {9544#true} is VALID [2020-07-08 16:25:53,208 INFO L280 TraceCheckUtils]: 34: Hoare triple {9544#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {9544#true} is VALID [2020-07-08 16:25:53,208 INFO L280 TraceCheckUtils]: 35: Hoare triple {9544#true} ~len~0 := 0; {9544#true} is VALID [2020-07-08 16:25:53,208 INFO L280 TraceCheckUtils]: 36: Hoare triple {9544#true} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {9544#true} is VALID [2020-07-08 16:25:53,209 INFO L280 TraceCheckUtils]: 37: Hoare triple {9544#true} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {9544#true} is VALID [2020-07-08 16:25:53,209 INFO L280 TraceCheckUtils]: 38: Hoare triple {9544#true} havoc #t~mem18.base, #t~mem18.offset; {9544#true} is VALID [2020-07-08 16:25:53,210 INFO L280 TraceCheckUtils]: 39: Hoare triple {9544#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {9551#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-08 16:25:53,213 INFO L280 TraceCheckUtils]: 40: Hoare triple {9551#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume 0 == ~len~0; {9551#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-08 16:25:53,213 INFO L280 TraceCheckUtils]: 41: Hoare triple {9551#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} ~len~0 := 1; {9551#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-08 16:25:53,214 INFO L280 TraceCheckUtils]: 42: Hoare triple {9551#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {9545#false} is VALID [2020-07-08 16:25:53,214 INFO L280 TraceCheckUtils]: 43: Hoare triple {9545#false} assume !false; {9545#false} is VALID [2020-07-08 16:25:53,216 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-08 16:25:53,216 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:25:53,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [629318865] [2020-07-08 16:25:53,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:25:53,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 16:25:53,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867254614] [2020-07-08 16:25:53,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-07-08 16:25:53,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:25:53,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 16:25:53,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:53,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 16:25:53,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:25:53,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 16:25:53,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 16:25:53,263 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand 4 states. [2020-07-08 16:25:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:54,225 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2020-07-08 16:25:54,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 16:25:54,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-07-08 16:25:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:25:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:25:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-08 16:25:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:25:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-08 16:25:54,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2020-07-08 16:25:54,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:54,384 INFO L225 Difference]: With dead ends: 160 [2020-07-08 16:25:54,384 INFO L226 Difference]: Without dead ends: 158 [2020-07-08 16:25:54,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 16:25:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-08 16:25:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-07-08 16:25:54,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:25:54,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 158 states. [2020-07-08 16:25:54,814 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2020-07-08 16:25:54,814 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2020-07-08 16:25:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:54,818 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2020-07-08 16:25:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2020-07-08 16:25:54,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:54,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:54,819 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2020-07-08 16:25:54,819 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2020-07-08 16:25:54,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:54,822 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2020-07-08 16:25:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2020-07-08 16:25:54,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:25:54,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:25:54,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:25:54,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:25:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-07-08 16:25:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2020-07-08 16:25:54,826 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 44 [2020-07-08 16:25:54,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:25:54,826 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2020-07-08 16:25:54,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 16:25:54,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 158 states and 169 transitions. [2020-07-08 16:25:55,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2020-07-08 16:25:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 16:25:55,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:25:55,135 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:25:55,135 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 16:25:55,135 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:25:55,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:25:55,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1203451366, now seen corresponding path program 1 times [2020-07-08 16:25:55,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:25:55,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1532267187] [2020-07-08 16:25:55,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:25:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:25:55,402 INFO L280 TraceCheckUtils]: 0: Hoare triple {10522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10507#true} is VALID [2020-07-08 16:25:55,403 INFO L280 TraceCheckUtils]: 1: Hoare triple {10507#true} #valid := #valid[0 := 0]; {10507#true} is VALID [2020-07-08 16:25:55,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {10507#true} assume 0 < #StackHeapBarrier; {10507#true} is VALID [2020-07-08 16:25:55,403 INFO L280 TraceCheckUtils]: 3: Hoare triple {10507#true} assume true; {10507#true} is VALID [2020-07-08 16:25:55,404 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10507#true} {10507#true} #419#return; {10507#true} is VALID [2020-07-08 16:25:55,405 INFO L263 TraceCheckUtils]: 0: Hoare triple {10507#true} call ULTIMATE.init(); {10522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:25:55,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {10522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10507#true} is VALID [2020-07-08 16:25:55,406 INFO L280 TraceCheckUtils]: 2: Hoare triple {10507#true} #valid := #valid[0 := 0]; {10507#true} is VALID [2020-07-08 16:25:55,406 INFO L280 TraceCheckUtils]: 3: Hoare triple {10507#true} assume 0 < #StackHeapBarrier; {10507#true} is VALID [2020-07-08 16:25:55,406 INFO L280 TraceCheckUtils]: 4: Hoare triple {10507#true} assume true; {10507#true} is VALID [2020-07-08 16:25:55,406 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10507#true} {10507#true} #419#return; {10507#true} is VALID [2020-07-08 16:25:55,407 INFO L263 TraceCheckUtils]: 6: Hoare triple {10507#true} call #t~ret28 := main(); {10507#true} is VALID [2020-07-08 16:25:55,409 INFO L280 TraceCheckUtils]: 7: Hoare triple {10507#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {10514#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-08 16:25:55,409 INFO L280 TraceCheckUtils]: 8: Hoare triple {10514#(= 0 |main_#t~malloc0.offset|)} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {10515#(= 0 main_~list~0.offset)} is VALID [2020-07-08 16:25:55,410 INFO L280 TraceCheckUtils]: 9: Hoare triple {10515#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {10515#(= 0 main_~list~0.offset)} is VALID [2020-07-08 16:25:55,412 INFO L280 TraceCheckUtils]: 10: Hoare triple {10515#(= 0 main_~list~0.offset)} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {10515#(= 0 main_~list~0.offset)} is VALID [2020-07-08 16:25:55,413 INFO L280 TraceCheckUtils]: 11: Hoare triple {10515#(= 0 main_~list~0.offset)} goto; {10515#(= 0 main_~list~0.offset)} is VALID [2020-07-08 16:25:55,414 INFO L280 TraceCheckUtils]: 12: Hoare triple {10515#(= 0 main_~list~0.offset)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {10515#(= 0 main_~list~0.offset)} is VALID [2020-07-08 16:25:55,414 INFO L280 TraceCheckUtils]: 13: Hoare triple {10515#(= 0 main_~list~0.offset)} assume 0 != #t~nondet1; {10515#(= 0 main_~list~0.offset)} is VALID [2020-07-08 16:25:55,415 INFO L280 TraceCheckUtils]: 14: Hoare triple {10515#(= 0 main_~list~0.offset)} havoc #t~nondet1; {10515#(= 0 main_~list~0.offset)} is VALID [2020-07-08 16:25:55,416 INFO L280 TraceCheckUtils]: 15: Hoare triple {10515#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {10515#(= 0 main_~list~0.offset)} is VALID [2020-07-08 16:25:55,417 INFO L280 TraceCheckUtils]: 16: Hoare triple {10515#(= 0 main_~list~0.offset)} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {10516#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-08 16:25:55,418 INFO L280 TraceCheckUtils]: 17: Hoare triple {10516#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {10517#(and (or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 main_~list~0.offset))} is VALID [2020-07-08 16:25:55,419 INFO L280 TraceCheckUtils]: 18: Hoare triple {10517#(and (or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 main_~list~0.offset))} assume !#t~short7; {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:55,420 INFO L280 TraceCheckUtils]: 19: Hoare triple {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:55,421 INFO L280 TraceCheckUtils]: 20: Hoare triple {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:55,422 INFO L280 TraceCheckUtils]: 21: Hoare triple {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!#t~short7; {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:55,423 INFO L280 TraceCheckUtils]: 22: Hoare triple {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:55,424 INFO L280 TraceCheckUtils]: 23: Hoare triple {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:55,425 INFO L280 TraceCheckUtils]: 24: Hoare triple {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~short7; {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:55,426 INFO L280 TraceCheckUtils]: 25: Hoare triple {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:55,426 INFO L280 TraceCheckUtils]: 26: Hoare triple {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:55,427 INFO L280 TraceCheckUtils]: 27: Hoare triple {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:55,428 INFO L280 TraceCheckUtils]: 28: Hoare triple {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:55,429 INFO L280 TraceCheckUtils]: 29: Hoare triple {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:55,430 INFO L280 TraceCheckUtils]: 30: Hoare triple {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:25:55,431 INFO L280 TraceCheckUtils]: 31: Hoare triple {10518#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {10519#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-08 16:25:55,432 INFO L280 TraceCheckUtils]: 32: Hoare triple {10519#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {10519#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-08 16:25:55,433 INFO L280 TraceCheckUtils]: 33: Hoare triple {10519#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} goto; {10519#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-08 16:25:55,433 INFO L280 TraceCheckUtils]: 34: Hoare triple {10519#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {10519#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-08 16:25:55,434 INFO L280 TraceCheckUtils]: 35: Hoare triple {10519#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} ~len~0 := 0; {10519#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-08 16:25:55,435 INFO L280 TraceCheckUtils]: 36: Hoare triple {10519#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {10520#(and (= 0 |main_#t~mem18.offset|) (= 0 |main_#t~mem18.base|))} is VALID [2020-07-08 16:25:55,436 INFO L280 TraceCheckUtils]: 37: Hoare triple {10520#(and (= 0 |main_#t~mem18.offset|) (= 0 |main_#t~mem18.base|))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {10521#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-08 16:25:55,436 INFO L280 TraceCheckUtils]: 38: Hoare triple {10521#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} havoc #t~mem18.base, #t~mem18.offset; {10521#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-08 16:25:55,437 INFO L280 TraceCheckUtils]: 39: Hoare triple {10521#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {10508#false} is VALID [2020-07-08 16:25:55,437 INFO L280 TraceCheckUtils]: 40: Hoare triple {10508#false} assume 0 == ~len~0; {10508#false} is VALID [2020-07-08 16:25:55,438 INFO L280 TraceCheckUtils]: 41: Hoare triple {10508#false} ~len~0 := 1; {10508#false} is VALID [2020-07-08 16:25:55,438 INFO L280 TraceCheckUtils]: 42: Hoare triple {10508#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {10508#false} is VALID [2020-07-08 16:25:55,438 INFO L280 TraceCheckUtils]: 43: Hoare triple {10508#false} goto; {10508#false} is VALID [2020-07-08 16:25:55,438 INFO L280 TraceCheckUtils]: 44: Hoare triple {10508#false} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {10508#false} is VALID [2020-07-08 16:25:55,439 INFO L280 TraceCheckUtils]: 45: Hoare triple {10508#false} assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); {10508#false} is VALID [2020-07-08 16:25:55,439 INFO L280 TraceCheckUtils]: 46: Hoare triple {10508#false} havoc #t~mem19.base, #t~mem19.offset; {10508#false} is VALID [2020-07-08 16:25:55,439 INFO L280 TraceCheckUtils]: 47: Hoare triple {10508#false} assume !false; {10508#false} is VALID [2020-07-08 16:25:55,447 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-08 16:25:55,448 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:25:55,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1532267187] [2020-07-08 16:25:55,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:25:55,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 16:25:55,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356878132] [2020-07-08 16:25:55,455 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-07-08 16:25:55,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:25:55,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 16:25:55,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:55,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 16:25:55,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:25:55,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 16:25:55,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-08 16:25:55,511 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 11 states. [2020-07-08 16:25:59,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:25:59,394 INFO L93 Difference]: Finished difference Result 398 states and 427 transitions. [2020-07-08 16:25:59,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-08 16:25:59,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-07-08 16:25:59,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:25:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 16:25:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 415 transitions. [2020-07-08 16:25:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 16:25:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 415 transitions. [2020-07-08 16:25:59,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 415 transitions. [2020-07-08 16:25:59,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:25:59,935 INFO L225 Difference]: With dead ends: 398 [2020-07-08 16:25:59,936 INFO L226 Difference]: Without dead ends: 326 [2020-07-08 16:25:59,936 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2020-07-08 16:25:59,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-07-08 16:26:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 204. [2020-07-08 16:26:00,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:26:00,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand 204 states. [2020-07-08 16:26:00,722 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand 204 states. [2020-07-08 16:26:00,722 INFO L87 Difference]: Start difference. First operand 326 states. Second operand 204 states. [2020-07-08 16:26:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:00,731 INFO L93 Difference]: Finished difference Result 326 states and 348 transitions. [2020-07-08 16:26:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 348 transitions. [2020-07-08 16:26:00,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:00,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:00,732 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 326 states. [2020-07-08 16:26:00,732 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 326 states. [2020-07-08 16:26:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:00,741 INFO L93 Difference]: Finished difference Result 326 states and 348 transitions. [2020-07-08 16:26:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 348 transitions. [2020-07-08 16:26:00,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:00,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:00,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:26:00,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:26:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-07-08 16:26:00,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 220 transitions. [2020-07-08 16:26:00,747 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 220 transitions. Word has length 48 [2020-07-08 16:26:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:26:00,747 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 220 transitions. [2020-07-08 16:26:00,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 16:26:00,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 204 states and 220 transitions. [2020-07-08 16:26:01,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 220 transitions. [2020-07-08 16:26:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-08 16:26:01,195 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:26:01,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:26:01,195 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 16:26:01,198 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:26:01,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:26:01,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2069783995, now seen corresponding path program 1 times [2020-07-08 16:26:01,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:26:01,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763772330] [2020-07-08 16:26:01,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:26:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:01,265 INFO L280 TraceCheckUtils]: 0: Hoare triple {12415#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {12407#true} is VALID [2020-07-08 16:26:01,266 INFO L280 TraceCheckUtils]: 1: Hoare triple {12407#true} #valid := #valid[0 := 0]; {12407#true} is VALID [2020-07-08 16:26:01,266 INFO L280 TraceCheckUtils]: 2: Hoare triple {12407#true} assume 0 < #StackHeapBarrier; {12407#true} is VALID [2020-07-08 16:26:01,266 INFO L280 TraceCheckUtils]: 3: Hoare triple {12407#true} assume true; {12407#true} is VALID [2020-07-08 16:26:01,266 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {12407#true} {12407#true} #419#return; {12407#true} is VALID [2020-07-08 16:26:01,267 INFO L263 TraceCheckUtils]: 0: Hoare triple {12407#true} call ULTIMATE.init(); {12415#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:26:01,268 INFO L280 TraceCheckUtils]: 1: Hoare triple {12415#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {12407#true} is VALID [2020-07-08 16:26:01,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {12407#true} #valid := #valid[0 := 0]; {12407#true} is VALID [2020-07-08 16:26:01,268 INFO L280 TraceCheckUtils]: 3: Hoare triple {12407#true} assume 0 < #StackHeapBarrier; {12407#true} is VALID [2020-07-08 16:26:01,268 INFO L280 TraceCheckUtils]: 4: Hoare triple {12407#true} assume true; {12407#true} is VALID [2020-07-08 16:26:01,268 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {12407#true} {12407#true} #419#return; {12407#true} is VALID [2020-07-08 16:26:01,269 INFO L263 TraceCheckUtils]: 6: Hoare triple {12407#true} call #t~ret28 := main(); {12407#true} is VALID [2020-07-08 16:26:01,269 INFO L280 TraceCheckUtils]: 7: Hoare triple {12407#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {12407#true} is VALID [2020-07-08 16:26:01,269 INFO L280 TraceCheckUtils]: 8: Hoare triple {12407#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {12407#true} is VALID [2020-07-08 16:26:01,269 INFO L280 TraceCheckUtils]: 9: Hoare triple {12407#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {12407#true} is VALID [2020-07-08 16:26:01,269 INFO L280 TraceCheckUtils]: 10: Hoare triple {12407#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {12407#true} is VALID [2020-07-08 16:26:01,270 INFO L280 TraceCheckUtils]: 11: Hoare triple {12407#true} goto; {12407#true} is VALID [2020-07-08 16:26:01,270 INFO L280 TraceCheckUtils]: 12: Hoare triple {12407#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {12407#true} is VALID [2020-07-08 16:26:01,270 INFO L280 TraceCheckUtils]: 13: Hoare triple {12407#true} assume 0 != #t~nondet1; {12407#true} is VALID [2020-07-08 16:26:01,270 INFO L280 TraceCheckUtils]: 14: Hoare triple {12407#true} havoc #t~nondet1; {12407#true} is VALID [2020-07-08 16:26:01,271 INFO L280 TraceCheckUtils]: 15: Hoare triple {12407#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {12407#true} is VALID [2020-07-08 16:26:01,271 INFO L280 TraceCheckUtils]: 16: Hoare triple {12407#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {12407#true} is VALID [2020-07-08 16:26:01,271 INFO L280 TraceCheckUtils]: 17: Hoare triple {12407#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {12407#true} is VALID [2020-07-08 16:26:01,273 INFO L280 TraceCheckUtils]: 18: Hoare triple {12407#true} assume !#t~short7; {12407#true} is VALID [2020-07-08 16:26:01,273 INFO L280 TraceCheckUtils]: 19: Hoare triple {12407#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {12407#true} is VALID [2020-07-08 16:26:01,273 INFO L280 TraceCheckUtils]: 20: Hoare triple {12407#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {12407#true} is VALID [2020-07-08 16:26:01,274 INFO L280 TraceCheckUtils]: 21: Hoare triple {12407#true} assume !!#t~short7; {12407#true} is VALID [2020-07-08 16:26:01,274 INFO L280 TraceCheckUtils]: 22: Hoare triple {12407#true} havoc #t~mem6.base, #t~mem6.offset; {12407#true} is VALID [2020-07-08 16:26:01,274 INFO L280 TraceCheckUtils]: 23: Hoare triple {12407#true} havoc #t~mem5.base, #t~mem5.offset; {12407#true} is VALID [2020-07-08 16:26:01,274 INFO L280 TraceCheckUtils]: 24: Hoare triple {12407#true} havoc #t~short7; {12407#true} is VALID [2020-07-08 16:26:01,274 INFO L280 TraceCheckUtils]: 25: Hoare triple {12407#true} goto; {12407#true} is VALID [2020-07-08 16:26:01,275 INFO L280 TraceCheckUtils]: 26: Hoare triple {12407#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {12407#true} is VALID [2020-07-08 16:26:01,275 INFO L280 TraceCheckUtils]: 27: Hoare triple {12407#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {12407#true} is VALID [2020-07-08 16:26:01,275 INFO L280 TraceCheckUtils]: 28: Hoare triple {12407#true} assume !!(0 != #t~nondet8); {12407#true} is VALID [2020-07-08 16:26:01,275 INFO L280 TraceCheckUtils]: 29: Hoare triple {12407#true} havoc #t~nondet8; {12407#true} is VALID [2020-07-08 16:26:01,277 INFO L280 TraceCheckUtils]: 30: Hoare triple {12407#true} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(8); srcloc: L1001 {12407#true} is VALID [2020-07-08 16:26:01,278 INFO L280 TraceCheckUtils]: 31: Hoare triple {12407#true} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1001-1 {12407#true} is VALID [2020-07-08 16:26:01,278 INFO L280 TraceCheckUtils]: 32: Hoare triple {12407#true} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1001-2 {12407#true} is VALID [2020-07-08 16:26:01,278 INFO L280 TraceCheckUtils]: 33: Hoare triple {12407#true} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {12407#true} is VALID [2020-07-08 16:26:01,278 INFO L280 TraceCheckUtils]: 34: Hoare triple {12407#true} havoc #t~mem10.base, #t~mem10.offset; {12407#true} is VALID [2020-07-08 16:26:01,279 INFO L280 TraceCheckUtils]: 35: Hoare triple {12407#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1003 {12407#true} is VALID [2020-07-08 16:26:01,279 INFO L280 TraceCheckUtils]: 36: Hoare triple {12407#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {12407#true} is VALID [2020-07-08 16:26:01,279 INFO L280 TraceCheckUtils]: 37: Hoare triple {12407#true} goto; {12407#true} is VALID [2020-07-08 16:26:01,281 INFO L280 TraceCheckUtils]: 38: Hoare triple {12407#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {12407#true} is VALID [2020-07-08 16:26:01,281 INFO L280 TraceCheckUtils]: 39: Hoare triple {12407#true} goto; {12407#true} is VALID [2020-07-08 16:26:01,287 INFO L280 TraceCheckUtils]: 40: Hoare triple {12407#true} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {12407#true} is VALID [2020-07-08 16:26:01,288 INFO L280 TraceCheckUtils]: 41: Hoare triple {12407#true} assume 0 != #t~nondet11; {12407#true} is VALID [2020-07-08 16:26:01,288 INFO L280 TraceCheckUtils]: 42: Hoare triple {12407#true} havoc #t~nondet11; {12407#true} is VALID [2020-07-08 16:26:01,288 INFO L280 TraceCheckUtils]: 43: Hoare triple {12407#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-7 {12407#true} is VALID [2020-07-08 16:26:01,288 INFO L280 TraceCheckUtils]: 44: Hoare triple {12407#true} SUMMARY for call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-34 {12407#true} is VALID [2020-07-08 16:26:01,289 INFO L280 TraceCheckUtils]: 45: Hoare triple {12407#true} #t~short17 := #t~mem15.base != 0 || #t~mem15.offset != 0; {12407#true} is VALID [2020-07-08 16:26:01,291 INFO L280 TraceCheckUtils]: 46: Hoare triple {12407#true} assume #t~short17; {12414#|main_#t~short17|} is VALID [2020-07-08 16:26:01,292 INFO L280 TraceCheckUtils]: 47: Hoare triple {12414#|main_#t~short17|} assume !#t~short17; {12408#false} is VALID [2020-07-08 16:26:01,292 INFO L280 TraceCheckUtils]: 48: Hoare triple {12408#false} havoc #t~mem16.base, #t~mem16.offset; {12408#false} is VALID [2020-07-08 16:26:01,293 INFO L280 TraceCheckUtils]: 49: Hoare triple {12408#false} havoc #t~mem15.base, #t~mem15.offset; {12408#false} is VALID [2020-07-08 16:26:01,293 INFO L280 TraceCheckUtils]: 50: Hoare triple {12408#false} havoc #t~short17; {12408#false} is VALID [2020-07-08 16:26:01,293 INFO L280 TraceCheckUtils]: 51: Hoare triple {12408#false} assume !false; {12408#false} is VALID [2020-07-08 16:26:01,294 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-08 16:26:01,295 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:26:01,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1763772330] [2020-07-08 16:26:01,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:26:01,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 16:26:01,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684017405] [2020-07-08 16:26:01,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-07-08 16:26:01,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:26:01,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 16:26:01,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:01,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 16:26:01,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:26:01,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 16:26:01,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 16:26:01,345 INFO L87 Difference]: Start difference. First operand 204 states and 220 transitions. Second operand 4 states. [2020-07-08 16:26:02,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:02,624 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2020-07-08 16:26:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 16:26:02,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-07-08 16:26:02,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:26:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:26:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-08 16:26:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:26:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-08 16:26:02,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2020-07-08 16:26:02,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:02,784 INFO L225 Difference]: With dead ends: 211 [2020-07-08 16:26:02,784 INFO L226 Difference]: Without dead ends: 206 [2020-07-08 16:26:02,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 16:26:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-08 16:26:03,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2020-07-08 16:26:03,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:26:03,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 206 states. [2020-07-08 16:26:03,543 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 206 states. [2020-07-08 16:26:03,544 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 206 states. [2020-07-08 16:26:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:03,548 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2020-07-08 16:26:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2020-07-08 16:26:03,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:03,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:03,549 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 206 states. [2020-07-08 16:26:03,549 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 206 states. [2020-07-08 16:26:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:03,554 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2020-07-08 16:26:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2020-07-08 16:26:03,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:03,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:03,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:26:03,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:26:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-07-08 16:26:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 222 transitions. [2020-07-08 16:26:03,559 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 222 transitions. Word has length 52 [2020-07-08 16:26:03,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:26:03,559 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 222 transitions. [2020-07-08 16:26:03,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 16:26:03,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 206 states and 222 transitions. [2020-07-08 16:26:04,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2020-07-08 16:26:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-08 16:26:04,021 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:26:04,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:26:04,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 16:26:04,021 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:26:04,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:26:04,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1565892499, now seen corresponding path program 1 times [2020-07-08 16:26:04,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:26:04,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1404967291] [2020-07-08 16:26:04,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:26:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:04,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {13682#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {13664#true} is VALID [2020-07-08 16:26:04,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {13664#true} #valid := #valid[0 := 0]; {13664#true} is VALID [2020-07-08 16:26:04,608 INFO L280 TraceCheckUtils]: 2: Hoare triple {13664#true} assume 0 < #StackHeapBarrier; {13664#true} is VALID [2020-07-08 16:26:04,608 INFO L280 TraceCheckUtils]: 3: Hoare triple {13664#true} assume true; {13664#true} is VALID [2020-07-08 16:26:04,608 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {13664#true} {13664#true} #419#return; {13664#true} is VALID [2020-07-08 16:26:04,609 INFO L263 TraceCheckUtils]: 0: Hoare triple {13664#true} call ULTIMATE.init(); {13682#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:26:04,610 INFO L280 TraceCheckUtils]: 1: Hoare triple {13682#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {13664#true} is VALID [2020-07-08 16:26:04,610 INFO L280 TraceCheckUtils]: 2: Hoare triple {13664#true} #valid := #valid[0 := 0]; {13664#true} is VALID [2020-07-08 16:26:04,610 INFO L280 TraceCheckUtils]: 3: Hoare triple {13664#true} assume 0 < #StackHeapBarrier; {13664#true} is VALID [2020-07-08 16:26:04,611 INFO L280 TraceCheckUtils]: 4: Hoare triple {13664#true} assume true; {13664#true} is VALID [2020-07-08 16:26:04,611 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {13664#true} {13664#true} #419#return; {13664#true} is VALID [2020-07-08 16:26:04,611 INFO L263 TraceCheckUtils]: 6: Hoare triple {13664#true} call #t~ret28 := main(); {13664#true} is VALID [2020-07-08 16:26:04,612 INFO L280 TraceCheckUtils]: 7: Hoare triple {13664#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {13671#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} is VALID [2020-07-08 16:26:04,613 INFO L280 TraceCheckUtils]: 8: Hoare triple {13671#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {13672#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-08 16:26:04,614 INFO L280 TraceCheckUtils]: 9: Hoare triple {13672#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {13672#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-08 16:26:04,615 INFO L280 TraceCheckUtils]: 10: Hoare triple {13672#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {13672#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-08 16:26:04,616 INFO L280 TraceCheckUtils]: 11: Hoare triple {13672#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} goto; {13672#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-08 16:26:04,616 INFO L280 TraceCheckUtils]: 12: Hoare triple {13672#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {13672#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-08 16:26:04,617 INFO L280 TraceCheckUtils]: 13: Hoare triple {13672#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !(0 != #t~nondet1); {13672#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-08 16:26:04,618 INFO L280 TraceCheckUtils]: 14: Hoare triple {13672#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} havoc #t~nondet1; {13672#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-08 16:26:04,619 INFO L280 TraceCheckUtils]: 15: Hoare triple {13672#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {13673#(and (= 0 |main_#t~malloc2.offset|) (= 0 main_~list~0.offset) (not (= |main_#t~malloc2.base| main_~list~0.base)))} is VALID [2020-07-08 16:26:04,620 INFO L280 TraceCheckUtils]: 16: Hoare triple {13673#(and (= 0 |main_#t~malloc2.offset|) (= 0 main_~list~0.offset) (not (= |main_#t~malloc2.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {13674#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2020-07-08 16:26:04,622 INFO L280 TraceCheckUtils]: 17: Hoare triple {13674#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {13675#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} is VALID [2020-07-08 16:26:04,623 INFO L280 TraceCheckUtils]: 18: Hoare triple {13675#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {13674#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2020-07-08 16:26:04,624 INFO L280 TraceCheckUtils]: 19: Hoare triple {13674#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} havoc #t~mem3.base, #t~mem3.offset; {13674#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2020-07-08 16:26:04,625 INFO L280 TraceCheckUtils]: 20: Hoare triple {13674#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {13676#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= 0 |main_#t~mem4.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} is VALID [2020-07-08 16:26:04,626 INFO L280 TraceCheckUtils]: 21: Hoare triple {13676#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= 0 |main_#t~mem4.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,627 INFO L280 TraceCheckUtils]: 22: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~mem4.base, #t~mem4.offset; {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,628 INFO L280 TraceCheckUtils]: 23: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,629 INFO L280 TraceCheckUtils]: 24: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,630 INFO L280 TraceCheckUtils]: 25: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume #t~short7; {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,631 INFO L280 TraceCheckUtils]: 26: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume !!#t~short7; {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,632 INFO L280 TraceCheckUtils]: 27: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,633 INFO L280 TraceCheckUtils]: 28: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,634 INFO L280 TraceCheckUtils]: 29: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~short7; {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,635 INFO L280 TraceCheckUtils]: 30: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} goto; {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,636 INFO L280 TraceCheckUtils]: 31: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,637 INFO L280 TraceCheckUtils]: 32: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,638 INFO L280 TraceCheckUtils]: 33: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,639 INFO L280 TraceCheckUtils]: 34: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,640 INFO L280 TraceCheckUtils]: 35: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:04,641 INFO L280 TraceCheckUtils]: 36: Hoare triple {13677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {13678#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-08 16:26:04,641 INFO L280 TraceCheckUtils]: 37: Hoare triple {13678#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {13678#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-08 16:26:04,642 INFO L280 TraceCheckUtils]: 38: Hoare triple {13678#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} goto; {13678#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-08 16:26:04,643 INFO L280 TraceCheckUtils]: 39: Hoare triple {13678#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {13678#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-08 16:26:04,644 INFO L280 TraceCheckUtils]: 40: Hoare triple {13678#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} ~len~0 := 0; {13678#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-08 16:26:04,645 INFO L280 TraceCheckUtils]: 41: Hoare triple {13678#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {13679#(and (= 0 |main_#t~mem18.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 4)))} is VALID [2020-07-08 16:26:04,646 INFO L280 TraceCheckUtils]: 42: Hoare triple {13679#(and (= 0 |main_#t~mem18.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 4)))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {13680#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-08 16:26:04,647 INFO L280 TraceCheckUtils]: 43: Hoare triple {13680#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} havoc #t~mem18.base, #t~mem18.offset; {13680#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-08 16:26:04,648 INFO L280 TraceCheckUtils]: 44: Hoare triple {13680#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {13680#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-08 16:26:04,648 INFO L280 TraceCheckUtils]: 45: Hoare triple {13680#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} assume 0 == ~len~0; {13680#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-08 16:26:04,649 INFO L280 TraceCheckUtils]: 46: Hoare triple {13680#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} ~len~0 := 1; {13680#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-08 16:26:04,650 INFO L280 TraceCheckUtils]: 47: Hoare triple {13680#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {13680#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-08 16:26:04,651 INFO L280 TraceCheckUtils]: 48: Hoare triple {13680#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} goto; {13680#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-08 16:26:04,652 INFO L280 TraceCheckUtils]: 49: Hoare triple {13680#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {13681#(and (= 0 |main_#t~mem19.offset|) (= 0 |main_#t~mem19.base|))} is VALID [2020-07-08 16:26:04,653 INFO L280 TraceCheckUtils]: 50: Hoare triple {13681#(and (= 0 |main_#t~mem19.offset|) (= 0 |main_#t~mem19.base|))} assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); {13665#false} is VALID [2020-07-08 16:26:04,653 INFO L280 TraceCheckUtils]: 51: Hoare triple {13665#false} havoc #t~mem19.base, #t~mem19.offset; {13665#false} is VALID [2020-07-08 16:26:04,653 INFO L280 TraceCheckUtils]: 52: Hoare triple {13665#false} assume !false; {13665#false} is VALID [2020-07-08 16:26:04,675 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-08 16:26:04,676 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:26:04,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1404967291] [2020-07-08 16:26:04,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:26:04,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-08 16:26:04,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448093042] [2020-07-08 16:26:04,678 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2020-07-08 16:26:04,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:26:04,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 16:26:04,759 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-08 16:26:04,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 16:26:04,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:26:04,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 16:26:04,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-07-08 16:26:04,760 INFO L87 Difference]: Start difference. First operand 206 states and 222 transitions. Second operand 14 states. [2020-07-08 16:26:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:14,596 INFO L93 Difference]: Finished difference Result 636 states and 681 transitions. [2020-07-08 16:26:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-08 16:26:14,597 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2020-07-08 16:26:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:26:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 16:26:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 556 transitions. [2020-07-08 16:26:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 16:26:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 556 transitions. [2020-07-08 16:26:14,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 556 transitions. [2020-07-08 16:26:15,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 556 edges. 556 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:15,589 INFO L225 Difference]: With dead ends: 636 [2020-07-08 16:26:15,589 INFO L226 Difference]: Without dead ends: 633 [2020-07-08 16:26:15,590 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2020-07-08 16:26:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-07-08 16:26:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 225. [2020-07-08 16:26:17,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:26:17,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 633 states. Second operand 225 states. [2020-07-08 16:26:17,002 INFO L74 IsIncluded]: Start isIncluded. First operand 633 states. Second operand 225 states. [2020-07-08 16:26:17,003 INFO L87 Difference]: Start difference. First operand 633 states. Second operand 225 states. [2020-07-08 16:26:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:17,024 INFO L93 Difference]: Finished difference Result 633 states and 678 transitions. [2020-07-08 16:26:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 678 transitions. [2020-07-08 16:26:17,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:17,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:17,026 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 633 states. [2020-07-08 16:26:17,026 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 633 states. [2020-07-08 16:26:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:17,046 INFO L93 Difference]: Finished difference Result 633 states and 678 transitions. [2020-07-08 16:26:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 678 transitions. [2020-07-08 16:26:17,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:17,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:17,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:26:17,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:26:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2020-07-08 16:26:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 243 transitions. [2020-07-08 16:26:17,052 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 243 transitions. Word has length 53 [2020-07-08 16:26:17,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:26:17,052 INFO L479 AbstractCegarLoop]: Abstraction has 225 states and 243 transitions. [2020-07-08 16:26:17,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 16:26:17,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 225 states and 243 transitions. [2020-07-08 16:26:17,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 243 transitions. [2020-07-08 16:26:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-08 16:26:17,848 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:26:17,848 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:26:17,848 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 16:26:17,848 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:26:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:26:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash 991929043, now seen corresponding path program 1 times [2020-07-08 16:26:17,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:26:17,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [241156768] [2020-07-08 16:26:17,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:26:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:18,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {16723#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {16711#true} is VALID [2020-07-08 16:26:18,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {16711#true} #valid := #valid[0 := 0]; {16711#true} is VALID [2020-07-08 16:26:18,040 INFO L280 TraceCheckUtils]: 2: Hoare triple {16711#true} assume 0 < #StackHeapBarrier; {16711#true} is VALID [2020-07-08 16:26:18,040 INFO L280 TraceCheckUtils]: 3: Hoare triple {16711#true} assume true; {16711#true} is VALID [2020-07-08 16:26:18,041 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {16711#true} {16711#true} #419#return; {16711#true} is VALID [2020-07-08 16:26:18,042 INFO L263 TraceCheckUtils]: 0: Hoare triple {16711#true} call ULTIMATE.init(); {16723#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:26:18,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {16723#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {16711#true} is VALID [2020-07-08 16:26:18,042 INFO L280 TraceCheckUtils]: 2: Hoare triple {16711#true} #valid := #valid[0 := 0]; {16711#true} is VALID [2020-07-08 16:26:18,042 INFO L280 TraceCheckUtils]: 3: Hoare triple {16711#true} assume 0 < #StackHeapBarrier; {16711#true} is VALID [2020-07-08 16:26:18,043 INFO L280 TraceCheckUtils]: 4: Hoare triple {16711#true} assume true; {16711#true} is VALID [2020-07-08 16:26:18,043 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {16711#true} {16711#true} #419#return; {16711#true} is VALID [2020-07-08 16:26:18,043 INFO L263 TraceCheckUtils]: 6: Hoare triple {16711#true} call #t~ret28 := main(); {16711#true} is VALID [2020-07-08 16:26:18,043 INFO L280 TraceCheckUtils]: 7: Hoare triple {16711#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {16711#true} is VALID [2020-07-08 16:26:18,044 INFO L280 TraceCheckUtils]: 8: Hoare triple {16711#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {16711#true} is VALID [2020-07-08 16:26:18,044 INFO L280 TraceCheckUtils]: 9: Hoare triple {16711#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {16711#true} is VALID [2020-07-08 16:26:18,044 INFO L280 TraceCheckUtils]: 10: Hoare triple {16711#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {16711#true} is VALID [2020-07-08 16:26:18,044 INFO L280 TraceCheckUtils]: 11: Hoare triple {16711#true} goto; {16711#true} is VALID [2020-07-08 16:26:18,044 INFO L280 TraceCheckUtils]: 12: Hoare triple {16711#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {16711#true} is VALID [2020-07-08 16:26:18,045 INFO L280 TraceCheckUtils]: 13: Hoare triple {16711#true} assume 0 != #t~nondet1; {16711#true} is VALID [2020-07-08 16:26:18,045 INFO L280 TraceCheckUtils]: 14: Hoare triple {16711#true} havoc #t~nondet1; {16711#true} is VALID [2020-07-08 16:26:18,045 INFO L280 TraceCheckUtils]: 15: Hoare triple {16711#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {16711#true} is VALID [2020-07-08 16:26:18,046 INFO L280 TraceCheckUtils]: 16: Hoare triple {16711#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {16718#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-08 16:26:18,048 INFO L280 TraceCheckUtils]: 17: Hoare triple {16718#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {16719#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2020-07-08 16:26:18,049 INFO L280 TraceCheckUtils]: 18: Hoare triple {16719#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume !#t~short7; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,050 INFO L280 TraceCheckUtils]: 19: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,051 INFO L280 TraceCheckUtils]: 20: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,052 INFO L280 TraceCheckUtils]: 21: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!#t~short7; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,053 INFO L280 TraceCheckUtils]: 22: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,054 INFO L280 TraceCheckUtils]: 23: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,055 INFO L280 TraceCheckUtils]: 24: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~short7; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,055 INFO L280 TraceCheckUtils]: 25: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,056 INFO L280 TraceCheckUtils]: 26: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,058 INFO L280 TraceCheckUtils]: 27: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,059 INFO L280 TraceCheckUtils]: 28: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,060 INFO L280 TraceCheckUtils]: 29: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,061 INFO L280 TraceCheckUtils]: 30: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,062 INFO L280 TraceCheckUtils]: 31: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,064 INFO L280 TraceCheckUtils]: 32: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,065 INFO L280 TraceCheckUtils]: 33: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,066 INFO L280 TraceCheckUtils]: 34: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,067 INFO L280 TraceCheckUtils]: 35: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~len~0 := 0; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,068 INFO L280 TraceCheckUtils]: 36: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,069 INFO L280 TraceCheckUtils]: 37: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,069 INFO L280 TraceCheckUtils]: 38: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem18.base, #t~mem18.offset; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,070 INFO L280 TraceCheckUtils]: 39: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,071 INFO L280 TraceCheckUtils]: 40: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(~len~0 <= 1); {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,072 INFO L280 TraceCheckUtils]: 41: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,073 INFO L280 TraceCheckUtils]: 42: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,073 INFO L280 TraceCheckUtils]: 43: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,074 INFO L280 TraceCheckUtils]: 44: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem23.base, #t~mem23.offset; {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,075 INFO L280 TraceCheckUtils]: 45: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,076 INFO L280 TraceCheckUtils]: 46: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:18,077 INFO L280 TraceCheckUtils]: 47: Hoare triple {16720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L1039 {16721#(and (= 0 |main_#t~mem24.offset|) (= 0 |main_#t~mem24.base|))} is VALID [2020-07-08 16:26:18,078 INFO L280 TraceCheckUtils]: 48: Hoare triple {16721#(and (= 0 |main_#t~mem24.offset|) (= 0 |main_#t~mem24.base|))} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {16722#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-08 16:26:18,079 INFO L280 TraceCheckUtils]: 49: Hoare triple {16722#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} havoc #t~mem24.base, #t~mem24.offset; {16722#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-08 16:26:18,080 INFO L280 TraceCheckUtils]: 50: Hoare triple {16722#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} assume 0 != ~end~0.base || 0 != ~end~0.offset; {16712#false} is VALID [2020-07-08 16:26:18,080 INFO L280 TraceCheckUtils]: 51: Hoare triple {16712#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {16712#false} is VALID [2020-07-08 16:26:18,080 INFO L280 TraceCheckUtils]: 52: Hoare triple {16712#false} assume !false; {16712#false} is VALID [2020-07-08 16:26:18,090 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-08 16:26:18,090 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:26:18,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [241156768] [2020-07-08 16:26:18,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:26:18,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 16:26:18,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197910787] [2020-07-08 16:26:18,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-08 16:26:18,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:26:18,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 16:26:18,154 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-08 16:26:18,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 16:26:18,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:26:18,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 16:26:18,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 16:26:18,155 INFO L87 Difference]: Start difference. First operand 225 states and 243 transitions. Second operand 8 states. [2020-07-08 16:26:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:21,757 INFO L93 Difference]: Finished difference Result 321 states and 346 transitions. [2020-07-08 16:26:21,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 16:26:21,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-08 16:26:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:26:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 16:26:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 269 transitions. [2020-07-08 16:26:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 16:26:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 269 transitions. [2020-07-08 16:26:21,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 269 transitions. [2020-07-08 16:26:22,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:22,075 INFO L225 Difference]: With dead ends: 321 [2020-07-08 16:26:22,075 INFO L226 Difference]: Without dead ends: 291 [2020-07-08 16:26:22,076 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-08 16:26:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-07-08 16:26:24,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 275. [2020-07-08 16:26:24,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:26:24,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand 275 states. [2020-07-08 16:26:24,012 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 275 states. [2020-07-08 16:26:24,012 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 275 states. [2020-07-08 16:26:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:24,019 INFO L93 Difference]: Finished difference Result 291 states and 314 transitions. [2020-07-08 16:26:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 314 transitions. [2020-07-08 16:26:24,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:24,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:24,020 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 291 states. [2020-07-08 16:26:24,020 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 291 states. [2020-07-08 16:26:24,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:24,026 INFO L93 Difference]: Finished difference Result 291 states and 314 transitions. [2020-07-08 16:26:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 314 transitions. [2020-07-08 16:26:24,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:24,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:24,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:26:24,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:26:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2020-07-08 16:26:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2020-07-08 16:26:24,033 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 53 [2020-07-08 16:26:24,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:26:24,033 INFO L479 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2020-07-08 16:26:24,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 16:26:24,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 275 states and 301 transitions. [2020-07-08 16:26:25,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2020-07-08 16:26:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-08 16:26:25,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:26:25,052 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:26:25,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-08 16:26:25,052 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:26:25,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:26:25,053 INFO L82 PathProgramCache]: Analyzing trace with hash -604385608, now seen corresponding path program 1 times [2020-07-08 16:26:25,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:26:25,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1541044202] [2020-07-08 16:26:25,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:26:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:25,182 INFO L280 TraceCheckUtils]: 0: Hoare triple {18520#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {18508#true} is VALID [2020-07-08 16:26:25,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {18508#true} #valid := #valid[0 := 0]; {18508#true} is VALID [2020-07-08 16:26:25,183 INFO L280 TraceCheckUtils]: 2: Hoare triple {18508#true} assume 0 < #StackHeapBarrier; {18508#true} is VALID [2020-07-08 16:26:25,183 INFO L280 TraceCheckUtils]: 3: Hoare triple {18508#true} assume true; {18508#true} is VALID [2020-07-08 16:26:25,183 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {18508#true} {18508#true} #419#return; {18508#true} is VALID [2020-07-08 16:26:25,184 INFO L263 TraceCheckUtils]: 0: Hoare triple {18508#true} call ULTIMATE.init(); {18520#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:26:25,184 INFO L280 TraceCheckUtils]: 1: Hoare triple {18520#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {18508#true} is VALID [2020-07-08 16:26:25,185 INFO L280 TraceCheckUtils]: 2: Hoare triple {18508#true} #valid := #valid[0 := 0]; {18508#true} is VALID [2020-07-08 16:26:25,185 INFO L280 TraceCheckUtils]: 3: Hoare triple {18508#true} assume 0 < #StackHeapBarrier; {18508#true} is VALID [2020-07-08 16:26:25,185 INFO L280 TraceCheckUtils]: 4: Hoare triple {18508#true} assume true; {18508#true} is VALID [2020-07-08 16:26:25,185 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {18508#true} {18508#true} #419#return; {18508#true} is VALID [2020-07-08 16:26:25,185 INFO L263 TraceCheckUtils]: 6: Hoare triple {18508#true} call #t~ret28 := main(); {18508#true} is VALID [2020-07-08 16:26:25,186 INFO L280 TraceCheckUtils]: 7: Hoare triple {18508#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {18508#true} is VALID [2020-07-08 16:26:25,186 INFO L280 TraceCheckUtils]: 8: Hoare triple {18508#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {18508#true} is VALID [2020-07-08 16:26:25,186 INFO L280 TraceCheckUtils]: 9: Hoare triple {18508#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {18508#true} is VALID [2020-07-08 16:26:25,186 INFO L280 TraceCheckUtils]: 10: Hoare triple {18508#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {18508#true} is VALID [2020-07-08 16:26:25,186 INFO L280 TraceCheckUtils]: 11: Hoare triple {18508#true} goto; {18508#true} is VALID [2020-07-08 16:26:25,187 INFO L280 TraceCheckUtils]: 12: Hoare triple {18508#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {18508#true} is VALID [2020-07-08 16:26:25,187 INFO L280 TraceCheckUtils]: 13: Hoare triple {18508#true} assume 0 != #t~nondet1; {18508#true} is VALID [2020-07-08 16:26:25,187 INFO L280 TraceCheckUtils]: 14: Hoare triple {18508#true} havoc #t~nondet1; {18508#true} is VALID [2020-07-08 16:26:25,187 INFO L280 TraceCheckUtils]: 15: Hoare triple {18508#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {18508#true} is VALID [2020-07-08 16:26:25,187 INFO L280 TraceCheckUtils]: 16: Hoare triple {18508#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {18508#true} is VALID [2020-07-08 16:26:25,188 INFO L280 TraceCheckUtils]: 17: Hoare triple {18508#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {18508#true} is VALID [2020-07-08 16:26:25,188 INFO L280 TraceCheckUtils]: 18: Hoare triple {18508#true} assume !#t~short7; {18508#true} is VALID [2020-07-08 16:26:25,188 INFO L280 TraceCheckUtils]: 19: Hoare triple {18508#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {18508#true} is VALID [2020-07-08 16:26:25,188 INFO L280 TraceCheckUtils]: 20: Hoare triple {18508#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {18508#true} is VALID [2020-07-08 16:26:25,188 INFO L280 TraceCheckUtils]: 21: Hoare triple {18508#true} assume !!#t~short7; {18508#true} is VALID [2020-07-08 16:26:25,189 INFO L280 TraceCheckUtils]: 22: Hoare triple {18508#true} havoc #t~mem6.base, #t~mem6.offset; {18508#true} is VALID [2020-07-08 16:26:25,189 INFO L280 TraceCheckUtils]: 23: Hoare triple {18508#true} havoc #t~mem5.base, #t~mem5.offset; {18508#true} is VALID [2020-07-08 16:26:25,189 INFO L280 TraceCheckUtils]: 24: Hoare triple {18508#true} havoc #t~short7; {18508#true} is VALID [2020-07-08 16:26:25,189 INFO L280 TraceCheckUtils]: 25: Hoare triple {18508#true} goto; {18508#true} is VALID [2020-07-08 16:26:25,189 INFO L280 TraceCheckUtils]: 26: Hoare triple {18508#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {18508#true} is VALID [2020-07-08 16:26:25,189 INFO L280 TraceCheckUtils]: 27: Hoare triple {18508#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {18508#true} is VALID [2020-07-08 16:26:25,190 INFO L280 TraceCheckUtils]: 28: Hoare triple {18508#true} assume !!(0 != #t~nondet8); {18508#true} is VALID [2020-07-08 16:26:25,190 INFO L280 TraceCheckUtils]: 29: Hoare triple {18508#true} havoc #t~nondet8; {18508#true} is VALID [2020-07-08 16:26:25,190 INFO L280 TraceCheckUtils]: 30: Hoare triple {18508#true} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(8); srcloc: L1001 {18508#true} is VALID [2020-07-08 16:26:25,190 INFO L280 TraceCheckUtils]: 31: Hoare triple {18508#true} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1001-1 {18508#true} is VALID [2020-07-08 16:26:25,190 INFO L280 TraceCheckUtils]: 32: Hoare triple {18508#true} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1001-2 {18508#true} is VALID [2020-07-08 16:26:25,191 INFO L280 TraceCheckUtils]: 33: Hoare triple {18508#true} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {18508#true} is VALID [2020-07-08 16:26:25,191 INFO L280 TraceCheckUtils]: 34: Hoare triple {18508#true} havoc #t~mem10.base, #t~mem10.offset; {18508#true} is VALID [2020-07-08 16:26:25,191 INFO L280 TraceCheckUtils]: 35: Hoare triple {18508#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1003 {18508#true} is VALID [2020-07-08 16:26:25,191 INFO L280 TraceCheckUtils]: 36: Hoare triple {18508#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {18508#true} is VALID [2020-07-08 16:26:25,191 INFO L280 TraceCheckUtils]: 37: Hoare triple {18508#true} goto; {18508#true} is VALID [2020-07-08 16:26:25,192 INFO L280 TraceCheckUtils]: 38: Hoare triple {18508#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {18508#true} is VALID [2020-07-08 16:26:25,192 INFO L280 TraceCheckUtils]: 39: Hoare triple {18508#true} goto; {18508#true} is VALID [2020-07-08 16:26:25,192 INFO L280 TraceCheckUtils]: 40: Hoare triple {18508#true} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {18508#true} is VALID [2020-07-08 16:26:25,192 INFO L280 TraceCheckUtils]: 41: Hoare triple {18508#true} assume 0 != #t~nondet11; {18508#true} is VALID [2020-07-08 16:26:25,192 INFO L280 TraceCheckUtils]: 42: Hoare triple {18508#true} havoc #t~nondet11; {18508#true} is VALID [2020-07-08 16:26:25,193 INFO L280 TraceCheckUtils]: 43: Hoare triple {18508#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-7 {18508#true} is VALID [2020-07-08 16:26:25,193 INFO L280 TraceCheckUtils]: 44: Hoare triple {18508#true} SUMMARY for call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-34 {18515#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem15.base|))} is VALID [2020-07-08 16:26:25,194 INFO L280 TraceCheckUtils]: 45: Hoare triple {18515#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem15.base|))} #t~short17 := #t~mem15.base != 0 || #t~mem15.offset != 0; {18516#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) |main_#t~short17|)} is VALID [2020-07-08 16:26:25,195 INFO L280 TraceCheckUtils]: 46: Hoare triple {18516#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) |main_#t~short17|)} assume !#t~short17; {18517#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-08 16:26:25,196 INFO L280 TraceCheckUtils]: 47: Hoare triple {18517#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} SUMMARY for call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-22 {18518#(and (= 0 |main_#t~mem16.offset|) (= 0 |main_#t~mem16.base|))} is VALID [2020-07-08 16:26:25,197 INFO L280 TraceCheckUtils]: 48: Hoare triple {18518#(and (= 0 |main_#t~mem16.offset|) (= 0 |main_#t~mem16.base|))} #t~short17 := #t~mem16.base == 0 && #t~mem16.offset == 0; {18519#|main_#t~short17|} is VALID [2020-07-08 16:26:25,197 INFO L280 TraceCheckUtils]: 49: Hoare triple {18519#|main_#t~short17|} assume !#t~short17; {18509#false} is VALID [2020-07-08 16:26:25,197 INFO L280 TraceCheckUtils]: 50: Hoare triple {18509#false} havoc #t~mem16.base, #t~mem16.offset; {18509#false} is VALID [2020-07-08 16:26:25,198 INFO L280 TraceCheckUtils]: 51: Hoare triple {18509#false} havoc #t~mem15.base, #t~mem15.offset; {18509#false} is VALID [2020-07-08 16:26:25,198 INFO L280 TraceCheckUtils]: 52: Hoare triple {18509#false} havoc #t~short17; {18509#false} is VALID [2020-07-08 16:26:25,198 INFO L280 TraceCheckUtils]: 53: Hoare triple {18509#false} assume !false; {18509#false} is VALID [2020-07-08 16:26:25,200 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-08 16:26:25,201 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:26:25,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1541044202] [2020-07-08 16:26:25,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:26:25,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 16:26:25,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480851790] [2020-07-08 16:26:25,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-08 16:26:25,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:26:25,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 16:26:25,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:25,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 16:26:25,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:26:25,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 16:26:25,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-08 16:26:25,254 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand 8 states. [2020-07-08 16:26:28,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:28,396 INFO L93 Difference]: Finished difference Result 294 states and 322 transitions. [2020-07-08 16:26:28,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 16:26:28,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-08 16:26:28,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:26:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 16:26:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 182 transitions. [2020-07-08 16:26:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 16:26:28,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 182 transitions. [2020-07-08 16:26:28,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 182 transitions. [2020-07-08 16:26:28,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:28,605 INFO L225 Difference]: With dead ends: 294 [2020-07-08 16:26:28,605 INFO L226 Difference]: Without dead ends: 289 [2020-07-08 16:26:28,605 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-07-08 16:26:28,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-07-08 16:26:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 268. [2020-07-08 16:26:30,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:26:30,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand 268 states. [2020-07-08 16:26:30,550 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand 268 states. [2020-07-08 16:26:30,550 INFO L87 Difference]: Start difference. First operand 289 states. Second operand 268 states. [2020-07-08 16:26:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:30,556 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2020-07-08 16:26:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 316 transitions. [2020-07-08 16:26:30,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:30,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:30,557 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand 289 states. [2020-07-08 16:26:30,557 INFO L87 Difference]: Start difference. First operand 268 states. Second operand 289 states. [2020-07-08 16:26:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:30,564 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2020-07-08 16:26:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 316 transitions. [2020-07-08 16:26:30,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:30,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:30,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:26:30,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:26:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-07-08 16:26:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2020-07-08 16:26:30,570 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 54 [2020-07-08 16:26:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:26:30,571 INFO L479 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2020-07-08 16:26:30,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 16:26:30,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 268 states and 293 transitions. [2020-07-08 16:26:31,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2020-07-08 16:26:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-08 16:26:31,571 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:26:31,571 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:26:31,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-08 16:26:31,572 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:26:31,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:26:31,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1636675303, now seen corresponding path program 1 times [2020-07-08 16:26:31,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:26:31,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1474225397] [2020-07-08 16:26:31,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:26:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:32,059 INFO L280 TraceCheckUtils]: 0: Hoare triple {20259#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {20239#true} is VALID [2020-07-08 16:26:32,060 INFO L280 TraceCheckUtils]: 1: Hoare triple {20239#true} #valid := #valid[0 := 0]; {20239#true} is VALID [2020-07-08 16:26:32,060 INFO L280 TraceCheckUtils]: 2: Hoare triple {20239#true} assume 0 < #StackHeapBarrier; {20239#true} is VALID [2020-07-08 16:26:32,060 INFO L280 TraceCheckUtils]: 3: Hoare triple {20239#true} assume true; {20239#true} is VALID [2020-07-08 16:26:32,060 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {20239#true} {20239#true} #419#return; {20239#true} is VALID [2020-07-08 16:26:32,062 INFO L263 TraceCheckUtils]: 0: Hoare triple {20239#true} call ULTIMATE.init(); {20259#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:26:32,062 INFO L280 TraceCheckUtils]: 1: Hoare triple {20259#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {20239#true} is VALID [2020-07-08 16:26:32,062 INFO L280 TraceCheckUtils]: 2: Hoare triple {20239#true} #valid := #valid[0 := 0]; {20239#true} is VALID [2020-07-08 16:26:32,063 INFO L280 TraceCheckUtils]: 3: Hoare triple {20239#true} assume 0 < #StackHeapBarrier; {20239#true} is VALID [2020-07-08 16:26:32,063 INFO L280 TraceCheckUtils]: 4: Hoare triple {20239#true} assume true; {20239#true} is VALID [2020-07-08 16:26:32,063 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {20239#true} {20239#true} #419#return; {20239#true} is VALID [2020-07-08 16:26:32,063 INFO L263 TraceCheckUtils]: 6: Hoare triple {20239#true} call #t~ret28 := main(); {20239#true} is VALID [2020-07-08 16:26:32,065 INFO L280 TraceCheckUtils]: 7: Hoare triple {20239#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {20246#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-08 16:26:32,066 INFO L280 TraceCheckUtils]: 8: Hoare triple {20246#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {20247#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-08 16:26:32,066 INFO L280 TraceCheckUtils]: 9: Hoare triple {20247#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {20247#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-08 16:26:32,067 INFO L280 TraceCheckUtils]: 10: Hoare triple {20247#(= 1 (select |#valid| main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {20247#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-08 16:26:32,068 INFO L280 TraceCheckUtils]: 11: Hoare triple {20247#(= 1 (select |#valid| main_~list~0.base))} goto; {20247#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-08 16:26:32,068 INFO L280 TraceCheckUtils]: 12: Hoare triple {20247#(= 1 (select |#valid| main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {20247#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-08 16:26:32,069 INFO L280 TraceCheckUtils]: 13: Hoare triple {20247#(= 1 (select |#valid| main_~list~0.base))} assume !(0 != #t~nondet1); {20247#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-08 16:26:32,069 INFO L280 TraceCheckUtils]: 14: Hoare triple {20247#(= 1 (select |#valid| main_~list~0.base))} havoc #t~nondet1; {20247#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-08 16:26:32,070 INFO L280 TraceCheckUtils]: 15: Hoare triple {20247#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {20248#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} is VALID [2020-07-08 16:26:32,071 INFO L280 TraceCheckUtils]: 16: Hoare triple {20248#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {20249#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:26:32,073 INFO L280 TraceCheckUtils]: 17: Hoare triple {20249#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {20250#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (= 0 |main_#t~mem3.offset|) (not (= |main_#t~mem3.base| main_~list~0.base)))} is VALID [2020-07-08 16:26:32,074 INFO L280 TraceCheckUtils]: 18: Hoare triple {20250#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (= 0 |main_#t~mem3.offset|) (not (= |main_#t~mem3.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {20251#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,075 INFO L280 TraceCheckUtils]: 19: Hoare triple {20251#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem3.base, #t~mem3.offset; {20251#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,076 INFO L280 TraceCheckUtils]: 20: Hoare triple {20251#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {20252#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} is VALID [2020-07-08 16:26:32,078 INFO L280 TraceCheckUtils]: 21: Hoare triple {20252#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,079 INFO L280 TraceCheckUtils]: 22: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem4.base, #t~mem4.offset; {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,080 INFO L280 TraceCheckUtils]: 23: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,081 INFO L280 TraceCheckUtils]: 24: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,085 INFO L280 TraceCheckUtils]: 25: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume #t~short7; {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,086 INFO L280 TraceCheckUtils]: 26: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume !!#t~short7; {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,087 INFO L280 TraceCheckUtils]: 27: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem6.base, #t~mem6.offset; {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,089 INFO L280 TraceCheckUtils]: 28: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem5.base, #t~mem5.offset; {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,089 INFO L280 TraceCheckUtils]: 29: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~short7; {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,090 INFO L280 TraceCheckUtils]: 30: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} goto; {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,091 INFO L280 TraceCheckUtils]: 31: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,092 INFO L280 TraceCheckUtils]: 32: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,093 INFO L280 TraceCheckUtils]: 33: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume !(0 != #t~nondet8); {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,094 INFO L280 TraceCheckUtils]: 34: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~nondet8; {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,095 INFO L280 TraceCheckUtils]: 35: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} ~end~0.base, ~end~0.offset := 0, 0; {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,097 INFO L280 TraceCheckUtils]: 36: Hoare triple {20253#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {20254#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,098 INFO L280 TraceCheckUtils]: 37: Hoare triple {20254#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {20254#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,099 INFO L280 TraceCheckUtils]: 38: Hoare triple {20254#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} goto; {20254#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,100 INFO L280 TraceCheckUtils]: 39: Hoare triple {20254#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {20254#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,101 INFO L280 TraceCheckUtils]: 40: Hoare triple {20254#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} ~len~0 := 0; {20254#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-08 16:26:32,102 INFO L280 TraceCheckUtils]: 41: Hoare triple {20254#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {20255#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 0)) (= 0 |main_#t~mem18.offset|))} is VALID [2020-07-08 16:26:32,103 INFO L280 TraceCheckUtils]: 42: Hoare triple {20255#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 0)) (= 0 |main_#t~mem18.offset|))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {20256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-08 16:26:32,104 INFO L280 TraceCheckUtils]: 43: Hoare triple {20256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} havoc #t~mem18.base, #t~mem18.offset; {20256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-08 16:26:32,105 INFO L280 TraceCheckUtils]: 44: Hoare triple {20256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-08 16:26:32,106 INFO L280 TraceCheckUtils]: 45: Hoare triple {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume 0 == ~len~0; {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-08 16:26:32,107 INFO L280 TraceCheckUtils]: 46: Hoare triple {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} ~len~0 := 1; {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-08 16:26:32,108 INFO L280 TraceCheckUtils]: 47: Hoare triple {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-08 16:26:32,110 INFO L280 TraceCheckUtils]: 48: Hoare triple {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} goto; {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-08 16:26:32,111 INFO L280 TraceCheckUtils]: 49: Hoare triple {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-08 16:26:32,111 INFO L280 TraceCheckUtils]: 50: Hoare triple {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-08 16:26:32,112 INFO L280 TraceCheckUtils]: 51: Hoare triple {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} havoc #t~mem19.base, #t~mem19.offset; {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-08 16:26:32,113 INFO L280 TraceCheckUtils]: 52: Hoare triple {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} goto; {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-08 16:26:32,114 INFO L280 TraceCheckUtils]: 53: Hoare triple {20257#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); srcloc: L1026-6 {20258#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} is VALID [2020-07-08 16:26:32,114 INFO L280 TraceCheckUtils]: 54: Hoare triple {20258#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset); {20240#false} is VALID [2020-07-08 16:26:32,115 INFO L280 TraceCheckUtils]: 55: Hoare triple {20240#false} havoc #t~mem20.base, #t~mem20.offset; {20240#false} is VALID [2020-07-08 16:26:32,115 INFO L280 TraceCheckUtils]: 56: Hoare triple {20240#false} assume !false; {20240#false} is VALID [2020-07-08 16:26:32,136 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-08 16:26:32,136 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:26:32,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1474225397] [2020-07-08 16:26:32,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:26:32,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-08 16:26:32,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867347595] [2020-07-08 16:26:32,138 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2020-07-08 16:26:32,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:26:32,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-08 16:26:32,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:32,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-08 16:26:32,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:26:32,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-08 16:26:32,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-07-08 16:26:32,222 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand 16 states. [2020-07-08 16:26:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:43,978 INFO L93 Difference]: Finished difference Result 722 states and 782 transitions. [2020-07-08 16:26:43,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-08 16:26:43,979 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2020-07-08 16:26:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:26:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 16:26:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 543 transitions. [2020-07-08 16:26:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 16:26:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 543 transitions. [2020-07-08 16:26:43,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 543 transitions. [2020-07-08 16:26:44,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 543 edges. 543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:44,784 INFO L225 Difference]: With dead ends: 722 [2020-07-08 16:26:44,784 INFO L226 Difference]: Without dead ends: 719 [2020-07-08 16:26:44,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2020-07-08 16:26:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2020-07-08 16:26:46,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 272. [2020-07-08 16:26:46,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:26:46,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 719 states. Second operand 272 states. [2020-07-08 16:26:46,803 INFO L74 IsIncluded]: Start isIncluded. First operand 719 states. Second operand 272 states. [2020-07-08 16:26:46,803 INFO L87 Difference]: Start difference. First operand 719 states. Second operand 272 states. [2020-07-08 16:26:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:46,825 INFO L93 Difference]: Finished difference Result 719 states and 779 transitions. [2020-07-08 16:26:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 779 transitions. [2020-07-08 16:26:46,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:46,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:46,826 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand 719 states. [2020-07-08 16:26:46,826 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 719 states. [2020-07-08 16:26:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:46,853 INFO L93 Difference]: Finished difference Result 719 states and 779 transitions. [2020-07-08 16:26:46,853 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 779 transitions. [2020-07-08 16:26:46,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:46,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:46,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:26:46,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:26:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-07-08 16:26:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2020-07-08 16:26:46,859 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 57 [2020-07-08 16:26:46,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:26:46,859 INFO L479 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2020-07-08 16:26:46,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-08 16:26:46,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 272 states and 297 transitions. [2020-07-08 16:26:47,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2020-07-08 16:26:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-08 16:26:47,996 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:26:47,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:26:47,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-08 16:26:47,997 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:26:47,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:26:47,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1939208096, now seen corresponding path program 1 times [2020-07-08 16:26:47,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:26:47,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1857578504] [2020-07-08 16:26:47,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:26:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:48,086 INFO L280 TraceCheckUtils]: 0: Hoare triple {23734#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {23726#true} is VALID [2020-07-08 16:26:48,086 INFO L280 TraceCheckUtils]: 1: Hoare triple {23726#true} #valid := #valid[0 := 0]; {23726#true} is VALID [2020-07-08 16:26:48,087 INFO L280 TraceCheckUtils]: 2: Hoare triple {23726#true} assume 0 < #StackHeapBarrier; {23726#true} is VALID [2020-07-08 16:26:48,087 INFO L280 TraceCheckUtils]: 3: Hoare triple {23726#true} assume true; {23726#true} is VALID [2020-07-08 16:26:48,087 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {23726#true} {23726#true} #419#return; {23726#true} is VALID [2020-07-08 16:26:48,089 INFO L263 TraceCheckUtils]: 0: Hoare triple {23726#true} call ULTIMATE.init(); {23734#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:26:48,089 INFO L280 TraceCheckUtils]: 1: Hoare triple {23734#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {23726#true} is VALID [2020-07-08 16:26:48,089 INFO L280 TraceCheckUtils]: 2: Hoare triple {23726#true} #valid := #valid[0 := 0]; {23726#true} is VALID [2020-07-08 16:26:48,090 INFO L280 TraceCheckUtils]: 3: Hoare triple {23726#true} assume 0 < #StackHeapBarrier; {23726#true} is VALID [2020-07-08 16:26:48,090 INFO L280 TraceCheckUtils]: 4: Hoare triple {23726#true} assume true; {23726#true} is VALID [2020-07-08 16:26:48,090 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {23726#true} {23726#true} #419#return; {23726#true} is VALID [2020-07-08 16:26:48,093 INFO L263 TraceCheckUtils]: 6: Hoare triple {23726#true} call #t~ret28 := main(); {23726#true} is VALID [2020-07-08 16:26:48,094 INFO L280 TraceCheckUtils]: 7: Hoare triple {23726#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {23726#true} is VALID [2020-07-08 16:26:48,094 INFO L280 TraceCheckUtils]: 8: Hoare triple {23726#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {23726#true} is VALID [2020-07-08 16:26:48,094 INFO L280 TraceCheckUtils]: 9: Hoare triple {23726#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {23726#true} is VALID [2020-07-08 16:26:48,094 INFO L280 TraceCheckUtils]: 10: Hoare triple {23726#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {23726#true} is VALID [2020-07-08 16:26:48,094 INFO L280 TraceCheckUtils]: 11: Hoare triple {23726#true} goto; {23726#true} is VALID [2020-07-08 16:26:48,095 INFO L280 TraceCheckUtils]: 12: Hoare triple {23726#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {23726#true} is VALID [2020-07-08 16:26:48,095 INFO L280 TraceCheckUtils]: 13: Hoare triple {23726#true} assume !(0 != #t~nondet1); {23726#true} is VALID [2020-07-08 16:26:48,095 INFO L280 TraceCheckUtils]: 14: Hoare triple {23726#true} havoc #t~nondet1; {23726#true} is VALID [2020-07-08 16:26:48,095 INFO L280 TraceCheckUtils]: 15: Hoare triple {23726#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {23726#true} is VALID [2020-07-08 16:26:48,095 INFO L280 TraceCheckUtils]: 16: Hoare triple {23726#true} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {23726#true} is VALID [2020-07-08 16:26:48,096 INFO L280 TraceCheckUtils]: 17: Hoare triple {23726#true} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {23726#true} is VALID [2020-07-08 16:26:48,096 INFO L280 TraceCheckUtils]: 18: Hoare triple {23726#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {23726#true} is VALID [2020-07-08 16:26:48,096 INFO L280 TraceCheckUtils]: 19: Hoare triple {23726#true} havoc #t~mem3.base, #t~mem3.offset; {23726#true} is VALID [2020-07-08 16:26:48,096 INFO L280 TraceCheckUtils]: 20: Hoare triple {23726#true} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {23726#true} is VALID [2020-07-08 16:26:48,096 INFO L280 TraceCheckUtils]: 21: Hoare triple {23726#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {23726#true} is VALID [2020-07-08 16:26:48,096 INFO L280 TraceCheckUtils]: 22: Hoare triple {23726#true} havoc #t~mem4.base, #t~mem4.offset; {23726#true} is VALID [2020-07-08 16:26:48,097 INFO L280 TraceCheckUtils]: 23: Hoare triple {23726#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {23726#true} is VALID [2020-07-08 16:26:48,097 INFO L280 TraceCheckUtils]: 24: Hoare triple {23726#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {23726#true} is VALID [2020-07-08 16:26:48,097 INFO L280 TraceCheckUtils]: 25: Hoare triple {23726#true} assume #t~short7; {23726#true} is VALID [2020-07-08 16:26:48,097 INFO L280 TraceCheckUtils]: 26: Hoare triple {23726#true} assume !!#t~short7; {23726#true} is VALID [2020-07-08 16:26:48,097 INFO L280 TraceCheckUtils]: 27: Hoare triple {23726#true} havoc #t~mem6.base, #t~mem6.offset; {23726#true} is VALID [2020-07-08 16:26:48,098 INFO L280 TraceCheckUtils]: 28: Hoare triple {23726#true} havoc #t~mem5.base, #t~mem5.offset; {23726#true} is VALID [2020-07-08 16:26:48,098 INFO L280 TraceCheckUtils]: 29: Hoare triple {23726#true} havoc #t~short7; {23726#true} is VALID [2020-07-08 16:26:48,098 INFO L280 TraceCheckUtils]: 30: Hoare triple {23726#true} goto; {23726#true} is VALID [2020-07-08 16:26:48,098 INFO L280 TraceCheckUtils]: 31: Hoare triple {23726#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {23726#true} is VALID [2020-07-08 16:26:48,098 INFO L280 TraceCheckUtils]: 32: Hoare triple {23726#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {23726#true} is VALID [2020-07-08 16:26:48,099 INFO L280 TraceCheckUtils]: 33: Hoare triple {23726#true} assume !(0 != #t~nondet8); {23726#true} is VALID [2020-07-08 16:26:48,099 INFO L280 TraceCheckUtils]: 34: Hoare triple {23726#true} havoc #t~nondet8; {23726#true} is VALID [2020-07-08 16:26:48,099 INFO L280 TraceCheckUtils]: 35: Hoare triple {23726#true} ~end~0.base, ~end~0.offset := 0, 0; {23726#true} is VALID [2020-07-08 16:26:48,099 INFO L280 TraceCheckUtils]: 36: Hoare triple {23726#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {23726#true} is VALID [2020-07-08 16:26:48,099 INFO L280 TraceCheckUtils]: 37: Hoare triple {23726#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {23726#true} is VALID [2020-07-08 16:26:48,100 INFO L280 TraceCheckUtils]: 38: Hoare triple {23726#true} goto; {23726#true} is VALID [2020-07-08 16:26:48,100 INFO L280 TraceCheckUtils]: 39: Hoare triple {23726#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {23726#true} is VALID [2020-07-08 16:26:48,100 INFO L280 TraceCheckUtils]: 40: Hoare triple {23726#true} ~len~0 := 0; {23726#true} is VALID [2020-07-08 16:26:48,100 INFO L280 TraceCheckUtils]: 41: Hoare triple {23726#true} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {23726#true} is VALID [2020-07-08 16:26:48,100 INFO L280 TraceCheckUtils]: 42: Hoare triple {23726#true} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {23726#true} is VALID [2020-07-08 16:26:48,101 INFO L280 TraceCheckUtils]: 43: Hoare triple {23726#true} havoc #t~mem18.base, #t~mem18.offset; {23726#true} is VALID [2020-07-08 16:26:48,101 INFO L280 TraceCheckUtils]: 44: Hoare triple {23726#true} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {23726#true} is VALID [2020-07-08 16:26:48,101 INFO L280 TraceCheckUtils]: 45: Hoare triple {23726#true} assume !!(~len~0 <= 1); {23726#true} is VALID [2020-07-08 16:26:48,101 INFO L280 TraceCheckUtils]: 46: Hoare triple {23726#true} goto; {23726#true} is VALID [2020-07-08 16:26:48,101 INFO L280 TraceCheckUtils]: 47: Hoare triple {23726#true} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {23726#true} is VALID [2020-07-08 16:26:48,101 INFO L280 TraceCheckUtils]: 48: Hoare triple {23726#true} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {23726#true} is VALID [2020-07-08 16:26:48,102 INFO L280 TraceCheckUtils]: 49: Hoare triple {23726#true} havoc #t~mem23.base, #t~mem23.offset; {23726#true} is VALID [2020-07-08 16:26:48,102 INFO L280 TraceCheckUtils]: 50: Hoare triple {23726#true} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {23726#true} is VALID [2020-07-08 16:26:48,102 INFO L280 TraceCheckUtils]: 51: Hoare triple {23726#true} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {23726#true} is VALID [2020-07-08 16:26:48,102 INFO L280 TraceCheckUtils]: 52: Hoare triple {23726#true} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L1039 {23726#true} is VALID [2020-07-08 16:26:48,102 INFO L280 TraceCheckUtils]: 53: Hoare triple {23726#true} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {23726#true} is VALID [2020-07-08 16:26:48,103 INFO L280 TraceCheckUtils]: 54: Hoare triple {23726#true} havoc #t~mem24.base, #t~mem24.offset; {23726#true} is VALID [2020-07-08 16:26:48,103 INFO L280 TraceCheckUtils]: 55: Hoare triple {23726#true} assume 0 != ~end~0.base || 0 != ~end~0.offset; {23733#(or (not (= 0 main_~end~0.base)) (not (= 0 main_~end~0.offset)))} is VALID [2020-07-08 16:26:48,104 INFO L280 TraceCheckUtils]: 56: Hoare triple {23733#(or (not (= 0 main_~end~0.base)) (not (= 0 main_~end~0.offset)))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {23727#false} is VALID [2020-07-08 16:26:48,104 INFO L280 TraceCheckUtils]: 57: Hoare triple {23727#false} assume !false; {23727#false} is VALID [2020-07-08 16:26:48,106 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-08 16:26:48,107 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:26:48,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1857578504] [2020-07-08 16:26:48,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:26:48,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 16:26:48,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303844088] [2020-07-08 16:26:48,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-07-08 16:26:48,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:26:48,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 16:26:48,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:48,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 16:26:48,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:26:48,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 16:26:48,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 16:26:48,162 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand 4 states. [2020-07-08 16:26:50,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:50,736 INFO L93 Difference]: Finished difference Result 277 states and 302 transitions. [2020-07-08 16:26:50,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 16:26:50,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-07-08 16:26:50,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:26:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:26:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-08 16:26:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:26:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-08 16:26:50,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2020-07-08 16:26:50,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:50,937 INFO L225 Difference]: With dead ends: 277 [2020-07-08 16:26:50,937 INFO L226 Difference]: Without dead ends: 275 [2020-07-08 16:26:50,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 16:26:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-07-08 16:26:53,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 270. [2020-07-08 16:26:53,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:26:53,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand 270 states. [2020-07-08 16:26:53,104 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 270 states. [2020-07-08 16:26:53,104 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 270 states. [2020-07-08 16:26:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:53,109 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2020-07-08 16:26:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 300 transitions. [2020-07-08 16:26:53,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:53,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:53,110 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand 275 states. [2020-07-08 16:26:53,110 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 275 states. [2020-07-08 16:26:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:53,116 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2020-07-08 16:26:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 300 transitions. [2020-07-08 16:26:53,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:53,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:53,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:26:53,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:26:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-07-08 16:26:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2020-07-08 16:26:53,122 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 58 [2020-07-08 16:26:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:26:53,123 INFO L479 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2020-07-08 16:26:53,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 16:26:53,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 270 states and 295 transitions. [2020-07-08 16:26:54,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2020-07-08 16:26:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-08 16:26:54,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:26:54,241 INFO L422 BasicCegarLoop]: trace histogram [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, 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-08 16:26:54,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-08 16:26:54,242 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:26:54,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:26:54,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1792411396, now seen corresponding path program 1 times [2020-07-08 16:26:54,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:26:54,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1196168704] [2020-07-08 16:26:54,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:26:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:54,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {25392#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {25381#true} is VALID [2020-07-08 16:26:54,383 INFO L280 TraceCheckUtils]: 1: Hoare triple {25381#true} #valid := #valid[0 := 0]; {25381#true} is VALID [2020-07-08 16:26:54,384 INFO L280 TraceCheckUtils]: 2: Hoare triple {25381#true} assume 0 < #StackHeapBarrier; {25381#true} is VALID [2020-07-08 16:26:54,384 INFO L280 TraceCheckUtils]: 3: Hoare triple {25381#true} assume true; {25381#true} is VALID [2020-07-08 16:26:54,384 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {25381#true} {25381#true} #419#return; {25381#true} is VALID [2020-07-08 16:26:54,385 INFO L263 TraceCheckUtils]: 0: Hoare triple {25381#true} call ULTIMATE.init(); {25392#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:26:54,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {25392#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {25381#true} is VALID [2020-07-08 16:26:54,385 INFO L280 TraceCheckUtils]: 2: Hoare triple {25381#true} #valid := #valid[0 := 0]; {25381#true} is VALID [2020-07-08 16:26:54,385 INFO L280 TraceCheckUtils]: 3: Hoare triple {25381#true} assume 0 < #StackHeapBarrier; {25381#true} is VALID [2020-07-08 16:26:54,386 INFO L280 TraceCheckUtils]: 4: Hoare triple {25381#true} assume true; {25381#true} is VALID [2020-07-08 16:26:54,386 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {25381#true} {25381#true} #419#return; {25381#true} is VALID [2020-07-08 16:26:54,386 INFO L263 TraceCheckUtils]: 6: Hoare triple {25381#true} call #t~ret28 := main(); {25381#true} is VALID [2020-07-08 16:26:54,386 INFO L280 TraceCheckUtils]: 7: Hoare triple {25381#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {25381#true} is VALID [2020-07-08 16:26:54,386 INFO L280 TraceCheckUtils]: 8: Hoare triple {25381#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {25381#true} is VALID [2020-07-08 16:26:54,387 INFO L280 TraceCheckUtils]: 9: Hoare triple {25381#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,388 INFO L280 TraceCheckUtils]: 10: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,389 INFO L280 TraceCheckUtils]: 11: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} goto; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,390 INFO L280 TraceCheckUtils]: 12: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,390 INFO L280 TraceCheckUtils]: 13: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume 0 != #t~nondet1; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,391 INFO L280 TraceCheckUtils]: 14: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~nondet1; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,393 INFO L280 TraceCheckUtils]: 15: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,397 INFO L280 TraceCheckUtils]: 16: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,398 INFO L280 TraceCheckUtils]: 17: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,398 INFO L280 TraceCheckUtils]: 18: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !#t~short7; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,399 INFO L280 TraceCheckUtils]: 19: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,400 INFO L280 TraceCheckUtils]: 20: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,401 INFO L280 TraceCheckUtils]: 21: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !!#t~short7; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,402 INFO L280 TraceCheckUtils]: 22: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~mem6.base, #t~mem6.offset; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,403 INFO L280 TraceCheckUtils]: 23: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~mem5.base, #t~mem5.offset; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,403 INFO L280 TraceCheckUtils]: 24: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~short7; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,404 INFO L280 TraceCheckUtils]: 25: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} goto; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,405 INFO L280 TraceCheckUtils]: 26: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,406 INFO L280 TraceCheckUtils]: 27: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,406 INFO L280 TraceCheckUtils]: 28: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !(0 != #t~nondet8); {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,407 INFO L280 TraceCheckUtils]: 29: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~nondet8; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,408 INFO L280 TraceCheckUtils]: 30: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := 0, 0; {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-08 16:26:54,409 INFO L280 TraceCheckUtils]: 31: Hoare triple {25388#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 16:26:54,409 INFO L280 TraceCheckUtils]: 32: Hoare triple {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 16:26:54,410 INFO L280 TraceCheckUtils]: 33: Hoare triple {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} goto; {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 16:26:54,413 INFO L280 TraceCheckUtils]: 34: Hoare triple {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 16:26:54,413 INFO L280 TraceCheckUtils]: 35: Hoare triple {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} ~len~0 := 0; {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 16:26:54,414 INFO L280 TraceCheckUtils]: 36: Hoare triple {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 16:26:54,415 INFO L280 TraceCheckUtils]: 37: Hoare triple {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 16:26:54,416 INFO L280 TraceCheckUtils]: 38: Hoare triple {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} havoc #t~mem18.base, #t~mem18.offset; {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 16:26:54,418 INFO L280 TraceCheckUtils]: 39: Hoare triple {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 16:26:54,419 INFO L280 TraceCheckUtils]: 40: Hoare triple {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(~len~0 <= 1); {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 16:26:54,420 INFO L280 TraceCheckUtils]: 41: Hoare triple {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} goto; {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-08 16:26:54,421 INFO L280 TraceCheckUtils]: 42: Hoare triple {25389#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {25390#(and (= 0 |main_#t~mem23.base|) (= |main_#t~mem23.offset| 0))} is VALID [2020-07-08 16:26:54,421 INFO L280 TraceCheckUtils]: 43: Hoare triple {25390#(and (= 0 |main_#t~mem23.base|) (= |main_#t~mem23.offset| 0))} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {25391#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-08 16:26:54,422 INFO L280 TraceCheckUtils]: 44: Hoare triple {25391#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} havoc #t~mem23.base, #t~mem23.offset; {25391#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-08 16:26:54,423 INFO L280 TraceCheckUtils]: 45: Hoare triple {25391#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {25382#false} is VALID [2020-07-08 16:26:54,423 INFO L280 TraceCheckUtils]: 46: Hoare triple {25382#false} ~len~0 := 0; {25382#false} is VALID [2020-07-08 16:26:54,423 INFO L280 TraceCheckUtils]: 47: Hoare triple {25382#false} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {25382#false} is VALID [2020-07-08 16:26:54,423 INFO L280 TraceCheckUtils]: 48: Hoare triple {25382#false} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {25382#false} is VALID [2020-07-08 16:26:54,424 INFO L280 TraceCheckUtils]: 49: Hoare triple {25382#false} havoc #t~mem18.base, #t~mem18.offset; {25382#false} is VALID [2020-07-08 16:26:54,424 INFO L280 TraceCheckUtils]: 50: Hoare triple {25382#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {25382#false} is VALID [2020-07-08 16:26:54,424 INFO L280 TraceCheckUtils]: 51: Hoare triple {25382#false} assume 0 == ~len~0; {25382#false} is VALID [2020-07-08 16:26:54,424 INFO L280 TraceCheckUtils]: 52: Hoare triple {25382#false} ~len~0 := 1; {25382#false} is VALID [2020-07-08 16:26:54,424 INFO L280 TraceCheckUtils]: 53: Hoare triple {25382#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {25382#false} is VALID [2020-07-08 16:26:54,425 INFO L280 TraceCheckUtils]: 54: Hoare triple {25382#false} goto; {25382#false} is VALID [2020-07-08 16:26:54,425 INFO L280 TraceCheckUtils]: 55: Hoare triple {25382#false} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {25382#false} is VALID [2020-07-08 16:26:54,425 INFO L280 TraceCheckUtils]: 56: Hoare triple {25382#false} assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); {25382#false} is VALID [2020-07-08 16:26:54,425 INFO L280 TraceCheckUtils]: 57: Hoare triple {25382#false} havoc #t~mem19.base, #t~mem19.offset; {25382#false} is VALID [2020-07-08 16:26:54,425 INFO L280 TraceCheckUtils]: 58: Hoare triple {25382#false} assume !false; {25382#false} is VALID [2020-07-08 16:26:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 16:26:54,438 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:26:54,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1196168704] [2020-07-08 16:26:54,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:26:54,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 16:26:54,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114740929] [2020-07-08 16:26:54,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-07-08 16:26:54,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:26:54,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 16:26:54,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:54,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 16:26:54,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:26:54,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 16:26:54,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 16:26:54,506 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand 7 states. [2020-07-08 16:26:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:58,589 INFO L93 Difference]: Finished difference Result 421 states and 458 transitions. [2020-07-08 16:26:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 16:26:58,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-07-08 16:26:58,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:26:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 16:26:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2020-07-08 16:26:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 16:26:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2020-07-08 16:26:58,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 313 transitions. [2020-07-08 16:26:58,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:58,968 INFO L225 Difference]: With dead ends: 421 [2020-07-08 16:26:58,969 INFO L226 Difference]: Without dead ends: 312 [2020-07-08 16:26:58,969 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-08 16:26:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-07-08 16:27:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 270. [2020-07-08 16:27:01,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:27:01,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand 270 states. [2020-07-08 16:27:01,210 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand 270 states. [2020-07-08 16:27:01,210 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 270 states. [2020-07-08 16:27:01,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:27:01,217 INFO L93 Difference]: Finished difference Result 312 states and 333 transitions. [2020-07-08 16:27:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 333 transitions. [2020-07-08 16:27:01,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:27:01,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:27:01,217 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand 312 states. [2020-07-08 16:27:01,217 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 312 states. [2020-07-08 16:27:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:27:01,224 INFO L93 Difference]: Finished difference Result 312 states and 333 transitions. [2020-07-08 16:27:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 333 transitions. [2020-07-08 16:27:01,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:27:01,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:27:01,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:27:01,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:27:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-07-08 16:27:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 293 transitions. [2020-07-08 16:27:01,231 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 293 transitions. Word has length 59 [2020-07-08 16:27:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:27:01,232 INFO L479 AbstractCegarLoop]: Abstraction has 270 states and 293 transitions. [2020-07-08 16:27:01,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 16:27:01,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 270 states and 293 transitions. [2020-07-08 16:27:02,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:27:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 293 transitions. [2020-07-08 16:27:02,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-08 16:27:02,471 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:27:02,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:27:02,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-08 16:27:02,471 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:27:02,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:27:02,471 INFO L82 PathProgramCache]: Analyzing trace with hash -984681049, now seen corresponding path program 1 times [2020-07-08 16:27:02,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:27:02,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [65931542] [2020-07-08 16:27:02,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:27:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:27:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:27:02,911 INFO L280 TraceCheckUtils]: 0: Hoare triple {27429#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {27409#true} is VALID [2020-07-08 16:27:02,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {27409#true} #valid := #valid[0 := 0]; {27409#true} is VALID [2020-07-08 16:27:02,912 INFO L280 TraceCheckUtils]: 2: Hoare triple {27409#true} assume 0 < #StackHeapBarrier; {27409#true} is VALID [2020-07-08 16:27:02,912 INFO L280 TraceCheckUtils]: 3: Hoare triple {27409#true} assume true; {27409#true} is VALID [2020-07-08 16:27:02,912 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {27409#true} {27409#true} #419#return; {27409#true} is VALID [2020-07-08 16:27:02,913 INFO L263 TraceCheckUtils]: 0: Hoare triple {27409#true} call ULTIMATE.init(); {27429#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:27:02,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {27429#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {27409#true} is VALID [2020-07-08 16:27:02,913 INFO L280 TraceCheckUtils]: 2: Hoare triple {27409#true} #valid := #valid[0 := 0]; {27409#true} is VALID [2020-07-08 16:27:02,913 INFO L280 TraceCheckUtils]: 3: Hoare triple {27409#true} assume 0 < #StackHeapBarrier; {27409#true} is VALID [2020-07-08 16:27:02,914 INFO L280 TraceCheckUtils]: 4: Hoare triple {27409#true} assume true; {27409#true} is VALID [2020-07-08 16:27:02,914 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {27409#true} {27409#true} #419#return; {27409#true} is VALID [2020-07-08 16:27:02,914 INFO L263 TraceCheckUtils]: 6: Hoare triple {27409#true} call #t~ret28 := main(); {27409#true} is VALID [2020-07-08 16:27:02,915 INFO L280 TraceCheckUtils]: 7: Hoare triple {27409#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {27416#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-08 16:27:02,916 INFO L280 TraceCheckUtils]: 8: Hoare triple {27416#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {27417#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-08 16:27:02,916 INFO L280 TraceCheckUtils]: 9: Hoare triple {27417#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {27417#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-08 16:27:02,917 INFO L280 TraceCheckUtils]: 10: Hoare triple {27417#(= 1 (select |#valid| main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {27417#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-08 16:27:02,917 INFO L280 TraceCheckUtils]: 11: Hoare triple {27417#(= 1 (select |#valid| main_~list~0.base))} goto; {27417#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-08 16:27:02,918 INFO L280 TraceCheckUtils]: 12: Hoare triple {27417#(= 1 (select |#valid| main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {27417#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-08 16:27:02,918 INFO L280 TraceCheckUtils]: 13: Hoare triple {27417#(= 1 (select |#valid| main_~list~0.base))} assume !(0 != #t~nondet1); {27417#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-08 16:27:02,919 INFO L280 TraceCheckUtils]: 14: Hoare triple {27417#(= 1 (select |#valid| main_~list~0.base))} havoc #t~nondet1; {27417#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-08 16:27:02,920 INFO L280 TraceCheckUtils]: 15: Hoare triple {27417#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {27418#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} is VALID [2020-07-08 16:27:02,921 INFO L280 TraceCheckUtils]: 16: Hoare triple {27418#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {27419#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:27:02,921 INFO L280 TraceCheckUtils]: 17: Hoare triple {27419#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {27420#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} is VALID [2020-07-08 16:27:02,923 INFO L280 TraceCheckUtils]: 18: Hoare triple {27420#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {27419#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:27:02,923 INFO L280 TraceCheckUtils]: 19: Hoare triple {27419#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem3.base, #t~mem3.offset; {27419#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:27:02,924 INFO L280 TraceCheckUtils]: 20: Hoare triple {27419#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {27421#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)))} is VALID [2020-07-08 16:27:02,925 INFO L280 TraceCheckUtils]: 21: Hoare triple {27421#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {27422#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-08 16:27:02,926 INFO L280 TraceCheckUtils]: 22: Hoare triple {27422#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} havoc #t~mem4.base, #t~mem4.offset; {27422#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-08 16:27:02,927 INFO L280 TraceCheckUtils]: 23: Hoare triple {27422#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {27423#(and (= 0 |main_#t~mem5.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-08 16:27:02,927 INFO L280 TraceCheckUtils]: 24: Hoare triple {27423#(and (= 0 |main_#t~mem5.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {27424#(or (not |main_#t~short7|) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2020-07-08 16:27:02,928 INFO L280 TraceCheckUtils]: 25: Hoare triple {27424#(or (not |main_#t~short7|) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume #t~short7; {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:27:02,929 INFO L280 TraceCheckUtils]: 26: Hoare triple {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!#t~short7; {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:27:02,929 INFO L280 TraceCheckUtils]: 27: Hoare triple {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:27:02,930 INFO L280 TraceCheckUtils]: 28: Hoare triple {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:27:02,930 INFO L280 TraceCheckUtils]: 29: Hoare triple {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~short7; {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:27:02,931 INFO L280 TraceCheckUtils]: 30: Hoare triple {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:27:02,931 INFO L280 TraceCheckUtils]: 31: Hoare triple {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:27:02,932 INFO L280 TraceCheckUtils]: 32: Hoare triple {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:27:02,932 INFO L280 TraceCheckUtils]: 33: Hoare triple {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:27:02,933 INFO L280 TraceCheckUtils]: 34: Hoare triple {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:27:02,933 INFO L280 TraceCheckUtils]: 35: Hoare triple {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-08 16:27:02,934 INFO L280 TraceCheckUtils]: 36: Hoare triple {27425#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {27426#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} is VALID [2020-07-08 16:27:02,935 INFO L280 TraceCheckUtils]: 37: Hoare triple {27426#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {27426#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} is VALID [2020-07-08 16:27:02,936 INFO L280 TraceCheckUtils]: 38: Hoare triple {27426#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} goto; {27426#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} is VALID [2020-07-08 16:27:02,936 INFO L280 TraceCheckUtils]: 39: Hoare triple {27426#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {27426#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} is VALID [2020-07-08 16:27:02,937 INFO L280 TraceCheckUtils]: 40: Hoare triple {27426#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} ~len~0 := 0; {27426#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} is VALID [2020-07-08 16:27:02,938 INFO L280 TraceCheckUtils]: 41: Hoare triple {27426#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {27427#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 |main_#t~mem18.base|)) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} is VALID [2020-07-08 16:27:02,938 INFO L280 TraceCheckUtils]: 42: Hoare triple {27427#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 |main_#t~mem18.base|)) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {27428#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 main_~inner~0.base)) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} is VALID [2020-07-08 16:27:02,939 INFO L280 TraceCheckUtils]: 43: Hoare triple {27428#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 main_~inner~0.base)) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} havoc #t~mem18.base, #t~mem18.offset; {27428#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 main_~inner~0.base)) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} is VALID [2020-07-08 16:27:02,940 INFO L280 TraceCheckUtils]: 44: Hoare triple {27428#(and (= main_~list~0.offset main_~end~0.offset) (not (= 0 main_~inner~0.base)) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {27410#false} is VALID [2020-07-08 16:27:02,940 INFO L280 TraceCheckUtils]: 45: Hoare triple {27410#false} assume !!(~len~0 <= 1); {27410#false} is VALID [2020-07-08 16:27:02,940 INFO L280 TraceCheckUtils]: 46: Hoare triple {27410#false} goto; {27410#false} is VALID [2020-07-08 16:27:02,940 INFO L280 TraceCheckUtils]: 47: Hoare triple {27410#false} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {27410#false} is VALID [2020-07-08 16:27:02,940 INFO L280 TraceCheckUtils]: 48: Hoare triple {27410#false} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {27410#false} is VALID [2020-07-08 16:27:02,941 INFO L280 TraceCheckUtils]: 49: Hoare triple {27410#false} havoc #t~mem23.base, #t~mem23.offset; {27410#false} is VALID [2020-07-08 16:27:02,941 INFO L280 TraceCheckUtils]: 50: Hoare triple {27410#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {27410#false} is VALID [2020-07-08 16:27:02,941 INFO L280 TraceCheckUtils]: 51: Hoare triple {27410#false} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {27410#false} is VALID [2020-07-08 16:27:02,941 INFO L280 TraceCheckUtils]: 52: Hoare triple {27410#false} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L1039 {27410#false} is VALID [2020-07-08 16:27:02,941 INFO L280 TraceCheckUtils]: 53: Hoare triple {27410#false} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {27410#false} is VALID [2020-07-08 16:27:02,942 INFO L280 TraceCheckUtils]: 54: Hoare triple {27410#false} havoc #t~mem24.base, #t~mem24.offset; {27410#false} is VALID [2020-07-08 16:27:02,942 INFO L280 TraceCheckUtils]: 55: Hoare triple {27410#false} assume 0 != ~end~0.base || 0 != ~end~0.offset; {27410#false} is VALID [2020-07-08 16:27:02,942 INFO L280 TraceCheckUtils]: 56: Hoare triple {27410#false} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {27410#false} is VALID [2020-07-08 16:27:02,942 INFO L280 TraceCheckUtils]: 57: Hoare triple {27410#false} goto; {27410#false} is VALID [2020-07-08 16:27:02,942 INFO L280 TraceCheckUtils]: 58: Hoare triple {27410#false} SUMMARY for call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1044-6 {27410#false} is VALID [2020-07-08 16:27:02,942 INFO L280 TraceCheckUtils]: 59: Hoare triple {27410#false} assume !(0 == #t~mem25.base && 0 == #t~mem25.offset); {27410#false} is VALID [2020-07-08 16:27:02,943 INFO L280 TraceCheckUtils]: 60: Hoare triple {27410#false} havoc #t~mem25.base, #t~mem25.offset; {27410#false} is VALID [2020-07-08 16:27:02,943 INFO L280 TraceCheckUtils]: 61: Hoare triple {27410#false} assume !false; {27410#false} is VALID [2020-07-08 16:27:02,952 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-08 16:27:02,952 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:27:02,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [65931542] [2020-07-08 16:27:02,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:27:02,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-08 16:27:02,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895452310] [2020-07-08 16:27:02,953 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2020-07-08 16:27:02,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:27:02,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-08 16:27:03,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:27:03,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-08 16:27:03,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:27:03,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-08 16:27:03,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-07-08 16:27:03,018 INFO L87 Difference]: Start difference. First operand 270 states and 293 transitions. Second operand 16 states. [2020-07-08 16:27:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:27:14,491 INFO L93 Difference]: Finished difference Result 682 states and 727 transitions. [2020-07-08 16:27:14,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-08 16:27:14,491 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2020-07-08 16:27:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:27:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 16:27:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 636 transitions. [2020-07-08 16:27:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 16:27:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 636 transitions. [2020-07-08 16:27:14,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 636 transitions. [2020-07-08 16:27:15,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 636 edges. 636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:27:15,456 INFO L225 Difference]: With dead ends: 682 [2020-07-08 16:27:15,456 INFO L226 Difference]: Without dead ends: 648 [2020-07-08 16:27:15,457 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2020-07-08 16:27:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-07-08 16:27:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 269. [2020-07-08 16:27:17,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:27:17,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 648 states. Second operand 269 states. [2020-07-08 16:27:17,803 INFO L74 IsIncluded]: Start isIncluded. First operand 648 states. Second operand 269 states. [2020-07-08 16:27:17,803 INFO L87 Difference]: Start difference. First operand 648 states. Second operand 269 states. [2020-07-08 16:27:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:27:17,821 INFO L93 Difference]: Finished difference Result 648 states and 691 transitions. [2020-07-08 16:27:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 691 transitions. [2020-07-08 16:27:17,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:27:17,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:27:17,822 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 648 states. [2020-07-08 16:27:17,822 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 648 states. [2020-07-08 16:27:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:27:17,844 INFO L93 Difference]: Finished difference Result 648 states and 691 transitions. [2020-07-08 16:27:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 691 transitions. [2020-07-08 16:27:17,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:27:17,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:27:17,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:27:17,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:27:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-07-08 16:27:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 291 transitions. [2020-07-08 16:27:17,850 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 291 transitions. Word has length 62 [2020-07-08 16:27:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:27:17,850 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 291 transitions. [2020-07-08 16:27:17,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-08 16:27:17,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 269 states and 291 transitions. [2020-07-08 16:27:19,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:27:19,076 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 291 transitions. [2020-07-08 16:27:19,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-08 16:27:19,077 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:27:19,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:27:19,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-08 16:27:19,078 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:27:19,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:27:19,078 INFO L82 PathProgramCache]: Analyzing trace with hash -649286859, now seen corresponding path program 1 times [2020-07-08 16:27:19,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:27:19,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [954269191] [2020-07-08 16:27:19,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:27:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:27:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:27:19,138 INFO L280 TraceCheckUtils]: 0: Hoare triple {30678#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {30670#true} is VALID [2020-07-08 16:27:19,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {30670#true} #valid := #valid[0 := 0]; {30670#true} is VALID [2020-07-08 16:27:19,138 INFO L280 TraceCheckUtils]: 2: Hoare triple {30670#true} assume 0 < #StackHeapBarrier; {30670#true} is VALID [2020-07-08 16:27:19,138 INFO L280 TraceCheckUtils]: 3: Hoare triple {30670#true} assume true; {30670#true} is VALID [2020-07-08 16:27:19,139 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {30670#true} {30670#true} #419#return; {30670#true} is VALID [2020-07-08 16:27:19,140 INFO L263 TraceCheckUtils]: 0: Hoare triple {30670#true} call ULTIMATE.init(); {30678#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:27:19,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {30678#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {30670#true} is VALID [2020-07-08 16:27:19,140 INFO L280 TraceCheckUtils]: 2: Hoare triple {30670#true} #valid := #valid[0 := 0]; {30670#true} is VALID [2020-07-08 16:27:19,140 INFO L280 TraceCheckUtils]: 3: Hoare triple {30670#true} assume 0 < #StackHeapBarrier; {30670#true} is VALID [2020-07-08 16:27:19,140 INFO L280 TraceCheckUtils]: 4: Hoare triple {30670#true} assume true; {30670#true} is VALID [2020-07-08 16:27:19,141 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {30670#true} {30670#true} #419#return; {30670#true} is VALID [2020-07-08 16:27:19,141 INFO L263 TraceCheckUtils]: 6: Hoare triple {30670#true} call #t~ret28 := main(); {30670#true} is VALID [2020-07-08 16:27:19,141 INFO L280 TraceCheckUtils]: 7: Hoare triple {30670#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {30670#true} is VALID [2020-07-08 16:27:19,141 INFO L280 TraceCheckUtils]: 8: Hoare triple {30670#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {30670#true} is VALID [2020-07-08 16:27:19,141 INFO L280 TraceCheckUtils]: 9: Hoare triple {30670#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {30670#true} is VALID [2020-07-08 16:27:19,141 INFO L280 TraceCheckUtils]: 10: Hoare triple {30670#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {30670#true} is VALID [2020-07-08 16:27:19,142 INFO L280 TraceCheckUtils]: 11: Hoare triple {30670#true} goto; {30670#true} is VALID [2020-07-08 16:27:19,142 INFO L280 TraceCheckUtils]: 12: Hoare triple {30670#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {30670#true} is VALID [2020-07-08 16:27:19,142 INFO L280 TraceCheckUtils]: 13: Hoare triple {30670#true} assume !(0 != #t~nondet1); {30670#true} is VALID [2020-07-08 16:27:19,142 INFO L280 TraceCheckUtils]: 14: Hoare triple {30670#true} havoc #t~nondet1; {30670#true} is VALID [2020-07-08 16:27:19,142 INFO L280 TraceCheckUtils]: 15: Hoare triple {30670#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {30670#true} is VALID [2020-07-08 16:27:19,143 INFO L280 TraceCheckUtils]: 16: Hoare triple {30670#true} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {30670#true} is VALID [2020-07-08 16:27:19,143 INFO L280 TraceCheckUtils]: 17: Hoare triple {30670#true} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {30670#true} is VALID [2020-07-08 16:27:19,143 INFO L280 TraceCheckUtils]: 18: Hoare triple {30670#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {30670#true} is VALID [2020-07-08 16:27:19,143 INFO L280 TraceCheckUtils]: 19: Hoare triple {30670#true} havoc #t~mem3.base, #t~mem3.offset; {30670#true} is VALID [2020-07-08 16:27:19,143 INFO L280 TraceCheckUtils]: 20: Hoare triple {30670#true} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {30670#true} is VALID [2020-07-08 16:27:19,143 INFO L280 TraceCheckUtils]: 21: Hoare triple {30670#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {30670#true} is VALID [2020-07-08 16:27:19,144 INFO L280 TraceCheckUtils]: 22: Hoare triple {30670#true} havoc #t~mem4.base, #t~mem4.offset; {30670#true} is VALID [2020-07-08 16:27:19,144 INFO L280 TraceCheckUtils]: 23: Hoare triple {30670#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {30670#true} is VALID [2020-07-08 16:27:19,144 INFO L280 TraceCheckUtils]: 24: Hoare triple {30670#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {30670#true} is VALID [2020-07-08 16:27:19,144 INFO L280 TraceCheckUtils]: 25: Hoare triple {30670#true} assume #t~short7; {30670#true} is VALID [2020-07-08 16:27:19,144 INFO L280 TraceCheckUtils]: 26: Hoare triple {30670#true} assume !!#t~short7; {30670#true} is VALID [2020-07-08 16:27:19,145 INFO L280 TraceCheckUtils]: 27: Hoare triple {30670#true} havoc #t~mem6.base, #t~mem6.offset; {30670#true} is VALID [2020-07-08 16:27:19,145 INFO L280 TraceCheckUtils]: 28: Hoare triple {30670#true} havoc #t~mem5.base, #t~mem5.offset; {30670#true} is VALID [2020-07-08 16:27:19,145 INFO L280 TraceCheckUtils]: 29: Hoare triple {30670#true} havoc #t~short7; {30670#true} is VALID [2020-07-08 16:27:19,145 INFO L280 TraceCheckUtils]: 30: Hoare triple {30670#true} goto; {30670#true} is VALID [2020-07-08 16:27:19,145 INFO L280 TraceCheckUtils]: 31: Hoare triple {30670#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {30670#true} is VALID [2020-07-08 16:27:19,145 INFO L280 TraceCheckUtils]: 32: Hoare triple {30670#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {30670#true} is VALID [2020-07-08 16:27:19,146 INFO L280 TraceCheckUtils]: 33: Hoare triple {30670#true} assume !(0 != #t~nondet8); {30670#true} is VALID [2020-07-08 16:27:19,146 INFO L280 TraceCheckUtils]: 34: Hoare triple {30670#true} havoc #t~nondet8; {30670#true} is VALID [2020-07-08 16:27:19,146 INFO L280 TraceCheckUtils]: 35: Hoare triple {30670#true} ~end~0.base, ~end~0.offset := 0, 0; {30670#true} is VALID [2020-07-08 16:27:19,146 INFO L280 TraceCheckUtils]: 36: Hoare triple {30670#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {30670#true} is VALID [2020-07-08 16:27:19,146 INFO L280 TraceCheckUtils]: 37: Hoare triple {30670#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {30670#true} is VALID [2020-07-08 16:27:19,146 INFO L280 TraceCheckUtils]: 38: Hoare triple {30670#true} goto; {30670#true} is VALID [2020-07-08 16:27:19,147 INFO L280 TraceCheckUtils]: 39: Hoare triple {30670#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {30670#true} is VALID [2020-07-08 16:27:19,147 INFO L280 TraceCheckUtils]: 40: Hoare triple {30670#true} ~len~0 := 0; {30670#true} is VALID [2020-07-08 16:27:19,147 INFO L280 TraceCheckUtils]: 41: Hoare triple {30670#true} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {30670#true} is VALID [2020-07-08 16:27:19,147 INFO L280 TraceCheckUtils]: 42: Hoare triple {30670#true} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {30670#true} is VALID [2020-07-08 16:27:19,147 INFO L280 TraceCheckUtils]: 43: Hoare triple {30670#true} havoc #t~mem18.base, #t~mem18.offset; {30670#true} is VALID [2020-07-08 16:27:19,148 INFO L280 TraceCheckUtils]: 44: Hoare triple {30670#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {30670#true} is VALID [2020-07-08 16:27:19,148 INFO L280 TraceCheckUtils]: 45: Hoare triple {30670#true} assume 0 == ~len~0; {30670#true} is VALID [2020-07-08 16:27:19,150 INFO L280 TraceCheckUtils]: 46: Hoare triple {30670#true} ~len~0 := 1; {30677#(= 1 main_~len~0)} is VALID [2020-07-08 16:27:19,150 INFO L280 TraceCheckUtils]: 47: Hoare triple {30677#(= 1 main_~len~0)} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {30677#(= 1 main_~len~0)} is VALID [2020-07-08 16:27:19,151 INFO L280 TraceCheckUtils]: 48: Hoare triple {30677#(= 1 main_~len~0)} goto; {30677#(= 1 main_~len~0)} is VALID [2020-07-08 16:27:19,151 INFO L280 TraceCheckUtils]: 49: Hoare triple {30677#(= 1 main_~len~0)} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {30677#(= 1 main_~len~0)} is VALID [2020-07-08 16:27:19,152 INFO L280 TraceCheckUtils]: 50: Hoare triple {30677#(= 1 main_~len~0)} assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); {30677#(= 1 main_~len~0)} is VALID [2020-07-08 16:27:19,152 INFO L280 TraceCheckUtils]: 51: Hoare triple {30677#(= 1 main_~len~0)} havoc #t~mem19.base, #t~mem19.offset; {30677#(= 1 main_~len~0)} is VALID [2020-07-08 16:27:19,152 INFO L280 TraceCheckUtils]: 52: Hoare triple {30677#(= 1 main_~len~0)} goto; {30677#(= 1 main_~len~0)} is VALID [2020-07-08 16:27:19,153 INFO L280 TraceCheckUtils]: 53: Hoare triple {30677#(= 1 main_~len~0)} SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); srcloc: L1026-6 {30677#(= 1 main_~len~0)} is VALID [2020-07-08 16:27:19,153 INFO L280 TraceCheckUtils]: 54: Hoare triple {30677#(= 1 main_~len~0)} assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); {30677#(= 1 main_~len~0)} is VALID [2020-07-08 16:27:19,153 INFO L280 TraceCheckUtils]: 55: Hoare triple {30677#(= 1 main_~len~0)} havoc #t~mem20.base, #t~mem20.offset; {30677#(= 1 main_~len~0)} is VALID [2020-07-08 16:27:19,154 INFO L280 TraceCheckUtils]: 56: Hoare triple {30677#(= 1 main_~len~0)} goto; {30677#(= 1 main_~len~0)} is VALID [2020-07-08 16:27:19,154 INFO L280 TraceCheckUtils]: 57: Hoare triple {30677#(= 1 main_~len~0)} SUMMARY for call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1026-7 {30677#(= 1 main_~len~0)} is VALID [2020-07-08 16:27:19,155 INFO L280 TraceCheckUtils]: 58: Hoare triple {30677#(= 1 main_~len~0)} ~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset; {30677#(= 1 main_~len~0)} is VALID [2020-07-08 16:27:19,155 INFO L280 TraceCheckUtils]: 59: Hoare triple {30677#(= 1 main_~len~0)} havoc #t~mem21.base, #t~mem21.offset; {30677#(= 1 main_~len~0)} is VALID [2020-07-08 16:27:19,155 INFO L280 TraceCheckUtils]: 60: Hoare triple {30677#(= 1 main_~len~0)} assume !(1 == ~len~0); {30671#false} is VALID [2020-07-08 16:27:19,155 INFO L280 TraceCheckUtils]: 61: Hoare triple {30671#false} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {30671#false} is VALID [2020-07-08 16:27:19,156 INFO L280 TraceCheckUtils]: 62: Hoare triple {30671#false} assume !(~len~0 <= 1); {30671#false} is VALID [2020-07-08 16:27:19,156 INFO L280 TraceCheckUtils]: 63: Hoare triple {30671#false} assume !false; {30671#false} is VALID [2020-07-08 16:27:19,158 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-08 16:27:19,158 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:27:19,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [954269191] [2020-07-08 16:27:19,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:27:19,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 16:27:19,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575799841] [2020-07-08 16:27:19,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-07-08 16:27:19,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:27:19,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 16:27:19,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:27:19,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 16:27:19,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:27:19,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 16:27:19,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 16:27:19,227 INFO L87 Difference]: Start difference. First operand 269 states and 291 transitions. Second operand 4 states. [2020-07-08 16:27:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:27:23,003 INFO L93 Difference]: Finished difference Result 447 states and 493 transitions. [2020-07-08 16:27:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 16:27:23,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-07-08 16:27:23,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:27:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:27:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2020-07-08 16:27:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:27:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2020-07-08 16:27:23,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 290 transitions. [2020-07-08 16:27:23,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:27:23,310 INFO L225 Difference]: With dead ends: 447 [2020-07-08 16:27:23,310 INFO L226 Difference]: Without dead ends: 350 [2020-07-08 16:27:23,311 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 16:27:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-07-08 16:27:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 302. [2020-07-08 16:27:26,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:27:26,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states. Second operand 302 states. [2020-07-08 16:27:26,034 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand 302 states. [2020-07-08 16:27:26,035 INFO L87 Difference]: Start difference. First operand 350 states. Second operand 302 states. [2020-07-08 16:27:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:27:26,043 INFO L93 Difference]: Finished difference Result 350 states and 378 transitions. [2020-07-08 16:27:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 378 transitions. [2020-07-08 16:27:26,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:27:26,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:27:26,044 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand 350 states. [2020-07-08 16:27:26,044 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 350 states. [2020-07-08 16:27:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:27:26,051 INFO L93 Difference]: Finished difference Result 350 states and 378 transitions. [2020-07-08 16:27:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 378 transitions. [2020-07-08 16:27:26,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:27:26,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:27:26,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:27:26,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:27:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-07-08 16:27:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 330 transitions. [2020-07-08 16:27:26,056 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 330 transitions. Word has length 64 [2020-07-08 16:27:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:27:26,056 INFO L479 AbstractCegarLoop]: Abstraction has 302 states and 330 transitions. [2020-07-08 16:27:26,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 16:27:26,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 302 states and 330 transitions. [2020-07-08 16:27:27,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:27:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 330 transitions. [2020-07-08 16:27:27,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-08 16:27:27,492 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:27:27,492 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:27:27,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-08 16:27:27,492 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:27:27,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:27:27,493 INFO L82 PathProgramCache]: Analyzing trace with hash -201437452, now seen corresponding path program 1 times [2020-07-08 16:27:27,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:27:27,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1712228361] [2020-07-08 16:27:27,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:27:27,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-08 16:27:27,509 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-08 16:27:27,514 INFO L168 Benchmark]: Toolchain (without parser) took 114646.32 ms. Allocated memory was 134.7 MB in the beginning and 782.2 MB in the end (delta: 647.5 MB). Free memory was 98.6 MB in the beginning and 207.2 MB in the end (delta: -108.6 MB). Peak memory consumption was 538.9 MB. Max. memory is 7.1 GB. [2020-07-08 16:27:27,515 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 134.7 MB. Free memory was 118.2 MB in the beginning and 117.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 16:27:27,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 638.39 ms. Allocated memory was 134.7 MB in the beginning and 199.2 MB in the end (delta: 64.5 MB). Free memory was 98.4 MB in the beginning and 164.4 MB in the end (delta: -66.0 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2020-07-08 16:27:27,515 INFO L168 Benchmark]: Boogie Preprocessor took 89.04 ms. Allocated memory is still 199.2 MB. Free memory was 164.4 MB in the beginning and 160.0 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2020-07-08 16:27:27,516 INFO L168 Benchmark]: RCFGBuilder took 1011.11 ms. Allocated memory was 199.2 MB in the beginning and 224.9 MB in the end (delta: 25.7 MB). Free memory was 160.0 MB in the beginning and 187.8 MB in the end (delta: -27.8 MB). Peak memory consumption was 87.3 MB. Max. memory is 7.1 GB. [2020-07-08 16:27:27,516 INFO L168 Benchmark]: TraceAbstraction took 112902.34 ms. Allocated memory was 224.9 MB in the beginning and 782.2 MB in the end (delta: 557.3 MB). Free memory was 187.8 MB in the beginning and 207.2 MB in the end (delta: -19.4 MB). Peak memory consumption was 537.9 MB. Max. memory is 7.1 GB. [2020-07-08 16:27:27,519 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.26 ms. Allocated memory is still 134.7 MB. Free memory was 118.2 MB in the beginning and 117.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 638.39 ms. Allocated memory was 134.7 MB in the beginning and 199.2 MB in the end (delta: 64.5 MB). Free memory was 98.4 MB in the beginning and 164.4 MB in the end (delta: -66.0 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 89.04 ms. Allocated memory is still 199.2 MB. Free memory was 164.4 MB in the beginning and 160.0 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1011.11 ms. Allocated memory was 199.2 MB in the beginning and 224.9 MB in the end (delta: 25.7 MB). Free memory was 160.0 MB in the beginning and 187.8 MB in the end (delta: -27.8 MB). Peak memory consumption was 87.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112902.34 ms. Allocated memory was 224.9 MB in the beginning and 782.2 MB in the end (delta: 557.3 MB). Free memory was 187.8 MB in the beginning and 207.2 MB in the end (delta: -19.4 MB). Peak memory consumption was 537.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...