/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:31:31,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:31:31,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:31:31,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:31:31,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:31:31,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:31:31,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:31:31,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:31:31,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:31:31,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:31:31,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:31:31,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:31:31,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:31:31,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:31:31,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:31:31,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:31:31,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:31:31,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:31:31,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:31:31,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:31:31,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:31:31,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:31:31,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:31:31,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:31:31,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:31:31,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:31:31,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:31:31,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:31:31,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:31:31,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:31:31,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:31:31,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:31:31,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:31:31,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:31:31,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:31:31,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:31:31,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:31:31,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:31:31,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:31:31,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:31:31,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:31:31,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:31:31,685 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:31:31,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:31:31,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:31:31,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:31:31,687 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:31:31,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:31:31,687 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:31:31,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:31:31,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:31:31,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:31:31,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:31:31,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:31:31,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:31:31,690 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:31:31,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:31:31,690 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:31:31,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:31:31,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:31:31,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:31:31,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:31:31,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:31:31,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:31:31,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:31:31,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:31:31,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:31:31,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:31:31,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:31:31,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:31:31,693 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:31:31,693 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:31:31,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:31:31,994 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:31:31,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:31:31,999 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:31:31,999 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:31:32,000 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-1.i [2020-07-17 22:31:32,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0d1ab98/b4700bb31ed44dbfb02edb87824cc902/FLAGe2f7e7a9b [2020-07-17 22:31:32,631 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:31:32,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i [2020-07-17 22:31:32,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0d1ab98/b4700bb31ed44dbfb02edb87824cc902/FLAGe2f7e7a9b [2020-07-17 22:31:32,893 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0d1ab98/b4700bb31ed44dbfb02edb87824cc902 [2020-07-17 22:31:32,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:31:32,908 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:31:32,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:31:32,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:31:32,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:31:32,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:31:32" (1/1) ... [2020-07-17 22:31:32,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6057d15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:32, skipping insertion in model container [2020-07-17 22:31:32,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:31:32" (1/1) ... [2020-07-17 22:31:32,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:31:32,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:31:33,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:31:33,609 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:31:33,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:31:33,714 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:31:33,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:33 WrapperNode [2020-07-17 22:31:33,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:31:33,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:31:33,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:31:33,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:31:33,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:33" (1/1) ... [2020-07-17 22:31:33,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:33" (1/1) ... [2020-07-17 22:31:33,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:33" (1/1) ... [2020-07-17 22:31:33,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:33" (1/1) ... [2020-07-17 22:31:33,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:33" (1/1) ... [2020-07-17 22:31:33,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:33" (1/1) ... [2020-07-17 22:31:33,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:33" (1/1) ... [2020-07-17 22:31:33,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:31:33,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:31:33,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:31:33,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:31:33,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31: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-17 22:31:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:31:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:31:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:31:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-17 22:31:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-17 22:31:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-17 22:31:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-17 22:31:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-17 22:31:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-17 22:31:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-17 22:31:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-17 22:31:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-17 22:31:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-17 22:31:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-17 22:31:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-17 22:31:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-17 22:31:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-17 22:31:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-17 22:31:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-17 22:31:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-17 22:31:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-17 22:31:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-17 22:31:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-17 22:31:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-17 22:31:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-17 22:31:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-17 22:31:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-17 22:31:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-17 22:31:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-17 22:31:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-17 22:31:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-17 22:31:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-17 22:31:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-17 22:31:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-17 22:31:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-17 22:31:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-17 22:31:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-17 22:31:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-17 22:31:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-17 22:31:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-17 22:31:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-17 22:31:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-17 22:31:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-17 22:31:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-17 22:31:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-17 22:31:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-17 22:31:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-17 22:31:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-17 22:31:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-17 22:31:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-17 22:31:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-17 22:31:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-17 22:31:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-17 22:31:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:31:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 22:31:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-17 22:31:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 22:31:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-17 22:31:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-17 22:31:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-17 22:31:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-17 22:31:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-17 22:31:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:31:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-17 22:31:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-17 22:31:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-17 22:31:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-17 22:31:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-17 22:31:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-17 22:31:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-17 22:31:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-17 22:31:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-17 22:31:33,916 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-17 22:31:33,916 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-17 22:31:33,917 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-17 22:31:33,917 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-17 22:31:33,917 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-17 22:31:33,917 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-17 22:31:33,917 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-17 22:31:33,917 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-17 22:31:33,917 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-17 22:31:33,918 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-17 22:31:33,918 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-17 22:31:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-17 22:31:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-17 22:31:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-17 22:31:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-17 22:31:33,920 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-17 22:31:33,920 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-17 22:31:33,920 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-17 22:31:33,921 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-17 22:31:33,921 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-17 22:31:33,921 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-17 22:31:33,921 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-17 22:31:33,922 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-17 22:31:33,922 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-17 22:31:33,922 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-17 22:31:33,922 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-17 22:31:33,922 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-17 22:31:33,922 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-17 22:31:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-17 22:31:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-17 22:31:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-17 22:31:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-17 22:31:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-17 22:31:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-17 22:31:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:31:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:31:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:31:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:31:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 22:31:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 22:31:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:31:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:31:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:31:34,877 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:31:34,877 INFO L295 CfgBuilder]: Removed 30 assume(true) statements. [2020-07-17 22:31:34,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:31:34 BoogieIcfgContainer [2020-07-17 22:31:34,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:31:34,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:31:34,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:31:34,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:31:34,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:31:32" (1/3) ... [2020-07-17 22:31:34,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2245511b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:31:34, skipping insertion in model container [2020-07-17 22:31:34,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:33" (2/3) ... [2020-07-17 22:31:34,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2245511b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:31:34, skipping insertion in model container [2020-07-17 22:31:34,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:31:34" (3/3) ... [2020-07-17 22:31:34,905 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2020-07-17 22:31:34,917 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:31:34,925 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-07-17 22:31:34,938 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-07-17 22:31:34,960 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:31:34,960 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:31:34,961 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:31:34,961 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:31:34,961 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:31:34,961 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:31:34,961 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:31:34,961 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:31:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-07-17 22:31:34,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-17 22:31:34,992 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:34,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:34,993 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-17 22:31:35,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:35,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1861454184, now seen corresponding path program 1 times [2020-07-17 22:31:35,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:35,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012541477] [2020-07-17 22:31:35,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:35,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {97#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {91#true} is VALID [2020-07-17 22:31:35,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-17 22:31:35,263 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {91#true} {91#true} #331#return; {91#true} is VALID [2020-07-17 22:31:35,267 INFO L263 TraceCheckUtils]: 0: Hoare triple {91#true} call ULTIMATE.init(); {97#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:35,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {97#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {91#true} is VALID [2020-07-17 22:31:35,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-17 22:31:35,268 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {91#true} {91#true} #331#return; {91#true} is VALID [2020-07-17 22:31:35,268 INFO L263 TraceCheckUtils]: 4: Hoare triple {91#true} call #t~ret28 := main(); {91#true} is VALID [2020-07-17 22:31:35,274 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {96#(not (= 0 main_~list~0.base))} is VALID [2020-07-17 22:31:35,275 INFO L280 TraceCheckUtils]: 6: Hoare triple {96#(not (= 0 main_~list~0.base))} assume !(~list~0.base != 0 || ~list~0.offset != 0); {92#false} is VALID [2020-07-17 22:31:35,275 INFO L280 TraceCheckUtils]: 7: Hoare triple {92#false} assume !false; {92#false} is VALID [2020-07-17 22:31:35,276 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-17 22:31:35,277 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012541477] [2020-07-17 22:31:35,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:35,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:31:35,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309511944] [2020-07-17 22:31:35,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-17 22:31:35,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:35,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:31:35,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:35,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:31:35,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:35,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:31:35,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:31:35,342 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2020-07-17 22:31:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:35,974 INFO L93 Difference]: Finished difference Result 186 states and 302 transitions. [2020-07-17 22:31:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:31:35,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-17 22:31:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:31:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 302 transitions. [2020-07-17 22:31:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:31:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 302 transitions. [2020-07-17 22:31:36,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 302 transitions. [2020-07-17 22:31:36,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 302 edges. 302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:36,500 INFO L225 Difference]: With dead ends: 186 [2020-07-17 22:31:36,500 INFO L226 Difference]: Without dead ends: 99 [2020-07-17 22:31:36,510 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-17 22:31:36,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-17 22:31:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2020-07-17 22:31:36,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:36,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 81 states. [2020-07-17 22:31:36,601 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 81 states. [2020-07-17 22:31:36,602 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 81 states. [2020-07-17 22:31:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:36,613 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2020-07-17 22:31:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2020-07-17 22:31:36,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:36,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:36,615 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 99 states. [2020-07-17 22:31:36,615 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 99 states. [2020-07-17 22:31:36,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:36,623 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2020-07-17 22:31:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2020-07-17 22:31:36,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:36,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:36,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:36,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-17 22:31:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2020-07-17 22:31:36,633 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 8 [2020-07-17 22:31:36,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:36,633 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2020-07-17 22:31:36,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:31:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2020-07-17 22:31:36,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:31:36,634 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:36,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:36,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:31:36,635 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-17 22:31:36,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:36,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1461031906, now seen corresponding path program 1 times [2020-07-17 22:31:36,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:36,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377954177] [2020-07-17 22:31:36,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:36,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {598#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {592#true} is VALID [2020-07-17 22:31:36,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {592#true} assume true; {592#true} is VALID [2020-07-17 22:31:36,749 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {592#true} {592#true} #331#return; {592#true} is VALID [2020-07-17 22:31:36,751 INFO L263 TraceCheckUtils]: 0: Hoare triple {592#true} call ULTIMATE.init(); {598#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:36,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {598#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {592#true} is VALID [2020-07-17 22:31:36,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {592#true} assume true; {592#true} is VALID [2020-07-17 22:31:36,752 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {592#true} {592#true} #331#return; {592#true} is VALID [2020-07-17 22:31:36,752 INFO L263 TraceCheckUtils]: 4: Hoare triple {592#true} call #t~ret28 := main(); {592#true} is VALID [2020-07-17 22:31:36,752 INFO L280 TraceCheckUtils]: 5: Hoare triple {592#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {592#true} is VALID [2020-07-17 22:31:36,753 INFO L280 TraceCheckUtils]: 6: Hoare triple {592#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {592#true} is VALID [2020-07-17 22:31:36,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {592#true} goto; {592#true} is VALID [2020-07-17 22:31:36,753 INFO L280 TraceCheckUtils]: 8: Hoare triple {592#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {592#true} is VALID [2020-07-17 22:31:36,754 INFO L280 TraceCheckUtils]: 9: Hoare triple {592#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {592#true} is VALID [2020-07-17 22:31:36,754 INFO L280 TraceCheckUtils]: 10: Hoare triple {592#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {592#true} is VALID [2020-07-17 22:31:36,755 INFO L280 TraceCheckUtils]: 11: Hoare triple {592#true} assume #t~short7; {597#|main_#t~short7|} is VALID [2020-07-17 22:31:36,756 INFO L280 TraceCheckUtils]: 12: Hoare triple {597#|main_#t~short7|} assume !#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; {593#false} is VALID [2020-07-17 22:31:36,756 INFO L280 TraceCheckUtils]: 13: Hoare triple {593#false} assume !false; {593#false} is VALID [2020-07-17 22:31:36,758 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-17 22:31:36,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377954177] [2020-07-17 22:31:36,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:36,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:31:36,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484529311] [2020-07-17 22:31:36,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-17 22:31:36,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:36,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:31:36,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:36,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:31:36,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:36,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:31:36,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:31:36,789 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 4 states. [2020-07-17 22:31:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:37,221 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2020-07-17 22:31:37,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:31:37,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-17 22:31:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:31:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2020-07-17 22:31:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:31:37,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2020-07-17 22:31:37,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2020-07-17 22:31:37,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:37,339 INFO L225 Difference]: With dead ends: 84 [2020-07-17 22:31:37,339 INFO L226 Difference]: Without dead ends: 82 [2020-07-17 22:31:37,341 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-17 22:31:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-17 22:31:37,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-07-17 22:31:37,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:37,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2020-07-17 22:31:37,370 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2020-07-17 22:31:37,370 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2020-07-17 22:31:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:37,375 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2020-07-17 22:31:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2020-07-17 22:31:37,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:37,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:37,376 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2020-07-17 22:31:37,376 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2020-07-17 22:31:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:37,381 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2020-07-17 22:31:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2020-07-17 22:31:37,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:37,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:37,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:37,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-17 22:31:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2020-07-17 22:31:37,387 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 14 [2020-07-17 22:31:37,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:37,387 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2020-07-17 22:31:37,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:31:37,387 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2020-07-17 22:31:37,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:31:37,388 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:37,388 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:37,388 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:31:37,389 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-17 22:31:37,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:37,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1461033828, now seen corresponding path program 1 times [2020-07-17 22:31:37,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:37,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201883173] [2020-07-17 22:31:37,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:37,523 INFO L280 TraceCheckUtils]: 0: Hoare triple {958#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {951#true} is VALID [2020-07-17 22:31:37,523 INFO L280 TraceCheckUtils]: 1: Hoare triple {951#true} assume true; {951#true} is VALID [2020-07-17 22:31:37,524 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {951#true} {951#true} #331#return; {951#true} is VALID [2020-07-17 22:31:37,525 INFO L263 TraceCheckUtils]: 0: Hoare triple {951#true} call ULTIMATE.init(); {958#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:37,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {958#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {951#true} is VALID [2020-07-17 22:31:37,525 INFO L280 TraceCheckUtils]: 2: Hoare triple {951#true} assume true; {951#true} is VALID [2020-07-17 22:31:37,525 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {951#true} {951#true} #331#return; {951#true} is VALID [2020-07-17 22:31:37,526 INFO L263 TraceCheckUtils]: 4: Hoare triple {951#true} call #t~ret28 := main(); {951#true} is VALID [2020-07-17 22:31:37,526 INFO L280 TraceCheckUtils]: 5: Hoare triple {951#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {951#true} is VALID [2020-07-17 22:31:37,526 INFO L280 TraceCheckUtils]: 6: Hoare triple {951#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {951#true} is VALID [2020-07-17 22:31:37,526 INFO L280 TraceCheckUtils]: 7: Hoare triple {951#true} goto; {951#true} is VALID [2020-07-17 22:31:37,527 INFO L280 TraceCheckUtils]: 8: Hoare triple {951#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {951#true} is VALID [2020-07-17 22:31:37,528 INFO L280 TraceCheckUtils]: 9: Hoare triple {951#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {956#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:37,528 INFO L280 TraceCheckUtils]: 10: Hoare triple {956#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {956#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:37,529 INFO L280 TraceCheckUtils]: 11: Hoare triple {956#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {957#|main_#t~short7|} is VALID [2020-07-17 22:31:37,531 INFO L280 TraceCheckUtils]: 12: Hoare triple {957#|main_#t~short7|} assume !#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; {952#false} is VALID [2020-07-17 22:31:37,531 INFO L280 TraceCheckUtils]: 13: Hoare triple {952#false} assume !false; {952#false} is VALID [2020-07-17 22:31:37,533 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-17 22:31:37,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201883173] [2020-07-17 22:31:37,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:37,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:31:37,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084883228] [2020-07-17 22:31:37,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:31:37,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:37,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:31:37,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:37,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:31:37,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:37,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:31:37,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:31:37,561 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 5 states. [2020-07-17 22:31:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:38,230 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2020-07-17 22:31:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:31:38,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:31:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:31:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2020-07-17 22:31:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:31:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2020-07-17 22:31:38,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 152 transitions. [2020-07-17 22:31:38,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:38,435 INFO L225 Difference]: With dead ends: 138 [2020-07-17 22:31:38,435 INFO L226 Difference]: Without dead ends: 136 [2020-07-17 22:31:38,436 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-17 22:31:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-07-17 22:31:38,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 84. [2020-07-17 22:31:38,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:38,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 84 states. [2020-07-17 22:31:38,464 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 84 states. [2020-07-17 22:31:38,464 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 84 states. [2020-07-17 22:31:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:38,469 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2020-07-17 22:31:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2020-07-17 22:31:38,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:38,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:38,471 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 136 states. [2020-07-17 22:31:38,471 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 136 states. [2020-07-17 22:31:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:38,478 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2020-07-17 22:31:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2020-07-17 22:31:38,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:38,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:38,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:38,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:38,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-17 22:31:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2020-07-17 22:31:38,483 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2020-07-17 22:31:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:38,483 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2020-07-17 22:31:38,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:31:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2020-07-17 22:31:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:31:38,484 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:38,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:38,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:31:38,485 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-17 22:31:38,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:38,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1462880870, now seen corresponding path program 1 times [2020-07-17 22:31:38,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:38,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218568790] [2020-07-17 22:31:38,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:38,583 INFO L280 TraceCheckUtils]: 0: Hoare triple {1488#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1481#true} is VALID [2020-07-17 22:31:38,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {1481#true} assume true; {1481#true} is VALID [2020-07-17 22:31:38,584 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1481#true} {1481#true} #331#return; {1481#true} is VALID [2020-07-17 22:31:38,587 INFO L263 TraceCheckUtils]: 0: Hoare triple {1481#true} call ULTIMATE.init(); {1488#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:38,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {1488#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1481#true} is VALID [2020-07-17 22:31:38,588 INFO L280 TraceCheckUtils]: 2: Hoare triple {1481#true} assume true; {1481#true} is VALID [2020-07-17 22:31:38,588 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1481#true} {1481#true} #331#return; {1481#true} is VALID [2020-07-17 22:31:38,589 INFO L263 TraceCheckUtils]: 4: Hoare triple {1481#true} call #t~ret28 := main(); {1481#true} is VALID [2020-07-17 22:31:38,589 INFO L280 TraceCheckUtils]: 5: Hoare triple {1481#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {1481#true} is VALID [2020-07-17 22:31:38,589 INFO L280 TraceCheckUtils]: 6: Hoare triple {1481#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1481#true} is VALID [2020-07-17 22:31:38,589 INFO L280 TraceCheckUtils]: 7: Hoare triple {1481#true} goto; {1481#true} is VALID [2020-07-17 22:31:38,590 INFO L280 TraceCheckUtils]: 8: Hoare triple {1481#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1481#true} is VALID [2020-07-17 22:31:38,590 INFO L280 TraceCheckUtils]: 9: Hoare triple {1481#true} assume !(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 8 + ~list~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem4.base, 8 + #t~mem4.offset, 4);havoc #t~mem4.base, #t~mem4.offset; {1481#true} is VALID [2020-07-17 22:31:38,593 INFO L280 TraceCheckUtils]: 10: Hoare triple {1481#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1486#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} is VALID [2020-07-17 22:31:38,595 INFO L280 TraceCheckUtils]: 11: Hoare triple {1486#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {1487#|main_#t~short7|} is VALID [2020-07-17 22:31:38,595 INFO L280 TraceCheckUtils]: 12: Hoare triple {1487#|main_#t~short7|} assume !#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; {1482#false} is VALID [2020-07-17 22:31:38,596 INFO L280 TraceCheckUtils]: 13: Hoare triple {1482#false} assume !false; {1482#false} is VALID [2020-07-17 22:31:38,596 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-17 22:31:38,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218568790] [2020-07-17 22:31:38,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:38,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:31:38,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750919212] [2020-07-17 22:31:38,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:31:38,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:38,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:31:38,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:38,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:31:38,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:38,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:31:38,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:31:38,615 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2020-07-17 22:31:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:39,016 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2020-07-17 22:31:39,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:31:39,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:31:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:31:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2020-07-17 22:31:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:31:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2020-07-17 22:31:39,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 91 transitions. [2020-07-17 22:31:39,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:39,127 INFO L225 Difference]: With dead ends: 84 [2020-07-17 22:31:39,127 INFO L226 Difference]: Without dead ends: 82 [2020-07-17 22:31:39,128 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:31:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-17 22:31:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2020-07-17 22:31:39,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:39,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 79 states. [2020-07-17 22:31:39,153 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 79 states. [2020-07-17 22:31:39,153 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 79 states. [2020-07-17 22:31:39,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:39,156 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2020-07-17 22:31:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2020-07-17 22:31:39,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:39,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:39,157 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 82 states. [2020-07-17 22:31:39,157 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 82 states. [2020-07-17 22:31:39,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:39,161 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2020-07-17 22:31:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2020-07-17 22:31:39,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:39,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:39,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:39,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-17 22:31:39,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2020-07-17 22:31:39,165 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2020-07-17 22:31:39,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:39,165 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2020-07-17 22:31:39,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:31:39,165 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2020-07-17 22:31:39,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:31:39,166 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:39,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:39,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:31:39,167 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-17 22:31:39,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:39,167 INFO L82 PathProgramCache]: Analyzing trace with hash 177734485, now seen corresponding path program 1 times [2020-07-17 22:31:39,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:39,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141973646] [2020-07-17 22:31:39,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:39,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {1845#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1838#true} is VALID [2020-07-17 22:31:39,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {1838#true} assume true; {1838#true} is VALID [2020-07-17 22:31:39,280 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1838#true} {1838#true} #331#return; {1838#true} is VALID [2020-07-17 22:31:39,281 INFO L263 TraceCheckUtils]: 0: Hoare triple {1838#true} call ULTIMATE.init(); {1845#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:39,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {1845#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1838#true} is VALID [2020-07-17 22:31:39,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {1838#true} assume true; {1838#true} is VALID [2020-07-17 22:31:39,282 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1838#true} {1838#true} #331#return; {1838#true} is VALID [2020-07-17 22:31:39,282 INFO L263 TraceCheckUtils]: 4: Hoare triple {1838#true} call #t~ret28 := main(); {1838#true} is VALID [2020-07-17 22:31:39,283 INFO L280 TraceCheckUtils]: 5: Hoare triple {1838#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {1838#true} is VALID [2020-07-17 22:31:39,283 INFO L280 TraceCheckUtils]: 6: Hoare triple {1838#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1838#true} is VALID [2020-07-17 22:31:39,283 INFO L280 TraceCheckUtils]: 7: Hoare triple {1838#true} goto; {1838#true} is VALID [2020-07-17 22:31:39,284 INFO L280 TraceCheckUtils]: 8: Hoare triple {1838#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1838#true} is VALID [2020-07-17 22:31:39,285 INFO L280 TraceCheckUtils]: 9: Hoare triple {1838#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {1843#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:39,286 INFO L280 TraceCheckUtils]: 10: Hoare triple {1843#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1844#(not |main_#t~short7|)} is VALID [2020-07-17 22:31:39,287 INFO L280 TraceCheckUtils]: 11: Hoare triple {1844#(not |main_#t~short7|)} assume #t~short7; {1839#false} is VALID [2020-07-17 22:31:39,287 INFO L280 TraceCheckUtils]: 12: Hoare triple {1839#false} assume !!#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; {1839#false} is VALID [2020-07-17 22:31:39,287 INFO L280 TraceCheckUtils]: 13: Hoare triple {1839#false} goto; {1839#false} is VALID [2020-07-17 22:31:39,288 INFO L280 TraceCheckUtils]: 14: Hoare triple {1839#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1839#false} is VALID [2020-07-17 22:31:39,288 INFO L280 TraceCheckUtils]: 15: Hoare triple {1839#false} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1839#false} is VALID [2020-07-17 22:31:39,288 INFO L280 TraceCheckUtils]: 16: Hoare triple {1839#false} assume !!(0 != #t~nondet8);havoc #t~nondet8;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, 4 + #t~mem10.offset, 4);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); {1839#false} is VALID [2020-07-17 22:31:39,288 INFO L280 TraceCheckUtils]: 17: Hoare triple {1839#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {1839#false} is VALID [2020-07-17 22:31:39,288 INFO L280 TraceCheckUtils]: 18: Hoare triple {1839#false} assume !false; {1839#false} is VALID [2020-07-17 22:31:39,289 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-17 22:31:39,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141973646] [2020-07-17 22:31:39,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:39,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:31:39,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282691701] [2020-07-17 22:31:39,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-17 22:31:39,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:39,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:31:39,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:39,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:31:39,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:39,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:31:39,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:31:39,319 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 5 states. [2020-07-17 22:31:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:39,973 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2020-07-17 22:31:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:31:39,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-17 22:31:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:31:39,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2020-07-17 22:31:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:31:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2020-07-17 22:31:39,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 221 transitions. [2020-07-17 22:31:40,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:40,254 INFO L225 Difference]: With dead ends: 199 [2020-07-17 22:31:40,255 INFO L226 Difference]: Without dead ends: 132 [2020-07-17 22:31:40,256 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-17 22:31:40,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-07-17 22:31:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 81. [2020-07-17 22:31:40,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:40,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 81 states. [2020-07-17 22:31:40,288 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 81 states. [2020-07-17 22:31:40,288 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 81 states. [2020-07-17 22:31:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:40,293 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2020-07-17 22:31:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2020-07-17 22:31:40,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:40,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:40,294 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 132 states. [2020-07-17 22:31:40,294 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 132 states. [2020-07-17 22:31:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:40,299 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2020-07-17 22:31:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2020-07-17 22:31:40,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:40,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:40,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:40,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-17 22:31:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2020-07-17 22:31:40,303 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 19 [2020-07-17 22:31:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:40,304 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2020-07-17 22:31:40,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:31:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2020-07-17 22:31:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:31:40,305 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:40,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:40,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:31:40,305 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-17 22:31:40,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:40,306 INFO L82 PathProgramCache]: Analyzing trace with hash -631612141, now seen corresponding path program 1 times [2020-07-17 22:31:40,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:40,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105190060] [2020-07-17 22:31:40,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:40,443 INFO L280 TraceCheckUtils]: 0: Hoare triple {2431#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2423#true} is VALID [2020-07-17 22:31:40,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {2423#true} assume true; {2423#true} is VALID [2020-07-17 22:31:40,443 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2423#true} {2423#true} #331#return; {2423#true} is VALID [2020-07-17 22:31:40,462 INFO L263 TraceCheckUtils]: 0: Hoare triple {2423#true} call ULTIMATE.init(); {2431#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:40,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {2431#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2423#true} is VALID [2020-07-17 22:31:40,463 INFO L280 TraceCheckUtils]: 2: Hoare triple {2423#true} assume true; {2423#true} is VALID [2020-07-17 22:31:40,463 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2423#true} {2423#true} #331#return; {2423#true} is VALID [2020-07-17 22:31:40,463 INFO L263 TraceCheckUtils]: 4: Hoare triple {2423#true} call #t~ret28 := main(); {2423#true} is VALID [2020-07-17 22:31:40,466 INFO L280 TraceCheckUtils]: 5: Hoare triple {2423#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-17 22:31:40,467 INFO L280 TraceCheckUtils]: 6: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-17 22:31:40,467 INFO L280 TraceCheckUtils]: 7: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} goto; {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-17 22:31:40,468 INFO L280 TraceCheckUtils]: 8: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-17 22:31:40,469 INFO L280 TraceCheckUtils]: 9: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-17 22:31:40,469 INFO L280 TraceCheckUtils]: 10: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-17 22:31:40,470 INFO L280 TraceCheckUtils]: 11: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-17 22:31:40,470 INFO L280 TraceCheckUtils]: 12: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} assume !!#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-17 22:31:40,471 INFO L280 TraceCheckUtils]: 13: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} goto; {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-17 22:31:40,472 INFO L280 TraceCheckUtils]: 14: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2429#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-17 22:31:40,473 INFO L280 TraceCheckUtils]: 15: Hoare triple {2429#(= 1 (select |#valid| main_~end~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2429#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-17 22:31:40,475 INFO L280 TraceCheckUtils]: 16: Hoare triple {2429#(= 1 (select |#valid| main_~end~0.base))} assume !!(0 != #t~nondet8);havoc #t~nondet8;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, 4 + #t~mem10.offset, 4);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); {2430#(not (= 0 main_~end~0.base))} is VALID [2020-07-17 22:31:40,476 INFO L280 TraceCheckUtils]: 17: Hoare triple {2430#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {2424#false} is VALID [2020-07-17 22:31:40,476 INFO L280 TraceCheckUtils]: 18: Hoare triple {2424#false} assume !false; {2424#false} is VALID [2020-07-17 22:31:40,477 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-17 22:31:40,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105190060] [2020-07-17 22:31:40,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:40,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:31:40,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136156857] [2020-07-17 22:31:40,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-17 22:31:40,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:40,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:31:40,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:40,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:31:40,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:40,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:31:40,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:31:40,506 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 6 states. [2020-07-17 22:31:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:41,203 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2020-07-17 22:31:41,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:31:41,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-17 22:31:41,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:31:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2020-07-17 22:31:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:31:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2020-07-17 22:31:41,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 138 transitions. [2020-07-17 22:31:41,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:41,398 INFO L225 Difference]: With dead ends: 126 [2020-07-17 22:31:41,398 INFO L226 Difference]: Without dead ends: 122 [2020-07-17 22:31:41,399 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-17 22:31:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-17 22:31:41,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2020-07-17 22:31:41,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:41,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 77 states. [2020-07-17 22:31:41,434 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 77 states. [2020-07-17 22:31:41,434 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 77 states. [2020-07-17 22:31:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:41,439 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2020-07-17 22:31:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2020-07-17 22:31:41,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:41,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:41,440 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 122 states. [2020-07-17 22:31:41,440 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 122 states. [2020-07-17 22:31:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:41,444 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2020-07-17 22:31:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2020-07-17 22:31:41,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:41,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:41,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:41,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-17 22:31:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2020-07-17 22:31:41,448 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 19 [2020-07-17 22:31:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:41,448 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2020-07-17 22:31:41,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:31:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2020-07-17 22:31:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:31:41,449 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:41,449 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:41,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:31:41,449 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-17 22:31:41,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:41,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1894864309, now seen corresponding path program 1 times [2020-07-17 22:31:41,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:41,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608272155] [2020-07-17 22:31:41,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:41,580 INFO L280 TraceCheckUtils]: 0: Hoare triple {2915#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2908#true} is VALID [2020-07-17 22:31:41,580 INFO L280 TraceCheckUtils]: 1: Hoare triple {2908#true} assume true; {2908#true} is VALID [2020-07-17 22:31:41,581 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2908#true} {2908#true} #331#return; {2908#true} is VALID [2020-07-17 22:31:41,582 INFO L263 TraceCheckUtils]: 0: Hoare triple {2908#true} call ULTIMATE.init(); {2915#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:41,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {2915#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2908#true} is VALID [2020-07-17 22:31:41,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {2908#true} assume true; {2908#true} is VALID [2020-07-17 22:31:41,583 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2908#true} {2908#true} #331#return; {2908#true} is VALID [2020-07-17 22:31:41,583 INFO L263 TraceCheckUtils]: 4: Hoare triple {2908#true} call #t~ret28 := main(); {2908#true} is VALID [2020-07-17 22:31:41,584 INFO L280 TraceCheckUtils]: 5: Hoare triple {2908#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-17 22:31:41,585 INFO L280 TraceCheckUtils]: 6: Hoare triple {2913#(not (= 0 main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-17 22:31:41,585 INFO L280 TraceCheckUtils]: 7: Hoare triple {2913#(not (= 0 main_~list~0.base))} goto; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-17 22:31:41,586 INFO L280 TraceCheckUtils]: 8: Hoare triple {2913#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-17 22:31:41,587 INFO L280 TraceCheckUtils]: 9: Hoare triple {2913#(not (= 0 main_~list~0.base))} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-17 22:31:41,587 INFO L280 TraceCheckUtils]: 10: Hoare triple {2913#(not (= 0 main_~list~0.base))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-17 22:31:41,588 INFO L280 TraceCheckUtils]: 11: Hoare triple {2913#(not (= 0 main_~list~0.base))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-17 22:31:41,602 INFO L280 TraceCheckUtils]: 12: Hoare triple {2913#(not (= 0 main_~list~0.base))} assume !!#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-17 22:31:41,603 INFO L280 TraceCheckUtils]: 13: Hoare triple {2913#(not (= 0 main_~list~0.base))} goto; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-17 22:31:41,603 INFO L280 TraceCheckUtils]: 14: Hoare triple {2913#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-17 22:31:41,604 INFO L280 TraceCheckUtils]: 15: Hoare triple {2913#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-17 22:31:41,604 INFO L280 TraceCheckUtils]: 16: Hoare triple {2913#(not (= 0 main_~list~0.base))} assume !(0 != #t~nondet8);havoc #t~nondet8; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-17 22:31:41,605 INFO L280 TraceCheckUtils]: 17: Hoare triple {2913#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2914#(not (= 0 main_~end~0.base))} is VALID [2020-07-17 22:31:41,605 INFO L280 TraceCheckUtils]: 18: Hoare triple {2914#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {2909#false} is VALID [2020-07-17 22:31:41,606 INFO L280 TraceCheckUtils]: 19: Hoare triple {2909#false} assume !false; {2909#false} is VALID [2020-07-17 22:31:41,607 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-17 22:31:41,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608272155] [2020-07-17 22:31:41,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:41,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:31:41,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698949436] [2020-07-17 22:31:41,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-17 22:31:41,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:41,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:31:41,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:41,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:31:41,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:41,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:31:41,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:31:41,635 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 5 states. [2020-07-17 22:31:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:42,129 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2020-07-17 22:31:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:31:42,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-17 22:31:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:31:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2020-07-17 22:31:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:31:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2020-07-17 22:31:42,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 148 transitions. [2020-07-17 22:31:42,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:42,315 INFO L225 Difference]: With dead ends: 136 [2020-07-17 22:31:42,316 INFO L226 Difference]: Without dead ends: 116 [2020-07-17 22:31:42,317 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-17 22:31:42,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-17 22:31:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2020-07-17 22:31:42,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:42,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 76 states. [2020-07-17 22:31:42,341 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 76 states. [2020-07-17 22:31:42,341 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 76 states. [2020-07-17 22:31:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:42,345 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2020-07-17 22:31:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2020-07-17 22:31:42,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:42,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:42,347 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 116 states. [2020-07-17 22:31:42,347 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 116 states. [2020-07-17 22:31:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:42,351 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2020-07-17 22:31:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2020-07-17 22:31:42,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:42,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:42,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:42,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-17 22:31:42,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2020-07-17 22:31:42,355 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 20 [2020-07-17 22:31:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:42,355 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2020-07-17 22:31:42,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:31:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2020-07-17 22:31:42,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:31:42,356 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:42,356 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-17 22:31:42,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:31:42,356 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-17 22:31:42,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:42,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1337316768, now seen corresponding path program 1 times [2020-07-17 22:31:42,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:42,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61663661] [2020-07-17 22:31:42,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:42,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {3393#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3387#true} is VALID [2020-07-17 22:31:42,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {3387#true} assume true; {3387#true} is VALID [2020-07-17 22:31:42,410 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3387#true} {3387#true} #331#return; {3387#true} is VALID [2020-07-17 22:31:42,411 INFO L263 TraceCheckUtils]: 0: Hoare triple {3387#true} call ULTIMATE.init(); {3393#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:42,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {3393#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3387#true} is VALID [2020-07-17 22:31:42,412 INFO L280 TraceCheckUtils]: 2: Hoare triple {3387#true} assume true; {3387#true} is VALID [2020-07-17 22:31:42,412 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3387#true} {3387#true} #331#return; {3387#true} is VALID [2020-07-17 22:31:42,412 INFO L263 TraceCheckUtils]: 4: Hoare triple {3387#true} call #t~ret28 := main(); {3387#true} is VALID [2020-07-17 22:31:42,412 INFO L280 TraceCheckUtils]: 5: Hoare triple {3387#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {3387#true} is VALID [2020-07-17 22:31:42,413 INFO L280 TraceCheckUtils]: 6: Hoare triple {3387#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {3387#true} is VALID [2020-07-17 22:31:42,413 INFO L280 TraceCheckUtils]: 7: Hoare triple {3387#true} goto; {3387#true} is VALID [2020-07-17 22:31:42,413 INFO L280 TraceCheckUtils]: 8: Hoare triple {3387#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3387#true} is VALID [2020-07-17 22:31:42,414 INFO L280 TraceCheckUtils]: 9: Hoare triple {3387#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {3387#true} is VALID [2020-07-17 22:31:42,414 INFO L280 TraceCheckUtils]: 10: Hoare triple {3387#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {3387#true} is VALID [2020-07-17 22:31:42,414 INFO L280 TraceCheckUtils]: 11: Hoare triple {3387#true} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {3387#true} is VALID [2020-07-17 22:31:42,414 INFO L280 TraceCheckUtils]: 12: Hoare triple {3387#true} assume !!#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; {3387#true} is VALID [2020-07-17 22:31:42,415 INFO L280 TraceCheckUtils]: 13: Hoare triple {3387#true} goto; {3387#true} is VALID [2020-07-17 22:31:42,415 INFO L280 TraceCheckUtils]: 14: Hoare triple {3387#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3387#true} is VALID [2020-07-17 22:31:42,415 INFO L280 TraceCheckUtils]: 15: Hoare triple {3387#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3387#true} is VALID [2020-07-17 22:31:42,415 INFO L280 TraceCheckUtils]: 16: Hoare triple {3387#true} assume !(0 != #t~nondet8);havoc #t~nondet8; {3387#true} is VALID [2020-07-17 22:31:42,416 INFO L280 TraceCheckUtils]: 17: Hoare triple {3387#true} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3387#true} is VALID [2020-07-17 22:31:42,416 INFO L280 TraceCheckUtils]: 18: Hoare triple {3387#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {3387#true} is VALID [2020-07-17 22:31:42,416 INFO L280 TraceCheckUtils]: 19: Hoare triple {3387#true} goto; {3387#true} is VALID [2020-07-17 22:31:42,418 INFO L280 TraceCheckUtils]: 20: Hoare triple {3387#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {3392#(= 0 main_~len~0)} is VALID [2020-07-17 22:31:42,418 INFO L280 TraceCheckUtils]: 21: Hoare triple {3392#(= 0 main_~len~0)} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {3392#(= 0 main_~len~0)} is VALID [2020-07-17 22:31:42,419 INFO L280 TraceCheckUtils]: 22: Hoare triple {3392#(= 0 main_~len~0)} assume !(~len~0 <= 1); {3388#false} is VALID [2020-07-17 22:31:42,420 INFO L280 TraceCheckUtils]: 23: Hoare triple {3388#false} assume !false; {3388#false} is VALID [2020-07-17 22:31:42,421 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-17 22:31:42,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61663661] [2020-07-17 22:31:42,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:42,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:31:42,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828592942] [2020-07-17 22:31:42,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-17 22:31:42,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:42,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:31:42,451 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-17 22:31:42,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:31:42,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:42,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:31:42,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:31:42,453 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 4 states. [2020-07-17 22:31:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:42,848 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2020-07-17 22:31:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:31:42,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-17 22:31:42,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:31:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2020-07-17 22:31:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:31:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2020-07-17 22:31:42,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2020-07-17 22:31:43,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:43,034 INFO L225 Difference]: With dead ends: 141 [2020-07-17 22:31:43,034 INFO L226 Difference]: Without dead ends: 100 [2020-07-17 22:31:43,035 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-17 22:31:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-17 22:31:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2020-07-17 22:31:43,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:43,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 79 states. [2020-07-17 22:31:43,070 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 79 states. [2020-07-17 22:31:43,070 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 79 states. [2020-07-17 22:31:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:43,074 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-07-17 22:31:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2020-07-17 22:31:43,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:43,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:43,074 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 100 states. [2020-07-17 22:31:43,075 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 100 states. [2020-07-17 22:31:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:43,078 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-07-17 22:31:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2020-07-17 22:31:43,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:43,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:43,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:43,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-17 22:31:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2020-07-17 22:31:43,081 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 24 [2020-07-17 22:31:43,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:43,082 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2020-07-17 22:31:43,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:31:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2020-07-17 22:31:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:31:43,083 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:43,083 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] [2020-07-17 22:31:43,083 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:31:43,083 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-17 22:31:43,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:43,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1492857654, now seen corresponding path program 1 times [2020-07-17 22:31:43,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:43,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399464081] [2020-07-17 22:31:43,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:43,185 INFO L280 TraceCheckUtils]: 0: Hoare triple {3847#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3841#true} is VALID [2020-07-17 22:31:43,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {3841#true} assume true; {3841#true} is VALID [2020-07-17 22:31:43,185 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3841#true} {3841#true} #331#return; {3841#true} is VALID [2020-07-17 22:31:43,187 INFO L263 TraceCheckUtils]: 0: Hoare triple {3841#true} call ULTIMATE.init(); {3847#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:43,187 INFO L280 TraceCheckUtils]: 1: Hoare triple {3847#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3841#true} is VALID [2020-07-17 22:31:43,187 INFO L280 TraceCheckUtils]: 2: Hoare triple {3841#true} assume true; {3841#true} is VALID [2020-07-17 22:31:43,187 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3841#true} {3841#true} #331#return; {3841#true} is VALID [2020-07-17 22:31:43,187 INFO L263 TraceCheckUtils]: 4: Hoare triple {3841#true} call #t~ret28 := main(); {3841#true} is VALID [2020-07-17 22:31:43,188 INFO L280 TraceCheckUtils]: 5: Hoare triple {3841#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {3841#true} is VALID [2020-07-17 22:31:43,188 INFO L280 TraceCheckUtils]: 6: Hoare triple {3841#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {3841#true} is VALID [2020-07-17 22:31:43,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {3841#true} goto; {3841#true} is VALID [2020-07-17 22:31:43,188 INFO L280 TraceCheckUtils]: 8: Hoare triple {3841#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3841#true} is VALID [2020-07-17 22:31:43,189 INFO L280 TraceCheckUtils]: 9: Hoare triple {3841#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {3841#true} is VALID [2020-07-17 22:31:43,189 INFO L280 TraceCheckUtils]: 10: Hoare triple {3841#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {3841#true} is VALID [2020-07-17 22:31:43,189 INFO L280 TraceCheckUtils]: 11: Hoare triple {3841#true} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {3841#true} is VALID [2020-07-17 22:31:43,189 INFO L280 TraceCheckUtils]: 12: Hoare triple {3841#true} assume !!#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; {3841#true} is VALID [2020-07-17 22:31:43,190 INFO L280 TraceCheckUtils]: 13: Hoare triple {3841#true} goto; {3841#true} is VALID [2020-07-17 22:31:43,190 INFO L280 TraceCheckUtils]: 14: Hoare triple {3841#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3841#true} is VALID [2020-07-17 22:31:43,190 INFO L280 TraceCheckUtils]: 15: Hoare triple {3841#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3841#true} is VALID [2020-07-17 22:31:43,190 INFO L280 TraceCheckUtils]: 16: Hoare triple {3841#true} assume !(0 != #t~nondet8);havoc #t~nondet8; {3841#true} is VALID [2020-07-17 22:31:43,190 INFO L280 TraceCheckUtils]: 17: Hoare triple {3841#true} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3841#true} is VALID [2020-07-17 22:31:43,191 INFO L280 TraceCheckUtils]: 18: Hoare triple {3841#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {3841#true} is VALID [2020-07-17 22:31:43,191 INFO L280 TraceCheckUtils]: 19: Hoare triple {3841#true} goto; {3841#true} is VALID [2020-07-17 22:31:43,191 INFO L280 TraceCheckUtils]: 20: Hoare triple {3841#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {3841#true} is VALID [2020-07-17 22:31:43,193 INFO L280 TraceCheckUtils]: 21: Hoare triple {3841#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {3846#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-17 22:31:43,194 INFO L280 TraceCheckUtils]: 22: Hoare triple {3846#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume 0 == ~len~0;~len~0 := 1; {3846#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-17 22:31:43,194 INFO L280 TraceCheckUtils]: 23: Hoare triple {3846#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {3842#false} is VALID [2020-07-17 22:31:43,195 INFO L280 TraceCheckUtils]: 24: Hoare triple {3842#false} assume !false; {3842#false} is VALID [2020-07-17 22:31:43,196 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-17 22:31:43,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399464081] [2020-07-17 22:31:43,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:43,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:31:43,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812556785] [2020-07-17 22:31:43,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-17 22:31:43,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:43,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:31:43,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:43,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:31:43,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:43,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:31:43,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:31:43,236 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 4 states. [2020-07-17 22:31:43,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:43,584 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2020-07-17 22:31:43,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:31:43,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-17 22:31:43,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:31:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2020-07-17 22:31:43,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:31:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2020-07-17 22:31:43,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2020-07-17 22:31:43,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:43,709 INFO L225 Difference]: With dead ends: 79 [2020-07-17 22:31:43,710 INFO L226 Difference]: Without dead ends: 77 [2020-07-17 22:31:43,710 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-17 22:31:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-17 22:31:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-07-17 22:31:43,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:43,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 77 states. [2020-07-17 22:31:43,742 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2020-07-17 22:31:43,742 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2020-07-17 22:31:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:43,746 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2020-07-17 22:31:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2020-07-17 22:31:43,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:43,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:43,753 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2020-07-17 22:31:43,753 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2020-07-17 22:31:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:43,761 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2020-07-17 22:31:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2020-07-17 22:31:43,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:43,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:43,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:43,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-17 22:31:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2020-07-17 22:31:43,769 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 25 [2020-07-17 22:31:43,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:43,770 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2020-07-17 22:31:43,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:31:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2020-07-17 22:31:43,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:31:43,771 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:43,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:43,771 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 22:31:43,775 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-17 22:31:43,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1632693981, now seen corresponding path program 1 times [2020-07-17 22:31:43,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:43,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341998004] [2020-07-17 22:31:43,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:43,866 INFO L280 TraceCheckUtils]: 0: Hoare triple {4189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4182#true} is VALID [2020-07-17 22:31:43,866 INFO L280 TraceCheckUtils]: 1: Hoare triple {4182#true} assume true; {4182#true} is VALID [2020-07-17 22:31:43,866 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4182#true} {4182#true} #331#return; {4182#true} is VALID [2020-07-17 22:31:43,868 INFO L263 TraceCheckUtils]: 0: Hoare triple {4182#true} call ULTIMATE.init(); {4189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:43,869 INFO L280 TraceCheckUtils]: 1: Hoare triple {4189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4182#true} is VALID [2020-07-17 22:31:43,869 INFO L280 TraceCheckUtils]: 2: Hoare triple {4182#true} assume true; {4182#true} is VALID [2020-07-17 22:31:43,869 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4182#true} {4182#true} #331#return; {4182#true} is VALID [2020-07-17 22:31:43,869 INFO L263 TraceCheckUtils]: 4: Hoare triple {4182#true} call #t~ret28 := main(); {4182#true} is VALID [2020-07-17 22:31:43,870 INFO L280 TraceCheckUtils]: 5: Hoare triple {4182#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {4182#true} is VALID [2020-07-17 22:31:43,870 INFO L280 TraceCheckUtils]: 6: Hoare triple {4182#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {4182#true} is VALID [2020-07-17 22:31:43,870 INFO L280 TraceCheckUtils]: 7: Hoare triple {4182#true} goto; {4182#true} is VALID [2020-07-17 22:31:43,870 INFO L280 TraceCheckUtils]: 8: Hoare triple {4182#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4182#true} is VALID [2020-07-17 22:31:43,871 INFO L280 TraceCheckUtils]: 9: Hoare triple {4182#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {4182#true} is VALID [2020-07-17 22:31:43,871 INFO L280 TraceCheckUtils]: 10: Hoare triple {4182#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4182#true} is VALID [2020-07-17 22:31:43,871 INFO L280 TraceCheckUtils]: 11: Hoare triple {4182#true} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {4182#true} is VALID [2020-07-17 22:31:43,871 INFO L280 TraceCheckUtils]: 12: Hoare triple {4182#true} assume !!#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; {4182#true} is VALID [2020-07-17 22:31:43,872 INFO L280 TraceCheckUtils]: 13: Hoare triple {4182#true} goto; {4182#true} is VALID [2020-07-17 22:31:43,872 INFO L280 TraceCheckUtils]: 14: Hoare triple {4182#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4182#true} is VALID [2020-07-17 22:31:43,872 INFO L280 TraceCheckUtils]: 15: Hoare triple {4182#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4182#true} is VALID [2020-07-17 22:31:43,872 INFO L280 TraceCheckUtils]: 16: Hoare triple {4182#true} assume !!(0 != #t~nondet8);havoc #t~nondet8;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, 4 + #t~mem10.offset, 4);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); {4182#true} is VALID [2020-07-17 22:31:43,873 INFO L280 TraceCheckUtils]: 17: Hoare triple {4182#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {4182#true} is VALID [2020-07-17 22:31:43,873 INFO L280 TraceCheckUtils]: 18: Hoare triple {4182#true} goto; {4182#true} is VALID [2020-07-17 22:31:43,873 INFO L280 TraceCheckUtils]: 19: Hoare triple {4182#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {4182#true} is VALID [2020-07-17 22:31:43,874 INFO L280 TraceCheckUtils]: 20: Hoare triple {4182#true} goto; {4182#true} is VALID [2020-07-17 22:31:43,874 INFO L280 TraceCheckUtils]: 21: Hoare triple {4182#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {4182#true} is VALID [2020-07-17 22:31:43,874 INFO L280 TraceCheckUtils]: 22: Hoare triple {4182#true} assume 0 != #t~nondet12;havoc #t~nondet12;call write~$Pointer$(0, 0, ~end~0.base, 8 + ~end~0.offset, 4); {4182#true} is VALID [2020-07-17 22:31:43,875 INFO L280 TraceCheckUtils]: 23: Hoare triple {4182#true} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);#t~short18 := #t~mem16.base != 0 || #t~mem16.offset != 0; {4187#(or |main_#t~short18| (and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)))))} is VALID [2020-07-17 22:31:43,878 INFO L280 TraceCheckUtils]: 24: Hoare triple {4187#(or |main_#t~short18| (and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)))))} assume !#t~short18;call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);#t~short18 := #t~mem17.base == 0 && #t~mem17.offset == 0; {4188#|main_#t~short18|} is VALID [2020-07-17 22:31:43,880 INFO L280 TraceCheckUtils]: 25: Hoare triple {4188#|main_#t~short18|} assume !#t~short18;havoc #t~short18;havoc #t~mem16.base, #t~mem16.offset;havoc #t~mem17.base, #t~mem17.offset; {4183#false} is VALID [2020-07-17 22:31:43,880 INFO L280 TraceCheckUtils]: 26: Hoare triple {4183#false} assume !false; {4183#false} is VALID [2020-07-17 22:31:43,882 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-17 22:31:43,882 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341998004] [2020-07-17 22:31:43,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:43,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:31:43,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888892135] [2020-07-17 22:31:43,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-17 22:31:43,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:43,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:31:43,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:43,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:31:43,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:43,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:31:43,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:31:43,920 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 5 states. [2020-07-17 22:31:44,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:44,356 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2020-07-17 22:31:44,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:31:44,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-17 22:31:44,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:44,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:31:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2020-07-17 22:31:44,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:31:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2020-07-17 22:31:44,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2020-07-17 22:31:44,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:44,457 INFO L225 Difference]: With dead ends: 78 [2020-07-17 22:31:44,457 INFO L226 Difference]: Without dead ends: 76 [2020-07-17 22:31:44,457 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:31:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-17 22:31:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2020-07-17 22:31:44,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:44,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 75 states. [2020-07-17 22:31:44,490 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 75 states. [2020-07-17 22:31:44,491 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 75 states. [2020-07-17 22:31:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:44,493 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2020-07-17 22:31:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-07-17 22:31:44,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:44,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:44,493 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 76 states. [2020-07-17 22:31:44,493 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 76 states. [2020-07-17 22:31:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:44,495 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2020-07-17 22:31:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-07-17 22:31:44,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:44,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:44,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:44,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-17 22:31:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2020-07-17 22:31:44,497 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 27 [2020-07-17 22:31:44,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:44,497 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2020-07-17 22:31:44,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:31:44,497 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2020-07-17 22:31:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:31:44,498 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:44,498 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:44,498 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 22:31:44,499 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-17 22:31:44,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:44,499 INFO L82 PathProgramCache]: Analyzing trace with hash 668074133, now seen corresponding path program 1 times [2020-07-17 22:31:44,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:44,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999058593] [2020-07-17 22:31:44,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:44,631 INFO L280 TraceCheckUtils]: 0: Hoare triple {4527#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4519#true} is VALID [2020-07-17 22:31:44,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {4519#true} assume true; {4519#true} is VALID [2020-07-17 22:31:44,633 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4519#true} {4519#true} #331#return; {4519#true} is VALID [2020-07-17 22:31:44,638 INFO L263 TraceCheckUtils]: 0: Hoare triple {4519#true} call ULTIMATE.init(); {4527#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:44,638 INFO L280 TraceCheckUtils]: 1: Hoare triple {4527#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4519#true} is VALID [2020-07-17 22:31:44,638 INFO L280 TraceCheckUtils]: 2: Hoare triple {4519#true} assume true; {4519#true} is VALID [2020-07-17 22:31:44,639 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4519#true} {4519#true} #331#return; {4519#true} is VALID [2020-07-17 22:31:44,639 INFO L263 TraceCheckUtils]: 4: Hoare triple {4519#true} call #t~ret28 := main(); {4519#true} is VALID [2020-07-17 22:31:44,639 INFO L280 TraceCheckUtils]: 5: Hoare triple {4519#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {4519#true} is VALID [2020-07-17 22:31:44,639 INFO L280 TraceCheckUtils]: 6: Hoare triple {4519#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {4519#true} is VALID [2020-07-17 22:31:44,640 INFO L280 TraceCheckUtils]: 7: Hoare triple {4519#true} goto; {4519#true} is VALID [2020-07-17 22:31:44,640 INFO L280 TraceCheckUtils]: 8: Hoare triple {4519#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4519#true} is VALID [2020-07-17 22:31:44,642 INFO L280 TraceCheckUtils]: 9: Hoare triple {4519#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:44,643 INFO L280 TraceCheckUtils]: 10: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:44,644 INFO L280 TraceCheckUtils]: 11: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:44,645 INFO L280 TraceCheckUtils]: 12: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:44,646 INFO L280 TraceCheckUtils]: 13: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:44,649 INFO L280 TraceCheckUtils]: 14: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:44,652 INFO L280 TraceCheckUtils]: 15: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:44,653 INFO L280 TraceCheckUtils]: 16: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != #t~nondet8);havoc #t~nondet8; {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:44,654 INFO L280 TraceCheckUtils]: 17: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4525#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-17 22:31:44,655 INFO L280 TraceCheckUtils]: 18: Hoare triple {4525#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {4525#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-17 22:31:44,657 INFO L280 TraceCheckUtils]: 19: Hoare triple {4525#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} goto; {4525#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-17 22:31:44,658 INFO L280 TraceCheckUtils]: 20: Hoare triple {4525#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {4526#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-17 22:31:44,658 INFO L280 TraceCheckUtils]: 21: Hoare triple {4526#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {4520#false} is VALID [2020-07-17 22:31:44,659 INFO L280 TraceCheckUtils]: 22: Hoare triple {4520#false} assume 0 == ~len~0;~len~0 := 1; {4520#false} is VALID [2020-07-17 22:31:44,659 INFO L280 TraceCheckUtils]: 23: Hoare triple {4520#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {4520#false} is VALID [2020-07-17 22:31:44,659 INFO L280 TraceCheckUtils]: 24: Hoare triple {4520#false} goto; {4520#false} is VALID [2020-07-17 22:31:44,659 INFO L280 TraceCheckUtils]: 25: Hoare triple {4520#false} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); {4520#false} is VALID [2020-07-17 22:31:44,659 INFO L280 TraceCheckUtils]: 26: Hoare triple {4520#false} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset);havoc #t~mem20.base, #t~mem20.offset; {4520#false} is VALID [2020-07-17 22:31:44,660 INFO L280 TraceCheckUtils]: 27: Hoare triple {4520#false} assume !false; {4520#false} is VALID [2020-07-17 22:31:44,662 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-17 22:31:44,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999058593] [2020-07-17 22:31:44,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:44,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:31:44,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896836765] [2020-07-17 22:31:44,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-17 22:31:44,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:44,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:31:44,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:44,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:31:44,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:44,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:31:44,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:31:44,699 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 6 states. [2020-07-17 22:31:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:45,743 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2020-07-17 22:31:45,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:31:45,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-17 22:31:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:31:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2020-07-17 22:31:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:31:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2020-07-17 22:31:45,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 191 transitions. [2020-07-17 22:31:46,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:46,025 INFO L225 Difference]: With dead ends: 179 [2020-07-17 22:31:46,025 INFO L226 Difference]: Without dead ends: 137 [2020-07-17 22:31:46,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:31:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-17 22:31:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2020-07-17 22:31:46,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:46,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 85 states. [2020-07-17 22:31:46,075 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 85 states. [2020-07-17 22:31:46,075 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 85 states. [2020-07-17 22:31:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:46,079 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2020-07-17 22:31:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2020-07-17 22:31:46,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:46,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:46,080 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 137 states. [2020-07-17 22:31:46,080 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 137 states. [2020-07-17 22:31:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:46,084 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2020-07-17 22:31:46,084 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2020-07-17 22:31:46,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:46,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:46,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:46,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-17 22:31:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2020-07-17 22:31:46,087 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2020-07-17 22:31:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:46,087 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2020-07-17 22:31:46,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:31:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2020-07-17 22:31:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:31:46,088 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:46,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:46,089 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 22:31:46,089 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-17 22:31:46,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:46,089 INFO L82 PathProgramCache]: Analyzing trace with hash 567478293, now seen corresponding path program 1 times [2020-07-17 22:31:46,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:46,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705072032] [2020-07-17 22:31:46,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:46,343 INFO L280 TraceCheckUtils]: 0: Hoare triple {5119#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5109#true} is VALID [2020-07-17 22:31:46,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {5109#true} assume true; {5109#true} is VALID [2020-07-17 22:31:46,344 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5109#true} {5109#true} #331#return; {5109#true} is VALID [2020-07-17 22:31:46,345 INFO L263 TraceCheckUtils]: 0: Hoare triple {5109#true} call ULTIMATE.init(); {5119#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:46,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {5119#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5109#true} is VALID [2020-07-17 22:31:46,346 INFO L280 TraceCheckUtils]: 2: Hoare triple {5109#true} assume true; {5109#true} is VALID [2020-07-17 22:31:46,346 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5109#true} {5109#true} #331#return; {5109#true} is VALID [2020-07-17 22:31:46,347 INFO L263 TraceCheckUtils]: 4: Hoare triple {5109#true} call #t~ret28 := main(); {5109#true} is VALID [2020-07-17 22:31:46,353 INFO L280 TraceCheckUtils]: 5: Hoare triple {5109#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-17 22:31:46,357 INFO L280 TraceCheckUtils]: 6: Hoare triple {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-17 22:31:46,358 INFO L280 TraceCheckUtils]: 7: Hoare triple {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} goto; {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-17 22:31:46,362 INFO L280 TraceCheckUtils]: 8: Hoare triple {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-17 22:31:46,365 INFO L280 TraceCheckUtils]: 9: Hoare triple {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 8 + ~list~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem4.base, 8 + #t~mem4.offset, 4);havoc #t~mem4.base, #t~mem4.offset; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:46,366 INFO L280 TraceCheckUtils]: 10: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:46,367 INFO L280 TraceCheckUtils]: 11: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume #t~short7; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:46,368 INFO L280 TraceCheckUtils]: 12: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:46,369 INFO L280 TraceCheckUtils]: 13: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:46,370 INFO L280 TraceCheckUtils]: 14: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:46,370 INFO L280 TraceCheckUtils]: 15: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:46,371 INFO L280 TraceCheckUtils]: 16: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != #t~nondet8);havoc #t~nondet8; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:46,372 INFO L280 TraceCheckUtils]: 17: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-17 22:31:46,373 INFO L280 TraceCheckUtils]: 18: Hoare triple {5116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {5116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-17 22:31:46,374 INFO L280 TraceCheckUtils]: 19: Hoare triple {5116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} goto; {5116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-17 22:31:46,375 INFO L280 TraceCheckUtils]: 20: Hoare triple {5116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-17 22:31:46,375 INFO L280 TraceCheckUtils]: 21: Hoare triple {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-17 22:31:46,376 INFO L280 TraceCheckUtils]: 22: Hoare triple {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} assume 0 == ~len~0;~len~0 := 1; {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-17 22:31:46,377 INFO L280 TraceCheckUtils]: 23: Hoare triple {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-17 22:31:46,378 INFO L280 TraceCheckUtils]: 24: Hoare triple {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} goto; {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-17 22:31:46,379 INFO L280 TraceCheckUtils]: 25: Hoare triple {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); {5118#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} is VALID [2020-07-17 22:31:46,379 INFO L280 TraceCheckUtils]: 26: Hoare triple {5118#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset);havoc #t~mem20.base, #t~mem20.offset; {5110#false} is VALID [2020-07-17 22:31:46,380 INFO L280 TraceCheckUtils]: 27: Hoare triple {5110#false} assume !false; {5110#false} is VALID [2020-07-17 22:31:46,384 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-17 22:31:46,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705072032] [2020-07-17 22:31:46,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:46,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-17 22:31:46,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319700651] [2020-07-17 22:31:46,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-17 22:31:46,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:46,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:31:46,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:46,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:31:46,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:46,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:31:46,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:31:46,442 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 8 states. [2020-07-17 22:31:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:48,667 INFO L93 Difference]: Finished difference Result 228 states and 252 transitions. [2020-07-17 22:31:48,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 22:31:48,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-17 22:31:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:31:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 235 transitions. [2020-07-17 22:31:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:31:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 235 transitions. [2020-07-17 22:31:48,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 235 transitions. [2020-07-17 22:31:49,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:49,125 INFO L225 Difference]: With dead ends: 228 [2020-07-17 22:31:49,125 INFO L226 Difference]: Without dead ends: 226 [2020-07-17 22:31:49,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:31:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-07-17 22:31:49,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 97. [2020-07-17 22:31:49,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:49,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand 97 states. [2020-07-17 22:31:49,204 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand 97 states. [2020-07-17 22:31:49,204 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 97 states. [2020-07-17 22:31:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:49,210 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2020-07-17 22:31:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 250 transitions. [2020-07-17 22:31:49,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:49,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:49,211 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 226 states. [2020-07-17 22:31:49,211 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 226 states. [2020-07-17 22:31:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:49,217 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2020-07-17 22:31:49,217 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 250 transitions. [2020-07-17 22:31:49,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:49,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:49,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:49,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:49,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-17 22:31:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2020-07-17 22:31:49,221 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 28 [2020-07-17 22:31:49,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:49,222 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2020-07-17 22:31:49,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:31:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2020-07-17 22:31:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:31:49,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:49,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:49,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 22:31:49,223 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-17 22:31:49,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1429819819, now seen corresponding path program 1 times [2020-07-17 22:31:49,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:49,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083900127] [2020-07-17 22:31:49,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:49,319 INFO L280 TraceCheckUtils]: 0: Hoare triple {5959#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5952#true} is VALID [2020-07-17 22:31:49,319 INFO L280 TraceCheckUtils]: 1: Hoare triple {5952#true} assume true; {5952#true} is VALID [2020-07-17 22:31:49,320 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5952#true} {5952#true} #331#return; {5952#true} is VALID [2020-07-17 22:31:49,321 INFO L263 TraceCheckUtils]: 0: Hoare triple {5952#true} call ULTIMATE.init(); {5959#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:49,321 INFO L280 TraceCheckUtils]: 1: Hoare triple {5959#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5952#true} is VALID [2020-07-17 22:31:49,322 INFO L280 TraceCheckUtils]: 2: Hoare triple {5952#true} assume true; {5952#true} is VALID [2020-07-17 22:31:49,322 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5952#true} {5952#true} #331#return; {5952#true} is VALID [2020-07-17 22:31:49,322 INFO L263 TraceCheckUtils]: 4: Hoare triple {5952#true} call #t~ret28 := main(); {5952#true} is VALID [2020-07-17 22:31:49,322 INFO L280 TraceCheckUtils]: 5: Hoare triple {5952#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {5952#true} is VALID [2020-07-17 22:31:49,323 INFO L280 TraceCheckUtils]: 6: Hoare triple {5952#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {5952#true} is VALID [2020-07-17 22:31:49,323 INFO L280 TraceCheckUtils]: 7: Hoare triple {5952#true} goto; {5952#true} is VALID [2020-07-17 22:31:49,323 INFO L280 TraceCheckUtils]: 8: Hoare triple {5952#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5952#true} is VALID [2020-07-17 22:31:49,325 INFO L280 TraceCheckUtils]: 9: Hoare triple {5952#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,326 INFO L280 TraceCheckUtils]: 10: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,327 INFO L280 TraceCheckUtils]: 11: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,328 INFO L280 TraceCheckUtils]: 12: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,329 INFO L280 TraceCheckUtils]: 13: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,330 INFO L280 TraceCheckUtils]: 14: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,331 INFO L280 TraceCheckUtils]: 15: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,332 INFO L280 TraceCheckUtils]: 16: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != #t~nondet8);havoc #t~nondet8; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,333 INFO L280 TraceCheckUtils]: 17: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,334 INFO L280 TraceCheckUtils]: 18: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,335 INFO L280 TraceCheckUtils]: 19: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,336 INFO L280 TraceCheckUtils]: 20: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,337 INFO L280 TraceCheckUtils]: 21: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,338 INFO L280 TraceCheckUtils]: 22: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(~len~0 <= 1); {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,339 INFO L280 TraceCheckUtils]: 23: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,340 INFO L280 TraceCheckUtils]: 24: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,341 INFO L280 TraceCheckUtils]: 25: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-17 22:31:49,342 INFO L280 TraceCheckUtils]: 26: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(0 != ~list~0.base || 0 != ~list~0.offset);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset;havoc #t~mem24.base, #t~mem24.offset; {5958#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-17 22:31:49,343 INFO L280 TraceCheckUtils]: 27: Hoare triple {5958#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} assume 0 != ~end~0.base || 0 != ~end~0.offset; {5953#false} is VALID [2020-07-17 22:31:49,344 INFO L280 TraceCheckUtils]: 28: Hoare triple {5953#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {5953#false} is VALID [2020-07-17 22:31:49,344 INFO L280 TraceCheckUtils]: 29: Hoare triple {5953#false} assume !false; {5953#false} is VALID [2020-07-17 22:31:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:31:49,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083900127] [2020-07-17 22:31:49,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:49,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:31:49,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788637257] [2020-07-17 22:31:49,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-17 22:31:49,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:49,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:31:49,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:49,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:31:49,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:49,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:31:49,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:31:49,415 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 5 states. [2020-07-17 22:31:50,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:50,136 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2020-07-17 22:31:50,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:31:50,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-17 22:31:50,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:31:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2020-07-17 22:31:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:31:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2020-07-17 22:31:50,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 137 transitions. [2020-07-17 22:31:50,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:50,326 INFO L225 Difference]: With dead ends: 143 [2020-07-17 22:31:50,327 INFO L226 Difference]: Without dead ends: 125 [2020-07-17 22:31:50,327 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-17 22:31:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-07-17 22:31:50,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2020-07-17 22:31:50,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:50,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 117 states. [2020-07-17 22:31:50,425 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 117 states. [2020-07-17 22:31:50,425 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 117 states. [2020-07-17 22:31:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:50,429 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2020-07-17 22:31:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2020-07-17 22:31:50,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:50,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:50,430 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 125 states. [2020-07-17 22:31:50,431 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 125 states. [2020-07-17 22:31:50,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:50,434 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2020-07-17 22:31:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2020-07-17 22:31:50,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:50,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:50,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:50,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-17 22:31:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2020-07-17 22:31:50,440 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 30 [2020-07-17 22:31:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:50,440 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2020-07-17 22:31:50,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:31:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2020-07-17 22:31:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:31:50,441 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:50,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:50,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 22:31:50,442 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-17 22:31:50,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:50,442 INFO L82 PathProgramCache]: Analyzing trace with hash -753501909, now seen corresponding path program 1 times [2020-07-17 22:31:50,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:50,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403001898] [2020-07-17 22:31:50,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:50,521 INFO L280 TraceCheckUtils]: 0: Hoare triple {6519#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6513#true} is VALID [2020-07-17 22:31:50,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {6513#true} assume true; {6513#true} is VALID [2020-07-17 22:31:50,521 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6513#true} {6513#true} #331#return; {6513#true} is VALID [2020-07-17 22:31:50,522 INFO L263 TraceCheckUtils]: 0: Hoare triple {6513#true} call ULTIMATE.init(); {6519#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:50,523 INFO L280 TraceCheckUtils]: 1: Hoare triple {6519#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6513#true} is VALID [2020-07-17 22:31:50,523 INFO L280 TraceCheckUtils]: 2: Hoare triple {6513#true} assume true; {6513#true} is VALID [2020-07-17 22:31:50,523 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6513#true} {6513#true} #331#return; {6513#true} is VALID [2020-07-17 22:31:50,523 INFO L263 TraceCheckUtils]: 4: Hoare triple {6513#true} call #t~ret28 := main(); {6513#true} is VALID [2020-07-17 22:31:50,523 INFO L280 TraceCheckUtils]: 5: Hoare triple {6513#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {6513#true} is VALID [2020-07-17 22:31:50,524 INFO L280 TraceCheckUtils]: 6: Hoare triple {6513#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {6513#true} is VALID [2020-07-17 22:31:50,524 INFO L280 TraceCheckUtils]: 7: Hoare triple {6513#true} goto; {6513#true} is VALID [2020-07-17 22:31:50,524 INFO L280 TraceCheckUtils]: 8: Hoare triple {6513#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6513#true} is VALID [2020-07-17 22:31:50,524 INFO L280 TraceCheckUtils]: 9: Hoare triple {6513#true} assume !(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 8 + ~list~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem4.base, 8 + #t~mem4.offset, 4);havoc #t~mem4.base, #t~mem4.offset; {6513#true} is VALID [2020-07-17 22:31:50,524 INFO L280 TraceCheckUtils]: 10: Hoare triple {6513#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {6513#true} is VALID [2020-07-17 22:31:50,525 INFO L280 TraceCheckUtils]: 11: Hoare triple {6513#true} assume #t~short7; {6513#true} is VALID [2020-07-17 22:31:50,525 INFO L280 TraceCheckUtils]: 12: Hoare triple {6513#true} assume !!#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7; {6513#true} is VALID [2020-07-17 22:31:50,525 INFO L280 TraceCheckUtils]: 13: Hoare triple {6513#true} goto; {6513#true} is VALID [2020-07-17 22:31:50,526 INFO L280 TraceCheckUtils]: 14: Hoare triple {6513#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6513#true} is VALID [2020-07-17 22:31:50,527 INFO L280 TraceCheckUtils]: 15: Hoare triple {6513#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {6513#true} is VALID [2020-07-17 22:31:50,527 INFO L280 TraceCheckUtils]: 16: Hoare triple {6513#true} assume !(0 != #t~nondet8);havoc #t~nondet8; {6513#true} is VALID [2020-07-17 22:31:50,527 INFO L280 TraceCheckUtils]: 17: Hoare triple {6513#true} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6513#true} is VALID [2020-07-17 22:31:50,527 INFO L280 TraceCheckUtils]: 18: Hoare triple {6513#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {6513#true} is VALID [2020-07-17 22:31:50,527 INFO L280 TraceCheckUtils]: 19: Hoare triple {6513#true} goto; {6513#true} is VALID [2020-07-17 22:31:50,528 INFO L280 TraceCheckUtils]: 20: Hoare triple {6513#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {6513#true} is VALID [2020-07-17 22:31:50,528 INFO L280 TraceCheckUtils]: 21: Hoare triple {6513#true} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {6513#true} is VALID [2020-07-17 22:31:50,528 INFO L280 TraceCheckUtils]: 22: Hoare triple {6513#true} assume !!(~len~0 <= 1); {6513#true} is VALID [2020-07-17 22:31:50,529 INFO L280 TraceCheckUtils]: 23: Hoare triple {6513#true} goto; {6513#true} is VALID [2020-07-17 22:31:50,529 INFO L280 TraceCheckUtils]: 24: Hoare triple {6513#true} call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset; {6513#true} is VALID [2020-07-17 22:31:50,530 INFO L280 TraceCheckUtils]: 25: Hoare triple {6513#true} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {6513#true} is VALID [2020-07-17 22:31:50,530 INFO L280 TraceCheckUtils]: 26: Hoare triple {6513#true} assume !!(0 != ~list~0.base || 0 != ~list~0.offset);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset;havoc #t~mem24.base, #t~mem24.offset; {6513#true} is VALID [2020-07-17 22:31:50,531 INFO L280 TraceCheckUtils]: 27: Hoare triple {6513#true} assume 0 != ~end~0.base || 0 != ~end~0.offset; {6518#(or (not (= 0 main_~end~0.base)) (not (= 0 main_~end~0.offset)))} is VALID [2020-07-17 22:31:50,531 INFO L280 TraceCheckUtils]: 28: Hoare triple {6518#(or (not (= 0 main_~end~0.base)) (not (= 0 main_~end~0.offset)))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {6514#false} is VALID [2020-07-17 22:31:50,532 INFO L280 TraceCheckUtils]: 29: Hoare triple {6514#false} assume !false; {6514#false} is VALID [2020-07-17 22:31:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:31:50,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403001898] [2020-07-17 22:31:50,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:50,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:31:50,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37561600] [2020-07-17 22:31:50,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-17 22:31:50,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:50,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:31:50,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:50,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:31:50,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:50,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:31:50,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:31:50,571 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand 4 states. [2020-07-17 22:31:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:51,049 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2020-07-17 22:31:51,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:31:51,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-17 22:31:51,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:31:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2020-07-17 22:31:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:31:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2020-07-17 22:31:51,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2020-07-17 22:31:51,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:51,176 INFO L225 Difference]: With dead ends: 117 [2020-07-17 22:31:51,176 INFO L226 Difference]: Without dead ends: 115 [2020-07-17 22:31:51,177 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-17 22:31:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-17 22:31:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2020-07-17 22:31:51,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:51,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 115 states. [2020-07-17 22:31:51,311 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2020-07-17 22:31:51,311 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2020-07-17 22:31:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:51,315 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2020-07-17 22:31:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2020-07-17 22:31:51,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:51,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:51,316 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2020-07-17 22:31:51,316 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2020-07-17 22:31:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:51,319 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2020-07-17 22:31:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2020-07-17 22:31:51,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:51,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:51,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:51,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-07-17 22:31:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2020-07-17 22:31:51,323 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 30 [2020-07-17 22:31:51,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:51,324 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2020-07-17 22:31:51,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:31:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2020-07-17 22:31:51,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:31:51,324 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:51,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:51,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 22:31:51,325 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-17 22:31:51,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:51,326 INFO L82 PathProgramCache]: Analyzing trace with hash 758661948, now seen corresponding path program 1 times [2020-07-17 22:31:51,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:51,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716426200] [2020-07-17 22:31:51,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:31:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:31:51,432 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:31:51,432 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:31:51,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 22:31:51,501 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:31:51,501 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:31:51,501 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:31:51,502 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:31:51,502 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:31:51,502 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:31:51,502 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:31:51,502 WARN L170 areAnnotationChecker]: L995-4 has no Hoare annotation [2020-07-17 22:31:51,502 WARN L170 areAnnotationChecker]: L995-4 has no Hoare annotation [2020-07-17 22:31:51,502 WARN L170 areAnnotationChecker]: L995-4 has no Hoare annotation [2020-07-17 22:31:51,503 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:31:51,503 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:31:51,503 WARN L170 areAnnotationChecker]: L995-5 has no Hoare annotation [2020-07-17 22:31:51,503 WARN L170 areAnnotationChecker]: L995-1 has no Hoare annotation [2020-07-17 22:31:51,503 WARN L170 areAnnotationChecker]: L995-1 has no Hoare annotation [2020-07-17 22:31:51,503 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-17 22:31:51,503 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-17 22:31:51,504 WARN L170 areAnnotationChecker]: L995-6 has no Hoare annotation [2020-07-17 22:31:51,504 WARN L170 areAnnotationChecker]: L995-6 has no Hoare annotation [2020-07-17 22:31:51,504 WARN L170 areAnnotationChecker]: L995-15 has no Hoare annotation [2020-07-17 22:31:51,504 WARN L170 areAnnotationChecker]: L995-15 has no Hoare annotation [2020-07-17 22:31:51,504 WARN L170 areAnnotationChecker]: L995-9 has no Hoare annotation [2020-07-17 22:31:51,504 WARN L170 areAnnotationChecker]: L995-9 has no Hoare annotation [2020-07-17 22:31:51,504 WARN L170 areAnnotationChecker]: L995-16 has no Hoare annotation [2020-07-17 22:31:51,504 WARN L170 areAnnotationChecker]: L995-11 has no Hoare annotation [2020-07-17 22:31:51,504 WARN L170 areAnnotationChecker]: L995-11 has no Hoare annotation [2020-07-17 22:31:51,505 WARN L170 areAnnotationChecker]: L1008-15 has no Hoare annotation [2020-07-17 22:31:51,505 WARN L170 areAnnotationChecker]: L1008-15 has no Hoare annotation [2020-07-17 22:31:51,505 WARN L170 areAnnotationChecker]: L995-12 has no Hoare annotation [2020-07-17 22:31:51,505 WARN L170 areAnnotationChecker]: L995-12 has no Hoare annotation [2020-07-17 22:31:51,505 WARN L170 areAnnotationChecker]: L995-14 has no Hoare annotation [2020-07-17 22:31:51,505 WARN L170 areAnnotationChecker]: L995-14 has no Hoare annotation [2020-07-17 22:31:51,505 WARN L170 areAnnotationChecker]: L1000-3 has no Hoare annotation [2020-07-17 22:31:51,505 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-17 22:31:51,506 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-17 22:31:51,506 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-17 22:31:51,506 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-17 22:31:51,506 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-17 22:31:51,506 WARN L170 areAnnotationChecker]: L1007-4 has no Hoare annotation [2020-07-17 22:31:51,506 WARN L170 areAnnotationChecker]: L1007-4 has no Hoare annotation [2020-07-17 22:31:51,506 WARN L170 areAnnotationChecker]: L1007-4 has no Hoare annotation [2020-07-17 22:31:51,506 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-17 22:31:51,506 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-17 22:31:51,507 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-17 22:31:51,507 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2020-07-17 22:31:51,507 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2020-07-17 22:31:51,507 WARN L170 areAnnotationChecker]: L1015-3 has no Hoare annotation [2020-07-17 22:31:51,507 WARN L170 areAnnotationChecker]: L1015-3 has no Hoare annotation [2020-07-17 22:31:51,507 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-17 22:31:51,507 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-17 22:31:51,507 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-17 22:31:51,508 WARN L170 areAnnotationChecker]: L1007-1 has no Hoare annotation [2020-07-17 22:31:51,508 WARN L170 areAnnotationChecker]: L1007-1 has no Hoare annotation [2020-07-17 22:31:51,508 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-17 22:31:51,508 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-17 22:31:51,508 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-17 22:31:51,508 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-17 22:31:51,508 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-17 22:31:51,508 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-17 22:31:51,509 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-17 22:31:51,509 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-17 22:31:51,509 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-17 22:31:51,509 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-17 22:31:51,509 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-17 22:31:51,509 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-17 22:31:51,509 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-17 22:31:51,509 WARN L170 areAnnotationChecker]: L1038-2 has no Hoare annotation [2020-07-17 22:31:51,509 WARN L170 areAnnotationChecker]: L1042 has no Hoare annotation [2020-07-17 22:31:51,510 WARN L170 areAnnotationChecker]: L1042 has no Hoare annotation [2020-07-17 22:31:51,510 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-17 22:31:51,510 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-17 22:31:51,510 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-17 22:31:51,510 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2020-07-17 22:31:51,510 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2020-07-17 22:31:51,510 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-17 22:31:51,510 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-17 22:31:51,510 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:31:51,511 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-17 22:31:51,511 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-17 22:31:51,511 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-17 22:31:51,511 WARN L170 areAnnotationChecker]: L1042-2 has no Hoare annotation [2020-07-17 22:31:51,511 WARN L170 areAnnotationChecker]: L1032-4 has no Hoare annotation [2020-07-17 22:31:51,511 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-17 22:31:51,511 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-17 22:31:51,511 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-17 22:31:51,511 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-17 22:31:51,512 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-17 22:31:51,512 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-17 22:31:51,512 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-17 22:31:51,512 WARN L170 areAnnotationChecker]: L1008-14 has no Hoare annotation [2020-07-17 22:31:51,512 WARN L170 areAnnotationChecker]: L1008-14 has no Hoare annotation [2020-07-17 22:31:51,512 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:31:51,512 WARN L170 areAnnotationChecker]: L1045-4 has no Hoare annotation [2020-07-17 22:31:51,512 WARN L170 areAnnotationChecker]: L1045-4 has no Hoare annotation [2020-07-17 22:31:51,512 WARN L170 areAnnotationChecker]: L1044-1 has no Hoare annotation [2020-07-17 22:31:51,513 WARN L170 areAnnotationChecker]: L1044-1 has no Hoare annotation [2020-07-17 22:31:51,513 WARN L170 areAnnotationChecker]: L1044-3 has no Hoare annotation [2020-07-17 22:31:51,513 WARN L170 areAnnotationChecker]: L1044-3 has no Hoare annotation [2020-07-17 22:31:51,513 WARN L170 areAnnotationChecker]: L1028-4 has no Hoare annotation [2020-07-17 22:31:51,513 WARN L170 areAnnotationChecker]: L1028-4 has no Hoare annotation [2020-07-17 22:31:51,513 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-17 22:31:51,513 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-17 22:31:51,513 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2020-07-17 22:31:51,513 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2020-07-17 22:31:51,514 WARN L170 areAnnotationChecker]: L1008-8 has no Hoare annotation [2020-07-17 22:31:51,514 WARN L170 areAnnotationChecker]: L1008-8 has no Hoare annotation [2020-07-17 22:31:51,514 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-17 22:31:51,514 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-17 22:31:51,514 WARN L170 areAnnotationChecker]: L1046-4 has no Hoare annotation [2020-07-17 22:31:51,514 WARN L170 areAnnotationChecker]: L1046-4 has no Hoare annotation [2020-07-17 22:31:51,514 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-17 22:31:51,514 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-17 22:31:51,515 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-17 22:31:51,515 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-17 22:31:51,515 WARN L170 areAnnotationChecker]: L1008-10 has no Hoare annotation [2020-07-17 22:31:51,515 WARN L170 areAnnotationChecker]: L1008-10 has no Hoare annotation [2020-07-17 22:31:51,515 WARN L170 areAnnotationChecker]: L1045-1 has no Hoare annotation [2020-07-17 22:31:51,515 WARN L170 areAnnotationChecker]: L1045-1 has no Hoare annotation [2020-07-17 22:31:51,515 WARN L170 areAnnotationChecker]: L1045-3 has no Hoare annotation [2020-07-17 22:31:51,515 WARN L170 areAnnotationChecker]: L1045-3 has no Hoare annotation [2020-07-17 22:31:51,516 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2020-07-17 22:31:51,516 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2020-07-17 22:31:51,516 WARN L170 areAnnotationChecker]: L1046-5 has no Hoare annotation [2020-07-17 22:31:51,516 WARN L170 areAnnotationChecker]: L1028-1 has no Hoare annotation [2020-07-17 22:31:51,516 WARN L170 areAnnotationChecker]: L1028-1 has no Hoare annotation [2020-07-17 22:31:51,516 WARN L170 areAnnotationChecker]: L1028-3 has no Hoare annotation [2020-07-17 22:31:51,516 WARN L170 areAnnotationChecker]: L1028-3 has no Hoare annotation [2020-07-17 22:31:51,516 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2020-07-17 22:31:51,516 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2020-07-17 22:31:51,517 WARN L170 areAnnotationChecker]: L1029-5 has no Hoare annotation [2020-07-17 22:31:51,517 WARN L170 areAnnotationChecker]: L1008-11 has no Hoare annotation [2020-07-17 22:31:51,517 WARN L170 areAnnotationChecker]: L1008-11 has no Hoare annotation [2020-07-17 22:31:51,517 WARN L170 areAnnotationChecker]: L1008-13 has no Hoare annotation [2020-07-17 22:31:51,517 WARN L170 areAnnotationChecker]: L1008-13 has no Hoare annotation [2020-07-17 22:31:51,517 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2020-07-17 22:31:51,517 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2020-07-17 22:31:51,517 WARN L170 areAnnotationChecker]: L1046-3 has no Hoare annotation [2020-07-17 22:31:51,518 WARN L170 areAnnotationChecker]: L1046-3 has no Hoare annotation [2020-07-17 22:31:51,518 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-17 22:31:51,518 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-17 22:31:51,518 WARN L170 areAnnotationChecker]: L1029-3 has no Hoare annotation [2020-07-17 22:31:51,518 WARN L170 areAnnotationChecker]: L1029-3 has no Hoare annotation [2020-07-17 22:31:51,518 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:31:51,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:31:51 BoogieIcfgContainer [2020-07-17 22:31:51,526 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:31:51,533 INFO L168 Benchmark]: Toolchain (without parser) took 18622.81 ms. Allocated memory was 144.2 MB in the beginning and 401.6 MB in the end (delta: 257.4 MB). Free memory was 100.8 MB in the beginning and 335.3 MB in the end (delta: -234.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:31:51,534 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:31:51,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.81 ms. Allocated memory was 144.2 MB in the beginning and 202.9 MB in the end (delta: 58.7 MB). Free memory was 100.3 MB in the beginning and 169.3 MB in the end (delta: -68.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:31:51,539 INFO L168 Benchmark]: Boogie Preprocessor took 106.06 ms. Allocated memory is still 202.9 MB. Free memory was 169.3 MB in the beginning and 165.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:31:51,543 INFO L168 Benchmark]: RCFGBuilder took 1073.43 ms. Allocated memory was 202.9 MB in the beginning and 233.3 MB in the end (delta: 30.4 MB). Free memory was 165.0 MB in the beginning and 205.5 MB in the end (delta: -40.5 MB). Peak memory consumption was 83.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:31:51,544 INFO L168 Benchmark]: TraceAbstraction took 16628.58 ms. Allocated memory was 233.3 MB in the beginning and 401.6 MB in the end (delta: 168.3 MB). Free memory was 205.5 MB in the beginning and 335.3 MB in the end (delta: -129.8 MB). Peak memory consumption was 38.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:31:51,548 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.27 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.81 ms. Allocated memory was 144.2 MB in the beginning and 202.9 MB in the end (delta: 58.7 MB). Free memory was 100.3 MB in the beginning and 169.3 MB in the end (delta: -68.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.06 ms. Allocated memory is still 202.9 MB. Free memory was 169.3 MB in the beginning and 165.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1073.43 ms. Allocated memory was 202.9 MB in the beginning and 233.3 MB in the end (delta: 30.4 MB). Free memory was 165.0 MB in the beginning and 205.5 MB in the end (delta: -40.5 MB). Peak memory consumption was 83.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16628.58 ms. Allocated memory was 233.3 MB in the beginning and 401.6 MB in the end (delta: 168.3 MB). Free memory was 205.5 MB in the beginning and 335.3 MB in the end (delta: -129.8 MB). Peak memory consumption was 38.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] SLL* list = malloc(sizeof(SLL)); [L993] list->next = ((void*)0) [L994] list->prev = ((void*)0) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L995] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] list->inner = malloc(sizeof(SLL)) [L995] EXPR list->inner [L995] list->inner->next = ((void*)0) [L995] EXPR list->inner [L995] list->inner->inner = ((void*)0) [L995] EXPR list->inner [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L997] SLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1015] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; [L1020] EXPR end->inner [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1023] COND TRUE len == 0 [L1024] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1027] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1028] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1029] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 88 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1050 SDtfs, 927 SDslu, 1484 SDs, 0 SdLazy, 1936 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 420 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 42885 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...