/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/heap-data/quick_sort_split.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:09:54,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:09:54,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:09:54,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:09:54,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:09:54,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:09:54,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:09:54,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:09:54,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:09:54,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:09:54,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:09:54,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:09:54,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:09:54,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:09:54,989 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:09:54,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:09:54,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:09:54,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:09:54,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:09:55,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:09:55,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:09:55,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:09:55,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:09:55,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:09:55,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:09:55,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:09:55,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:09:55,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:09:55,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:09:55,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:09:55,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:09:55,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:09:55,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:09:55,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:09:55,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:09:55,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:09:55,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:09:55,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:09:55,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:09:55,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:09:55,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:09:55,032 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-10 15:09:55,057 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:09:55,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:09:55,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:09:55,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:09:55,061 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:09:55,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:09:55,061 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:09:55,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:09:55,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:09:55,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:09:55,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:09:55,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:09:55,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:09:55,064 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:09:55,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:09:55,065 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:09:55,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:09:55,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:09:55,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:09:55,065 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:09:55,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:09:55,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:09:55,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:09:55,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:09:55,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:09:55,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:09:55,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:09:55,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:09:55,067 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:09:55,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:09:55,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:09:55,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:09:55,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:09:55,400 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:09:55,400 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:09:55,401 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/quick_sort_split.i [2020-07-10 15:09:55,482 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ed4abfb/44da65c91a8641e9a1177068685d9df9/FLAG663adba80 [2020-07-10 15:09:56,078 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:09:56,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/quick_sort_split.i [2020-07-10 15:09:56,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ed4abfb/44da65c91a8641e9a1177068685d9df9/FLAG663adba80 [2020-07-10 15:09:56,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ed4abfb/44da65c91a8641e9a1177068685d9df9 [2020-07-10 15:09:56,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:09:56,322 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:09:56,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:09:56,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:09:56,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:09:56,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:09:56" (1/1) ... [2020-07-10 15:09:56,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5700ce5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:56, skipping insertion in model container [2020-07-10 15:09:56,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:09:56" (1/1) ... [2020-07-10 15:09:56,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:09:56,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:09:56,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:09:56,866 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:09:56,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:09:57,019 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:09:57,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:57 WrapperNode [2020-07-10 15:09:57,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:09:57,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:09:57,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:09:57,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:09:57,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:57" (1/1) ... [2020-07-10 15:09:57,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:57" (1/1) ... [2020-07-10 15:09:57,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:57" (1/1) ... [2020-07-10 15:09:57,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:57" (1/1) ... [2020-07-10 15:09:57,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:57" (1/1) ... [2020-07-10 15:09:57,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:57" (1/1) ... [2020-07-10 15:09:57,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:57" (1/1) ... [2020-07-10 15:09:57,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:09:57,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:09:57,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:09:57,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:09:57,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:09:57,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:09:57,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:09:57,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-10 15:09:57,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-10 15:09:57,163 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_list [2020-07-10 15:09:57,164 INFO L138 BoogieDeclarations]: Found implementation of procedure create_list [2020-07-10 15:09:57,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:09:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:09:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:09:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-10 15:09:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-10 15:09:57,165 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 15:09:57,165 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 15:09:57,165 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 15:09:57,165 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 15:09:57,165 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 15:09:57,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 15:09:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 15:09:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 15:09:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 15:09:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 15:09:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 15:09:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 15:09:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 15:09:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 15:09:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 15:09:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 15:09:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 15:09:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 15:09:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 15:09:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 15:09:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 15:09:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 15:09:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 15:09:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 15:09:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 15:09:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 15:09:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 15:09:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 15:09:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 15:09:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 15:09:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 15:09:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 15:09:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 15:09:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 15:09:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 15:09:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 15:09:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 15:09:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 15:09:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 15:09:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 15:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 15:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 15:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 15:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 15:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 15:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 15:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 15:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 15:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 15:09:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 15:09:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:09:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:09:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 15:09:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:09:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 15:09:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 15:09:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 15:09:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 15:09:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 15:09:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:09:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 15:09:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 15:09:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 15:09:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 15:09:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 15:09:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 15:09:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 15:09:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 15:09:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 15:09:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 15:09:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 15:09:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 15:09:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 15:09:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 15:09:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 15:09:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 15:09:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 15:09:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 15:09:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 15:09:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 15:09:57,176 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 15:09:57,176 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 15:09:57,176 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 15:09:57,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 15:09:57,176 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 15:09:57,176 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 15:09:57,176 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 15:09:57,177 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 15:09:57,177 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 15:09:57,177 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 15:09:57,177 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 15:09:57,177 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 15:09:57,177 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 15:09:57,177 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 15:09:57,178 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 15:09:57,178 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 15:09:57,178 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 15:09:57,178 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 15:09:57,178 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 15:09:57,178 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 15:09:57,178 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 15:09:57,179 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 15:09:57,179 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 15:09:57,179 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_list [2020-07-10 15:09:57,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:09:57,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:09:57,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:09:57,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:09:57,180 INFO L130 BoogieDeclarations]: Found specification of procedure create_list [2020-07-10 15:09:57,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:09:57,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-10 15:09:57,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:09:57,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:09:57,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:09:57,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:09:57,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:09:57,840 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:09:57,841 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 15:09:57,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:09:57 BoogieIcfgContainer [2020-07-10 15:09:57,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:09:57,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:09:57,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:09:57,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:09:57,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:09:56" (1/3) ... [2020-07-10 15:09:57,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670216ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:09:57, skipping insertion in model container [2020-07-10 15:09:57,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:57" (2/3) ... [2020-07-10 15:09:57,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670216ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:09:57, skipping insertion in model container [2020-07-10 15:09:57,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:09:57" (3/3) ... [2020-07-10 15:09:57,865 INFO L109 eAbstractionObserver]: Analyzing ICFG quick_sort_split.i [2020-07-10 15:09:57,878 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:09:57,887 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-07-10 15:09:57,903 INFO L251 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-07-10 15:09:57,942 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:09:57,943 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:09:57,943 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:09:57,943 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:09:57,943 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:09:57,944 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:09:57,944 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:09:57,944 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:09:57,967 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-10 15:09:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:09:57,974 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:57,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:57,976 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:57,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:57,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1851020699, now seen corresponding path program 1 times [2020-07-10 15:09:57,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:57,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109538263] [2020-07-10 15:09:57,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:58,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {49#(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; {39#true} is VALID [2020-07-10 15:09:58,222 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:09:58,222 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #104#return; {39#true} is VALID [2020-07-10 15:09:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:58,273 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call ~#list~0.base, ~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {39#true} is VALID [2020-07-10 15:09:58,274 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume !true; {40#false} is VALID [2020-07-10 15:09:58,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#false} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4);#res.base, #res.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset);havoc ~#list~0.base, ~#list~0.offset; {40#false} is VALID [2020-07-10 15:09:58,275 INFO L280 TraceCheckUtils]: 3: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:09:58,275 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {40#false} {39#true} #98#return; {40#false} is VALID [2020-07-10 15:09:58,277 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:09:58,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#(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; {39#true} is VALID [2020-07-10 15:09:58,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:09:58,278 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #104#return; {39#true} is VALID [2020-07-10 15:09:58,279 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret15 := main(); {39#true} is VALID [2020-07-10 15:09:58,280 INFO L263 TraceCheckUtils]: 5: Hoare triple {39#true} call #t~ret7.base, #t~ret7.offset := create_list(); {50#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:09:58,281 INFO L280 TraceCheckUtils]: 6: Hoare triple {50#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call ~#list~0.base, ~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {39#true} is VALID [2020-07-10 15:09:58,282 INFO L280 TraceCheckUtils]: 7: Hoare triple {39#true} assume !true; {40#false} is VALID [2020-07-10 15:09:58,282 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#false} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4);#res.base, #res.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset);havoc ~#list~0.base, ~#list~0.offset; {40#false} is VALID [2020-07-10 15:09:58,282 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:09:58,283 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #98#return; {40#false} is VALID [2020-07-10 15:09:58,283 INFO L280 TraceCheckUtils]: 11: Hoare triple {40#false} ~list~1.base, ~list~1.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset;~low~0.base, ~low~0.offset := 0, 0;~high~0.base, ~high~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {40#false} is VALID [2020-07-10 15:09:58,283 INFO L280 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2020-07-10 15:09:58,284 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !!(~low~0.base != 0 || ~low~0.offset != 0);call #t~mem11 := read~int(~low~0.base, ~low~0.offset, 4); {40#false} is VALID [2020-07-10 15:09:58,284 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#false} assume !(-1 == #t~mem11);havoc #t~mem11; {40#false} is VALID [2020-07-10 15:09:58,284 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-10 15:09:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:09:58,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109538263] [2020-07-10 15:09:58,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:09:58,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:09:58,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376963592] [2020-07-10 15:09:58,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-07-10 15:09:58,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:58,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:09:58,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:58,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:09:58,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:58,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:09:58,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:09:58,352 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2020-07-10 15:09:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:58,728 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2020-07-10 15:09:58,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:09:58,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-07-10 15:09:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:09:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-10 15:09:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:09:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-10 15:09:58,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2020-07-10 15:09:58,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:58,881 INFO L225 Difference]: With dead ends: 57 [2020-07-10 15:09:58,882 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 15:09:58,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:09:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 15:09:58,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-10 15:09:58,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:58,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-10 15:09:58,945 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 15:09:58,946 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 15:09:58,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:58,952 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-10 15:09:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-10 15:09:58,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:58,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:58,953 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 15:09:58,953 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 15:09:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:58,958 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-10 15:09:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-10 15:09:58,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:58,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:58,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:58,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:09:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2020-07-10 15:09:58,966 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 16 [2020-07-10 15:09:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:58,966 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2020-07-10 15:09:58,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:09:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-10 15:09:58,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:09:58,967 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:58,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:58,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:09:58,968 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:58,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:58,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1239240901, now seen corresponding path program 1 times [2020-07-10 15:09:58,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:58,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130014081] [2020-07-10 15:09:58,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:59,055 INFO L280 TraceCheckUtils]: 0: Hoare triple {242#(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; {230#true} is VALID [2020-07-10 15:09:59,055 INFO L280 TraceCheckUtils]: 1: Hoare triple {230#true} assume true; {230#true} is VALID [2020-07-10 15:09:59,056 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {230#true} {230#true} #104#return; {230#true} is VALID [2020-07-10 15:09:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:59,089 INFO L280 TraceCheckUtils]: 0: Hoare triple {243#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call ~#list~0.base, ~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {230#true} is VALID [2020-07-10 15:09:59,090 INFO L280 TraceCheckUtils]: 1: Hoare triple {230#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {230#true} is VALID [2020-07-10 15:09:59,090 INFO L280 TraceCheckUtils]: 2: Hoare triple {230#true} assume !(0 != #t~nondet4);havoc #t~nondet4; {230#true} is VALID [2020-07-10 15:09:59,090 INFO L280 TraceCheckUtils]: 3: Hoare triple {230#true} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4);#res.base, #res.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset);havoc ~#list~0.base, ~#list~0.offset; {230#true} is VALID [2020-07-10 15:09:59,091 INFO L280 TraceCheckUtils]: 4: Hoare triple {230#true} assume true; {230#true} is VALID [2020-07-10 15:09:59,091 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {230#true} {230#true} #98#return; {230#true} is VALID [2020-07-10 15:09:59,093 INFO L263 TraceCheckUtils]: 0: Hoare triple {230#true} call ULTIMATE.init(); {242#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:09:59,093 INFO L280 TraceCheckUtils]: 1: Hoare triple {242#(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; {230#true} is VALID [2020-07-10 15:09:59,093 INFO L280 TraceCheckUtils]: 2: Hoare triple {230#true} assume true; {230#true} is VALID [2020-07-10 15:09:59,094 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {230#true} {230#true} #104#return; {230#true} is VALID [2020-07-10 15:09:59,094 INFO L263 TraceCheckUtils]: 4: Hoare triple {230#true} call #t~ret15 := main(); {230#true} is VALID [2020-07-10 15:09:59,096 INFO L263 TraceCheckUtils]: 5: Hoare triple {230#true} call #t~ret7.base, #t~ret7.offset := create_list(); {243#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:09:59,096 INFO L280 TraceCheckUtils]: 6: Hoare triple {243#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call ~#list~0.base, ~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {230#true} is VALID [2020-07-10 15:09:59,096 INFO L280 TraceCheckUtils]: 7: Hoare triple {230#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {230#true} is VALID [2020-07-10 15:09:59,097 INFO L280 TraceCheckUtils]: 8: Hoare triple {230#true} assume !(0 != #t~nondet4);havoc #t~nondet4; {230#true} is VALID [2020-07-10 15:09:59,097 INFO L280 TraceCheckUtils]: 9: Hoare triple {230#true} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4);#res.base, #res.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset);havoc ~#list~0.base, ~#list~0.offset; {230#true} is VALID [2020-07-10 15:09:59,097 INFO L280 TraceCheckUtils]: 10: Hoare triple {230#true} assume true; {230#true} is VALID [2020-07-10 15:09:59,098 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {230#true} {230#true} #98#return; {230#true} is VALID [2020-07-10 15:09:59,099 INFO L280 TraceCheckUtils]: 12: Hoare triple {230#true} ~list~1.base, ~list~1.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset;~low~0.base, ~low~0.offset := 0, 0;~high~0.base, ~high~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {241#(and (= 0 main_~low~0.offset) (= 0 main_~low~0.base))} is VALID [2020-07-10 15:09:59,100 INFO L280 TraceCheckUtils]: 13: Hoare triple {241#(and (= 0 main_~low~0.offset) (= 0 main_~low~0.base))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {241#(and (= 0 main_~low~0.offset) (= 0 main_~low~0.base))} is VALID [2020-07-10 15:09:59,101 INFO L280 TraceCheckUtils]: 14: Hoare triple {241#(and (= 0 main_~low~0.offset) (= 0 main_~low~0.base))} assume !!(~low~0.base != 0 || ~low~0.offset != 0);call #t~mem11 := read~int(~low~0.base, ~low~0.offset, 4); {231#false} is VALID [2020-07-10 15:09:59,101 INFO L280 TraceCheckUtils]: 15: Hoare triple {231#false} assume !(-1 == #t~mem11);havoc #t~mem11; {231#false} is VALID [2020-07-10 15:09:59,102 INFO L280 TraceCheckUtils]: 16: Hoare triple {231#false} assume !false; {231#false} is VALID [2020-07-10 15:09:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:09:59,104 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130014081] [2020-07-10 15:09:59,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:09:59,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:09:59,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376017771] [2020-07-10 15:09:59,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-10 15:09:59,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:59,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:09:59,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:59,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:09:59,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:59,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:09:59,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:09:59,131 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 5 states. [2020-07-10 15:09:59,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:59,495 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-07-10 15:09:59,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:09:59,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-10 15:09:59,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:09:59,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-07-10 15:09:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:09:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-07-10 15:09:59,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2020-07-10 15:09:59,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:59,582 INFO L225 Difference]: With dead ends: 38 [2020-07-10 15:09:59,582 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 15:09:59,583 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10 15:09:59,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 15:09:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-10 15:09:59,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:59,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-10 15:09:59,605 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 15:09:59,605 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 15:09:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:59,608 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-07-10 15:09:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-07-10 15:09:59,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:59,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:59,609 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 15:09:59,609 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 15:09:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:59,612 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-07-10 15:09:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-07-10 15:09:59,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:59,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:59,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:59,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 15:09:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-07-10 15:09:59,616 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 17 [2020-07-10 15:09:59,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:59,617 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-07-10 15:09:59,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:09:59,617 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-07-10 15:09:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:09:59,618 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:59,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:59,618 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:09:59,619 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:59,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:59,619 INFO L82 PathProgramCache]: Analyzing trace with hash -238280333, now seen corresponding path program 1 times [2020-07-10 15:09:59,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:59,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273778575] [2020-07-10 15:09:59,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:59,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {403#(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; {391#true} is VALID [2020-07-10 15:09:59,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {391#true} assume true; {391#true} is VALID [2020-07-10 15:09:59,689 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {391#true} {391#true} #104#return; {391#true} is VALID [2020-07-10 15:09:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:59,718 INFO L280 TraceCheckUtils]: 0: Hoare triple {404#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call ~#list~0.base, ~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {391#true} is VALID [2020-07-10 15:09:59,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {391#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {391#true} is VALID [2020-07-10 15:09:59,719 INFO L280 TraceCheckUtils]: 2: Hoare triple {391#true} assume !(0 != #t~nondet4);havoc #t~nondet4; {391#true} is VALID [2020-07-10 15:09:59,720 INFO L280 TraceCheckUtils]: 3: Hoare triple {391#true} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4);#res.base, #res.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset);havoc ~#list~0.base, ~#list~0.offset; {391#true} is VALID [2020-07-10 15:09:59,720 INFO L280 TraceCheckUtils]: 4: Hoare triple {391#true} assume true; {391#true} is VALID [2020-07-10 15:09:59,720 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {391#true} {391#true} #98#return; {391#true} is VALID [2020-07-10 15:09:59,721 INFO L263 TraceCheckUtils]: 0: Hoare triple {391#true} call ULTIMATE.init(); {403#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:09:59,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#(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; {391#true} is VALID [2020-07-10 15:09:59,722 INFO L280 TraceCheckUtils]: 2: Hoare triple {391#true} assume true; {391#true} is VALID [2020-07-10 15:09:59,722 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {391#true} {391#true} #104#return; {391#true} is VALID [2020-07-10 15:09:59,723 INFO L263 TraceCheckUtils]: 4: Hoare triple {391#true} call #t~ret15 := main(); {391#true} is VALID [2020-07-10 15:09:59,724 INFO L263 TraceCheckUtils]: 5: Hoare triple {391#true} call #t~ret7.base, #t~ret7.offset := create_list(); {404#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:09:59,724 INFO L280 TraceCheckUtils]: 6: Hoare triple {404#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call ~#list~0.base, ~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {391#true} is VALID [2020-07-10 15:09:59,725 INFO L280 TraceCheckUtils]: 7: Hoare triple {391#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {391#true} is VALID [2020-07-10 15:09:59,725 INFO L280 TraceCheckUtils]: 8: Hoare triple {391#true} assume !(0 != #t~nondet4);havoc #t~nondet4; {391#true} is VALID [2020-07-10 15:09:59,725 INFO L280 TraceCheckUtils]: 9: Hoare triple {391#true} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4);#res.base, #res.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset);havoc ~#list~0.base, ~#list~0.offset; {391#true} is VALID [2020-07-10 15:09:59,726 INFO L280 TraceCheckUtils]: 10: Hoare triple {391#true} assume true; {391#true} is VALID [2020-07-10 15:09:59,726 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {391#true} {391#true} #98#return; {391#true} is VALID [2020-07-10 15:09:59,727 INFO L280 TraceCheckUtils]: 12: Hoare triple {391#true} ~list~1.base, ~list~1.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset;~low~0.base, ~low~0.offset := 0, 0;~high~0.base, ~high~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {402#(and (= 0 main_~high~0.offset) (= 0 main_~high~0.base))} is VALID [2020-07-10 15:09:59,728 INFO L280 TraceCheckUtils]: 13: Hoare triple {402#(and (= 0 main_~high~0.offset) (= 0 main_~high~0.base))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {402#(and (= 0 main_~high~0.offset) (= 0 main_~high~0.base))} is VALID [2020-07-10 15:09:59,729 INFO L280 TraceCheckUtils]: 14: Hoare triple {402#(and (= 0 main_~high~0.offset) (= 0 main_~high~0.base))} assume !(~low~0.base != 0 || ~low~0.offset != 0); {402#(and (= 0 main_~high~0.offset) (= 0 main_~high~0.base))} is VALID [2020-07-10 15:09:59,730 INFO L280 TraceCheckUtils]: 15: Hoare triple {402#(and (= 0 main_~high~0.offset) (= 0 main_~high~0.base))} assume !!(~high~0.base != 0 || ~high~0.offset != 0);call #t~mem13 := read~int(~high~0.base, ~high~0.offset, 4); {392#false} is VALID [2020-07-10 15:09:59,730 INFO L280 TraceCheckUtils]: 16: Hoare triple {392#false} assume !(1 == #t~mem13);havoc #t~mem13; {392#false} is VALID [2020-07-10 15:09:59,731 INFO L280 TraceCheckUtils]: 17: Hoare triple {392#false} assume !false; {392#false} is VALID [2020-07-10 15:09:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:09:59,732 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273778575] [2020-07-10 15:09:59,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:09:59,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:09:59,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365594530] [2020-07-10 15:09:59,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 15:09:59,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:59,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:09:59,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:59,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:09:59,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:59,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:09:59,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:09:59,757 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 5 states. [2020-07-10 15:10:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:10:00,045 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-07-10 15:10:00,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:10:00,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 15:10:00,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:10:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:10:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-10 15:10:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:10:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-10 15:10:00,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2020-07-10 15:10:00,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:10:00,108 INFO L225 Difference]: With dead ends: 29 [2020-07-10 15:10:00,108 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:10:00,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10 15:10:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:10:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:10:00,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:10:00,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:10:00,109 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:10:00,110 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:10:00,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:10:00,110 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:10:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:10:00,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:10:00,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:10:00,110 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:10:00,110 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:10:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:10:00,111 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:10:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:10:00,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:10:00,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:10:00,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:10:00,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:10:00,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:10:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:10:00,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-07-10 15:10:00,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:10:00,112 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:10:00,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:10:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:10:00,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:10:00,112 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:10:00,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:10:00,287 INFO L271 CegarLoopResult]: At program point L576(line 576) the Hoare annotation is: true [2020-07-10 15:10:00,287 INFO L271 CegarLoopResult]: At program point L576-1(lines 571 577) the Hoare annotation is: true [2020-07-10 15:10:00,287 INFO L271 CegarLoopResult]: At program point L574(line 574) the Hoare annotation is: true [2020-07-10 15:10:00,287 INFO L268 CegarLoopResult]: For program point L573(lines 573 576) no Hoare annotation was computed. [2020-07-10 15:10:00,287 INFO L268 CegarLoopResult]: For program point L571-1(lines 571 577) no Hoare annotation was computed. [2020-07-10 15:10:00,287 INFO L268 CegarLoopResult]: For program point L571-3(lines 571 577) no Hoare annotation was computed. [2020-07-10 15:10:00,287 INFO L268 CegarLoopResult]: For program point create_listEXIT(lines 569 579) no Hoare annotation was computed. [2020-07-10 15:10:00,288 INFO L264 CegarLoopResult]: At program point create_listENTRY(lines 569 579) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 15:10:00,288 INFO L268 CegarLoopResult]: For program point create_listFINAL(lines 569 579) no Hoare annotation was computed. [2020-07-10 15:10:00,288 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:10:00,288 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 15:10:00,288 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:10:00,288 INFO L268 CegarLoopResult]: For program point __bswap_32ENTRY(lines 64 68) no Hoare annotation was computed. [2020-07-10 15:10:00,288 INFO L268 CegarLoopResult]: For program point __bswap_32FINAL(lines 64 68) no Hoare annotation was computed. [2020-07-10 15:10:00,289 INFO L268 CegarLoopResult]: For program point __bswap_32EXIT(lines 64 68) no Hoare annotation was computed. [2020-07-10 15:10:00,289 INFO L268 CegarLoopResult]: For program point __bswap_64ENTRY(lines 69 73) no Hoare annotation was computed. [2020-07-10 15:10:00,289 INFO L268 CegarLoopResult]: For program point __bswap_64FINAL(lines 69 73) no Hoare annotation was computed. [2020-07-10 15:10:00,289 INFO L268 CegarLoopResult]: For program point __bswap_64EXIT(lines 69 73) no Hoare annotation was computed. [2020-07-10 15:10:00,289 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:10:00,289 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:10:00,289 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:10:00,289 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:10:00,289 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 580 602) no Hoare annotation was computed. [2020-07-10 15:10:00,289 INFO L268 CegarLoopResult]: For program point L597-1(lines 580 602) no Hoare annotation was computed. [2020-07-10 15:10:00,289 INFO L268 CegarLoopResult]: For program point L597-2(lines 580 602) no Hoare annotation was computed. [2020-07-10 15:10:00,290 INFO L268 CegarLoopResult]: For program point L593(lines 593 594) no Hoare annotation was computed. [2020-07-10 15:10:00,290 INFO L268 CegarLoopResult]: For program point L593-2(lines 593 594) no Hoare annotation was computed. [2020-07-10 15:10:00,290 INFO L264 CegarLoopResult]: At program point L585-2(lines 585 591) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-10 15:10:00,290 INFO L268 CegarLoopResult]: For program point L581(line 581) no Hoare annotation was computed. [2020-07-10 15:10:00,290 INFO L268 CegarLoopResult]: For program point L598(lines 598 599) no Hoare annotation was computed. [2020-07-10 15:10:00,290 INFO L268 CegarLoopResult]: For program point L598-2(lines 598 599) no Hoare annotation was computed. [2020-07-10 15:10:00,290 INFO L268 CegarLoopResult]: For program point L594(line 594) no Hoare annotation was computed. [2020-07-10 15:10:00,290 INFO L268 CegarLoopResult]: For program point L586(line 586) no Hoare annotation was computed. [2020-07-10 15:10:00,290 INFO L268 CegarLoopResult]: For program point L586-2(line 586) no Hoare annotation was computed. [2020-07-10 15:10:00,290 INFO L268 CegarLoopResult]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2020-07-10 15:10:00,290 INFO L268 CegarLoopResult]: For program point L599(line 599) no Hoare annotation was computed. [2020-07-10 15:10:00,291 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 594) no Hoare annotation was computed. [2020-07-10 15:10:00,291 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 580 602) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 15:10:00,291 INFO L268 CegarLoopResult]: For program point L592-1(lines 580 602) no Hoare annotation was computed. [2020-07-10 15:10:00,291 INFO L268 CegarLoopResult]: For program point append_to_listEXIT(lines 562 568) no Hoare annotation was computed. [2020-07-10 15:10:00,291 INFO L264 CegarLoopResult]: At program point append_to_listENTRY(lines 562 568) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 15:10:00,291 INFO L268 CegarLoopResult]: For program point append_to_listFINAL(lines 562 568) no Hoare annotation was computed. [2020-07-10 15:10:00,295 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:10:00,295 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-10 15:10:00,296 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-10 15:10:00,296 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2020-07-10 15:10:00,297 WARN L170 areAnnotationChecker]: append_to_listFINAL has no Hoare annotation [2020-07-10 15:10:00,297 WARN L170 areAnnotationChecker]: L571-3 has no Hoare annotation [2020-07-10 15:10:00,297 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2020-07-10 15:10:00,297 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:10:00,297 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-10 15:10:00,297 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:10:00,301 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-10 15:10:00,301 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2020-07-10 15:10:00,302 WARN L170 areAnnotationChecker]: append_to_listFINAL has no Hoare annotation [2020-07-10 15:10:00,302 WARN L170 areAnnotationChecker]: L571-3 has no Hoare annotation [2020-07-10 15:10:00,302 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2020-07-10 15:10:00,302 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2020-07-10 15:10:00,302 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:10:00,302 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:10:00,302 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2020-07-10 15:10:00,302 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2020-07-10 15:10:00,303 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2020-07-10 15:10:00,303 WARN L170 areAnnotationChecker]: append_to_listEXIT has no Hoare annotation [2020-07-10 15:10:00,303 WARN L170 areAnnotationChecker]: append_to_listEXIT has no Hoare annotation [2020-07-10 15:10:00,303 WARN L170 areAnnotationChecker]: create_listFINAL has no Hoare annotation [2020-07-10 15:10:00,303 WARN L170 areAnnotationChecker]: L573 has no Hoare annotation [2020-07-10 15:10:00,303 WARN L170 areAnnotationChecker]: L573 has no Hoare annotation [2020-07-10 15:10:00,303 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2020-07-10 15:10:00,304 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2020-07-10 15:10:00,304 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2020-07-10 15:10:00,304 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2020-07-10 15:10:00,304 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2020-07-10 15:10:00,304 WARN L170 areAnnotationChecker]: create_listEXIT has no Hoare annotation [2020-07-10 15:10:00,310 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2020-07-10 15:10:00,311 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2020-07-10 15:10:00,311 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2020-07-10 15:10:00,311 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2020-07-10 15:10:00,311 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2020-07-10 15:10:00,311 WARN L170 areAnnotationChecker]: L586-2 has no Hoare annotation [2020-07-10 15:10:00,311 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2020-07-10 15:10:00,311 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2020-07-10 15:10:00,312 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2020-07-10 15:10:00,312 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-10 15:10:00,312 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-10 15:10:00,312 WARN L170 areAnnotationChecker]: L593-2 has no Hoare annotation [2020-07-10 15:10:00,312 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:10:00,312 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2020-07-10 15:10:00,312 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2020-07-10 15:10:00,312 WARN L170 areAnnotationChecker]: L598-2 has no Hoare annotation [2020-07-10 15:10:00,313 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:10:00,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:10:00 BoogieIcfgContainer [2020-07-10 15:10:00,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:10:00,329 INFO L168 Benchmark]: Toolchain (without parser) took 4005.67 ms. Allocated memory was 141.6 MB in the beginning and 245.4 MB in the end (delta: 103.8 MB). Free memory was 103.9 MB in the beginning and 198.8 MB in the end (delta: -94.8 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:10:00,330 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 141.6 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:10:00,331 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.64 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 103.7 MB in the beginning and 170.7 MB in the end (delta: -66.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:10:00,332 INFO L168 Benchmark]: Boogie Preprocessor took 76.81 ms. Allocated memory is still 205.0 MB. Free memory was 170.7 MB in the beginning and 166.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:10:00,332 INFO L168 Benchmark]: RCFGBuilder took 749.59 ms. Allocated memory is still 205.0 MB. Free memory was 166.8 MB in the beginning and 110.4 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:10:00,340 INFO L168 Benchmark]: TraceAbstraction took 2475.02 ms. Allocated memory was 205.0 MB in the beginning and 245.4 MB in the end (delta: 40.4 MB). Free memory was 109.8 MB in the beginning and 198.8 MB in the end (delta: -89.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:10:00,346 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.51 ms. Allocated memory is still 141.6 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 696.64 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 103.7 MB in the beginning and 170.7 MB in the end (delta: -66.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.81 ms. Allocated memory is still 205.0 MB. Free memory was 170.7 MB in the beginning and 166.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 749.59 ms. Allocated memory is still 205.0 MB. Free memory was 166.8 MB in the beginning and 110.4 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2475.02 ms. Allocated memory was 205.0 MB in the beginning and 245.4 MB in the end (delta: 40.4 MB). Free memory was 109.8 MB in the beginning and 198.8 MB in the end (delta: -89.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 594]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 599]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((0 == high && 0 == low) && 0 == high) && 0 == low - InvariantResult [Line: 571]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 42 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 91 SDtfs, 14 SDslu, 105 SDs, 0 SdLazy, 125 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 11 PreInvPairs, 12 NumberOfFragments, 76 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 2420 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 correct! Received shutdown request...