/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/list-properties/list_search-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:27:53,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:27:53,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:27:53,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:27:53,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:27:53,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:27:53,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:27:53,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:27:53,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:27:53,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:27:53,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:27:53,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:27:53,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:27:53,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:27:53,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:27:53,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:27:53,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:27:53,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:27:53,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:27:53,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:27:53,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:27:53,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:27:53,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:27:53,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:27:54,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:27:54,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:27:54,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:27:54,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:27:54,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:27:54,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:27:54,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:27:54,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:27:54,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:27:54,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:27:54,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:27:54,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:27:54,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:27:54,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:27:54,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:27:54,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:27:54,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:27:54,019 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:27:54,058 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:27:54,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:27:54,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:27:54,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:27:54,060 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:27:54,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:27:54,060 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:27:54,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:27:54,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:27:54,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:27:54,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:27:54,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:27:54,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:27:54,062 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:27:54,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:27:54,062 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:27:54,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:27:54,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:27:54,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:27:54,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:27:54,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:27:54,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:27:54,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:27:54,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:27:54,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:27:54,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:27:54,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:27:54,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:27:54,065 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:27:54,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:27:54,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:27:54,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:27:54,358 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:27:54,359 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:27:54,360 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:27:54,360 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_search-1.i [2020-07-17 22:27:54,429 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94a6862c/a736cedd2e8f4f99b98147f757e21b79/FLAG5650594be [2020-07-17 22:27:55,010 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:27:55,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search-1.i [2020-07-17 22:27:55,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94a6862c/a736cedd2e8f4f99b98147f757e21b79/FLAG5650594be [2020-07-17 22:27:55,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94a6862c/a736cedd2e8f4f99b98147f757e21b79 [2020-07-17 22:27:55,327 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:27:55,330 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:27:55,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:27:55,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:27:55,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:27:55,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:27:55" (1/1) ... [2020-07-17 22:27:55,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c2538e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:55, skipping insertion in model container [2020-07-17 22:27:55,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:27:55" (1/1) ... [2020-07-17 22:27:55,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:27:55,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:27:55,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:27:55,865 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:27:55,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:27:56,005 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:27:56,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:56 WrapperNode [2020-07-17 22:27:56,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:27:56,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:27:56,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:27:56,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:27:56,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:56" (1/1) ... [2020-07-17 22:27:56,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:56" (1/1) ... [2020-07-17 22:27:56,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:56" (1/1) ... [2020-07-17 22:27:56,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:56" (1/1) ... [2020-07-17 22:27:56,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:56" (1/1) ... [2020-07-17 22:27:56,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:56" (1/1) ... [2020-07-17 22:27:56,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:56" (1/1) ... [2020-07-17 22:27:56,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:27:56,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:27:56,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:27:56,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:27:56,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:56" (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:27:56,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:27:56,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:27:56,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:27:56,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-17 22:27:56,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-17 22:27:56,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-17 22:27:56,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-17 22:27:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-17 22:27:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2020-07-17 22:27:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2020-07-17 22:27:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:27:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:27:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:27:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-17 22:27:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-17 22:27:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-17 22:27:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-17 22:27:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-17 22:27:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-17 22:27:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-17 22:27:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-17 22:27:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-17 22:27:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-17 22:27:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-17 22:27:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-17 22:27:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-17 22:27:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-17 22:27:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-17 22:27:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-17 22:27:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-17 22:27:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-17 22:27:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-17 22:27:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-17 22:27:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-17 22:27:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-17 22:27:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-17 22:27:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-17 22:27:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-17 22:27:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-17 22:27:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-17 22:27:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-17 22:27:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-17 22:27:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-17 22:27:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-17 22:27:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-17 22:27:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-17 22:27:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-17 22:27:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-17 22:27:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-17 22:27:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-17 22:27:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-17 22:27:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-17 22:27:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-17 22:27:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-17 22:27:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-17 22:27:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-17 22:27:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-17 22:27:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-17 22:27:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-17 22:27:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-17 22:27:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-17 22:27:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-17 22:27:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-17 22:27:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-17 22:27:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-17 22:27:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-17 22:27:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-17 22:27:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-17 22:27:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:27:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 22:27:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-17 22:27:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 22:27:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-17 22:27:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-17 22:27:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-17 22:27:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-17 22:27:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:27:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-17 22:27:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-17 22:27:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-17 22:27:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-17 22:27:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-17 22:27:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-17 22:27:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-17 22:27:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-17 22:27:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-17 22:27:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-17 22:27:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-17 22:27:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-17 22:27:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-17 22:27:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-17 22:27:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-17 22:27:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-17 22:27:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-17 22:27:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-17 22:27:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-17 22:27:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-17 22:27:56,189 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-17 22:27:56,189 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-17 22:27:56,189 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-17 22:27:56,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-17 22:27:56,189 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-17 22:27:56,189 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-17 22:27:56,189 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-17 22:27:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-17 22:27:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-17 22:27:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-17 22:27:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-17 22:27:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-17 22:27:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-17 22:27:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-17 22:27:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-17 22:27:56,191 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-17 22:27:56,191 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-17 22:27:56,191 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-17 22:27:56,191 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-17 22:27:56,192 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-17 22:27:56,192 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-17 22:27:56,193 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-17 22:27:56,193 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-17 22:27:56,193 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2020-07-17 22:27:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:27:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 22:27:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2020-07-17 22:27:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:27:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:27:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 22:27:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:27:56,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:27:56,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:27:56,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:27:56,855 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:27:56,855 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-17 22:27:56,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:27:56 BoogieIcfgContainer [2020-07-17 22:27:56,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:27:56,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:27:56,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:27:56,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:27:56,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:27:55" (1/3) ... [2020-07-17 22:27:56,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4ac86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:27:56, skipping insertion in model container [2020-07-17 22:27:56,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:56" (2/3) ... [2020-07-17 22:27:56,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4ac86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:27:56, skipping insertion in model container [2020-07-17 22:27:56,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:27:56" (3/3) ... [2020-07-17 22:27:56,886 INFO L109 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2020-07-17 22:27:56,897 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:27:56,907 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:27:56,923 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:27:56,952 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:27:56,953 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:27:56,953 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:27:56,953 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:27:56,953 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:27:56,954 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:27:56,954 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:27:56,954 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:27:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2020-07-17 22:27:56,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-17 22:27:56,986 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:56,987 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 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:27:56,988 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:56,995 INFO L82 PathProgramCache]: Analyzing trace with hash -125905961, now seen corresponding path program 1 times [2020-07-17 22:27:57,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:57,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530289780] [2020-07-17 22:27:57,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:57,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {75#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~head~0.base, ~head~0.offset := 0, 0; {44#true} is VALID [2020-07-17 22:27:57,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:27:57,371 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {44#true} {44#true} #96#return; {44#true} is VALID [2020-07-17 22:27:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:57,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {77#(not (= 0 insert_list_~l.base))} is VALID [2020-07-17 22:27:57,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {77#(not (= 0 insert_list_~l.base))} is VALID [2020-07-17 22:27:57,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {77#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {54#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:57,486 INFO L280 TraceCheckUtils]: 3: Hoare triple {54#(not (= 0 ~head~0.base))} assume true; {54#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:57,488 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {54#(not (= 0 ~head~0.base))} {44#true} #84#return; {54#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:57,539 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {78#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-17 22:27:57,541 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {79#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:57,542 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {79#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:57,542 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#(= 0 |old(~head~0.base)|)} assume true; {79#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:57,544 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {79#(= 0 |old(~head~0.base)|)} {54#(not (= 0 ~head~0.base))} #86#return; {45#false} is VALID [2020-07-17 22:27:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:57,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,569 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID [2020-07-17 22:27:57,569 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:27:57,570 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#true} {45#false} #88#return; {45#false} is VALID [2020-07-17 22:27:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:57,614 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,615 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,615 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID [2020-07-17 22:27:57,615 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:27:57,616 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#true} {45#false} #90#return; {45#false} is VALID [2020-07-17 22:27:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:57,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {44#true} is VALID [2020-07-17 22:27:57,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} assume !true; {45#false} is VALID [2020-07-17 22:27:57,645 INFO L280 TraceCheckUtils]: 2: Hoare triple {45#false} #res.base, #res.offset := ~l.base, ~l.offset; {45#false} is VALID [2020-07-17 22:27:57,646 INFO L280 TraceCheckUtils]: 3: Hoare triple {45#false} assume true; {45#false} is VALID [2020-07-17 22:27:57,646 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {45#false} {45#false} #92#return; {45#false} is VALID [2020-07-17 22:27:57,648 INFO L263 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {75#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:27:57,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {75#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~head~0.base, ~head~0.offset := 0, 0; {44#true} is VALID [2020-07-17 22:27:57,648 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:27:57,648 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {44#true} {44#true} #96#return; {44#true} is VALID [2020-07-17 22:27:57,649 INFO L263 TraceCheckUtils]: 4: Hoare triple {44#true} call #t~ret13 := main(); {44#true} is VALID [2020-07-17 22:27:57,649 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {44#true} is VALID [2020-07-17 22:27:57,651 INFO L263 TraceCheckUtils]: 6: Hoare triple {44#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {76#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#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-17 22:27:57,653 INFO L280 TraceCheckUtils]: 7: Hoare triple {76#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {77#(not (= 0 insert_list_~l.base))} is VALID [2020-07-17 22:27:57,654 INFO L280 TraceCheckUtils]: 8: Hoare triple {77#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {77#(not (= 0 insert_list_~l.base))} is VALID [2020-07-17 22:27:57,654 INFO L280 TraceCheckUtils]: 9: Hoare triple {77#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {54#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:57,655 INFO L280 TraceCheckUtils]: 10: Hoare triple {54#(not (= 0 ~head~0.base))} assume true; {54#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:57,656 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {54#(not (= 0 ~head~0.base))} {44#true} #84#return; {54#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:57,658 INFO L280 TraceCheckUtils]: 12: Hoare triple {54#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {54#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:57,660 INFO L263 TraceCheckUtils]: 13: Hoare triple {54#(not (= 0 ~head~0.base))} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {76#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#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-17 22:27:57,663 INFO L280 TraceCheckUtils]: 14: Hoare triple {76#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {78#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-17 22:27:57,665 INFO L280 TraceCheckUtils]: 15: Hoare triple {78#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {79#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:57,666 INFO L280 TraceCheckUtils]: 16: Hoare triple {79#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {79#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:57,666 INFO L280 TraceCheckUtils]: 17: Hoare triple {79#(= 0 |old(~head~0.base)|)} assume true; {79#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:57,668 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {79#(= 0 |old(~head~0.base)|)} {54#(not (= 0 ~head~0.base))} #86#return; {45#false} is VALID [2020-07-17 22:27:57,668 INFO L280 TraceCheckUtils]: 19: Hoare triple {45#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {45#false} is VALID [2020-07-17 22:27:57,668 INFO L263 TraceCheckUtils]: 20: Hoare triple {45#false} call #t~ret8 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {76#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#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-17 22:27:57,669 INFO L280 TraceCheckUtils]: 21: Hoare triple {76#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,669 INFO L280 TraceCheckUtils]: 22: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,669 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID [2020-07-17 22:27:57,670 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:27:57,670 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {44#true} {45#false} #88#return; {45#false} is VALID [2020-07-17 22:27:57,670 INFO L280 TraceCheckUtils]: 26: Hoare triple {45#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;havoc #t~ret8; {45#false} is VALID [2020-07-17 22:27:57,671 INFO L263 TraceCheckUtils]: 27: Hoare triple {45#false} call #t~ret9 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {76#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#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-17 22:27:57,671 INFO L280 TraceCheckUtils]: 28: Hoare triple {76#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,674 INFO L280 TraceCheckUtils]: 29: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,675 INFO L280 TraceCheckUtils]: 30: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID [2020-07-17 22:27:57,675 INFO L280 TraceCheckUtils]: 31: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:27:57,675 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {44#true} {45#false} #90#return; {45#false} is VALID [2020-07-17 22:27:57,676 INFO L280 TraceCheckUtils]: 33: Hoare triple {45#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;havoc #t~ret9; {45#false} is VALID [2020-07-17 22:27:57,678 INFO L263 TraceCheckUtils]: 34: Hoare triple {45#false} call #t~ret10.base, #t~ret10.offset := search_list(~head~0.base, ~head~0.offset, 2); {44#true} is VALID [2020-07-17 22:27:57,679 INFO L280 TraceCheckUtils]: 35: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {44#true} is VALID [2020-07-17 22:27:57,680 INFO L280 TraceCheckUtils]: 36: Hoare triple {44#true} assume !true; {45#false} is VALID [2020-07-17 22:27:57,680 INFO L280 TraceCheckUtils]: 37: Hoare triple {45#false} #res.base, #res.offset := ~l.base, ~l.offset; {45#false} is VALID [2020-07-17 22:27:57,680 INFO L280 TraceCheckUtils]: 38: Hoare triple {45#false} assume true; {45#false} is VALID [2020-07-17 22:27:57,681 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {45#false} {45#false} #92#return; {45#false} is VALID [2020-07-17 22:27:57,681 INFO L280 TraceCheckUtils]: 40: Hoare triple {45#false} ~temp~0.base, ~temp~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset;call #t~mem11 := read~int(~temp~0.base, ~temp~0.offset, 4); {45#false} is VALID [2020-07-17 22:27:57,681 INFO L263 TraceCheckUtils]: 41: Hoare triple {45#false} call __VERIFIER_assert((if 1 == #t~mem11 then 1 else 0)); {45#false} is VALID [2020-07-17 22:27:57,682 INFO L280 TraceCheckUtils]: 42: Hoare triple {45#false} ~cond := #in~cond; {45#false} is VALID [2020-07-17 22:27:57,682 INFO L280 TraceCheckUtils]: 43: Hoare triple {45#false} assume 0 == ~cond; {45#false} is VALID [2020-07-17 22:27:57,682 INFO L280 TraceCheckUtils]: 44: Hoare triple {45#false} assume !false; {45#false} is VALID [2020-07-17 22:27:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-17 22:27:57,697 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530289780] [2020-07-17 22:27:57,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495310540] [2020-07-17 22:27:57,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:57,890 INFO L264 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-17 22:27:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:57,930 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:27:57,983 INFO L263 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {44#true} is VALID [2020-07-17 22:27:57,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~head~0.base, ~head~0.offset := 0, 0; {44#true} is VALID [2020-07-17 22:27:57,983 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:27:57,984 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {44#true} {44#true} #96#return; {44#true} is VALID [2020-07-17 22:27:57,984 INFO L263 TraceCheckUtils]: 4: Hoare triple {44#true} call #t~ret13 := main(); {44#true} is VALID [2020-07-17 22:27:57,984 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {44#true} is VALID [2020-07-17 22:27:57,985 INFO L263 TraceCheckUtils]: 6: Hoare triple {44#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {44#true} is VALID [2020-07-17 22:27:57,985 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,985 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,986 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID [2020-07-17 22:27:57,986 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:27:57,986 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {44#true} {44#true} #84#return; {44#true} is VALID [2020-07-17 22:27:57,986 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {44#true} is VALID [2020-07-17 22:27:57,987 INFO L263 TraceCheckUtils]: 13: Hoare triple {44#true} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {44#true} is VALID [2020-07-17 22:27:57,987 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,987 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,988 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID [2020-07-17 22:27:57,988 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:27:57,988 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {44#true} {44#true} #86#return; {44#true} is VALID [2020-07-17 22:27:57,988 INFO L280 TraceCheckUtils]: 19: Hoare triple {44#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {44#true} is VALID [2020-07-17 22:27:57,989 INFO L263 TraceCheckUtils]: 20: Hoare triple {44#true} call #t~ret8 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {44#true} is VALID [2020-07-17 22:27:57,989 INFO L280 TraceCheckUtils]: 21: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,989 INFO L280 TraceCheckUtils]: 22: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,990 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID [2020-07-17 22:27:57,990 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:27:57,990 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {44#true} {44#true} #88#return; {44#true} is VALID [2020-07-17 22:27:57,990 INFO L280 TraceCheckUtils]: 26: Hoare triple {44#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;havoc #t~ret8; {44#true} is VALID [2020-07-17 22:27:57,991 INFO L263 TraceCheckUtils]: 27: Hoare triple {44#true} call #t~ret9 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {44#true} is VALID [2020-07-17 22:27:57,991 INFO L280 TraceCheckUtils]: 28: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,991 INFO L280 TraceCheckUtils]: 29: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID [2020-07-17 22:27:57,992 INFO L280 TraceCheckUtils]: 30: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID [2020-07-17 22:27:57,992 INFO L280 TraceCheckUtils]: 31: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:27:57,992 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {44#true} {44#true} #90#return; {44#true} is VALID [2020-07-17 22:27:57,992 INFO L280 TraceCheckUtils]: 33: Hoare triple {44#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;havoc #t~ret9; {44#true} is VALID [2020-07-17 22:27:57,993 INFO L263 TraceCheckUtils]: 34: Hoare triple {44#true} call #t~ret10.base, #t~ret10.offset := search_list(~head~0.base, ~head~0.offset, 2); {44#true} is VALID [2020-07-17 22:27:57,993 INFO L280 TraceCheckUtils]: 35: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {44#true} is VALID [2020-07-17 22:27:57,994 INFO L280 TraceCheckUtils]: 36: Hoare triple {44#true} assume !true; {45#false} is VALID [2020-07-17 22:27:57,995 INFO L280 TraceCheckUtils]: 37: Hoare triple {45#false} #res.base, #res.offset := ~l.base, ~l.offset; {45#false} is VALID [2020-07-17 22:27:57,995 INFO L280 TraceCheckUtils]: 38: Hoare triple {45#false} assume true; {45#false} is VALID [2020-07-17 22:27:57,995 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {45#false} {44#true} #92#return; {45#false} is VALID [2020-07-17 22:27:57,995 INFO L280 TraceCheckUtils]: 40: Hoare triple {45#false} ~temp~0.base, ~temp~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset;call #t~mem11 := read~int(~temp~0.base, ~temp~0.offset, 4); {45#false} is VALID [2020-07-17 22:27:57,996 INFO L263 TraceCheckUtils]: 41: Hoare triple {45#false} call __VERIFIER_assert((if 1 == #t~mem11 then 1 else 0)); {45#false} is VALID [2020-07-17 22:27:57,996 INFO L280 TraceCheckUtils]: 42: Hoare triple {45#false} ~cond := #in~cond; {45#false} is VALID [2020-07-17 22:27:57,996 INFO L280 TraceCheckUtils]: 43: Hoare triple {45#false} assume 0 == ~cond; {45#false} is VALID [2020-07-17 22:27:57,997 INFO L280 TraceCheckUtils]: 44: Hoare triple {45#false} assume !false; {45#false} is VALID [2020-07-17 22:27:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-17 22:27:58,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:27:58,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2020-07-17 22:27:58,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180194542] [2020-07-17 22:27:58,011 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45 [2020-07-17 22:27:58,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:58,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:27:58,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:58,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:27:58,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:58,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:27:58,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:27:58,089 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2020-07-17 22:27:58,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:58,189 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2020-07-17 22:27:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:27:58,190 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45 [2020-07-17 22:27:58,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:27:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2020-07-17 22:27:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:27:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2020-07-17 22:27:58,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2020-07-17 22:27:58,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:58,350 INFO L225 Difference]: With dead ends: 58 [2020-07-17 22:27:58,351 INFO L226 Difference]: Without dead ends: 33 [2020-07-17 22:27:58,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:27:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-17 22:27:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-17 22:27:58,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:58,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-17 22:27:58,402 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-17 22:27:58,402 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-17 22:27:58,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:58,408 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-17 22:27:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-17 22:27:58,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:58,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:58,410 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-17 22:27:58,410 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-17 22:27:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:58,415 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-17 22:27:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-17 22:27:58,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:58,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:58,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:58,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:27:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2020-07-17 22:27:58,422 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 45 [2020-07-17 22:27:58,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:58,423 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2020-07-17 22:27:58,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:27:58,423 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-17 22:27:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-17 22:27:58,425 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:58,425 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 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:27:58,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-17 22:27:58,640 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:58,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1842115760, now seen corresponding path program 1 times [2020-07-17 22:27:58,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:58,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174244120] [2020-07-17 22:27:58,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:58,786 INFO L280 TraceCheckUtils]: 0: Hoare triple {436#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~head~0.base, ~head~0.offset := 0, 0; {403#true} is VALID [2020-07-17 22:27:58,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-17 22:27:58,787 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {403#true} {403#true} #96#return; {403#true} is VALID [2020-07-17 22:27:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:58,845 INFO L280 TraceCheckUtils]: 0: Hoare triple {437#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {438#(not (= 0 insert_list_~l.base))} is VALID [2020-07-17 22:27:58,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {438#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {438#(not (= 0 insert_list_~l.base))} is VALID [2020-07-17 22:27:58,848 INFO L280 TraceCheckUtils]: 2: Hoare triple {438#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {413#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:58,849 INFO L280 TraceCheckUtils]: 3: Hoare triple {413#(not (= 0 ~head~0.base))} assume true; {413#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:58,850 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {413#(not (= 0 ~head~0.base))} {403#true} #84#return; {413#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:58,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {437#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {439#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-17 22:27:58,892 INFO L280 TraceCheckUtils]: 1: Hoare triple {439#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {440#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:58,893 INFO L280 TraceCheckUtils]: 2: Hoare triple {440#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {440#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:58,894 INFO L280 TraceCheckUtils]: 3: Hoare triple {440#(= 0 |old(~head~0.base)|)} assume true; {440#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:58,895 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {440#(= 0 |old(~head~0.base)|)} {413#(not (= 0 ~head~0.base))} #86#return; {404#false} is VALID [2020-07-17 22:27:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:58,905 INFO L280 TraceCheckUtils]: 0: Hoare triple {437#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {403#true} is VALID [2020-07-17 22:27:58,906 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {403#true} is VALID [2020-07-17 22:27:58,906 INFO L280 TraceCheckUtils]: 2: Hoare triple {403#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {403#true} is VALID [2020-07-17 22:27:58,906 INFO L280 TraceCheckUtils]: 3: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-17 22:27:58,906 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {403#true} {404#false} #88#return; {404#false} is VALID [2020-07-17 22:27:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:58,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {437#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {403#true} is VALID [2020-07-17 22:27:58,917 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {403#true} is VALID [2020-07-17 22:27:58,917 INFO L280 TraceCheckUtils]: 2: Hoare triple {403#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {403#true} is VALID [2020-07-17 22:27:58,917 INFO L280 TraceCheckUtils]: 3: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-17 22:27:58,917 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {403#true} {404#false} #90#return; {404#false} is VALID [2020-07-17 22:27:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:58,925 INFO L280 TraceCheckUtils]: 0: Hoare triple {403#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {403#true} is VALID [2020-07-17 22:27:58,925 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} #t~short3 := ~l.base != 0 || ~l.offset != 0; {403#true} is VALID [2020-07-17 22:27:58,926 INFO L280 TraceCheckUtils]: 2: Hoare triple {403#true} assume #t~short3;call #t~mem2 := read~int(~l.base, ~l.offset, 4);#t~short3 := #t~mem2 != ~k; {403#true} is VALID [2020-07-17 22:27:58,926 INFO L280 TraceCheckUtils]: 3: Hoare triple {403#true} assume !#t~short3;havoc #t~mem2;havoc #t~short3; {403#true} is VALID [2020-07-17 22:27:58,926 INFO L280 TraceCheckUtils]: 4: Hoare triple {403#true} #res.base, #res.offset := ~l.base, ~l.offset; {403#true} is VALID [2020-07-17 22:27:58,926 INFO L280 TraceCheckUtils]: 5: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-17 22:27:58,927 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {403#true} {404#false} #92#return; {404#false} is VALID [2020-07-17 22:27:58,928 INFO L263 TraceCheckUtils]: 0: Hoare triple {403#true} call ULTIMATE.init(); {436#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:27:58,928 INFO L280 TraceCheckUtils]: 1: Hoare triple {436#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~head~0.base, ~head~0.offset := 0, 0; {403#true} is VALID [2020-07-17 22:27:58,929 INFO L280 TraceCheckUtils]: 2: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-17 22:27:58,929 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {403#true} {403#true} #96#return; {403#true} is VALID [2020-07-17 22:27:58,929 INFO L263 TraceCheckUtils]: 4: Hoare triple {403#true} call #t~ret13 := main(); {403#true} is VALID [2020-07-17 22:27:58,930 INFO L280 TraceCheckUtils]: 5: Hoare triple {403#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {403#true} is VALID [2020-07-17 22:27:58,931 INFO L263 TraceCheckUtils]: 6: Hoare triple {403#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {437#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#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-17 22:27:58,933 INFO L280 TraceCheckUtils]: 7: Hoare triple {437#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {438#(not (= 0 insert_list_~l.base))} is VALID [2020-07-17 22:27:58,933 INFO L280 TraceCheckUtils]: 8: Hoare triple {438#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {438#(not (= 0 insert_list_~l.base))} is VALID [2020-07-17 22:27:58,934 INFO L280 TraceCheckUtils]: 9: Hoare triple {438#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {413#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:58,935 INFO L280 TraceCheckUtils]: 10: Hoare triple {413#(not (= 0 ~head~0.base))} assume true; {413#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:58,936 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {413#(not (= 0 ~head~0.base))} {403#true} #84#return; {413#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:58,937 INFO L280 TraceCheckUtils]: 12: Hoare triple {413#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {413#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:58,939 INFO L263 TraceCheckUtils]: 13: Hoare triple {413#(not (= 0 ~head~0.base))} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {437#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#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-17 22:27:58,940 INFO L280 TraceCheckUtils]: 14: Hoare triple {437#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {439#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-17 22:27:58,941 INFO L280 TraceCheckUtils]: 15: Hoare triple {439#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {440#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:58,942 INFO L280 TraceCheckUtils]: 16: Hoare triple {440#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {440#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:58,943 INFO L280 TraceCheckUtils]: 17: Hoare triple {440#(= 0 |old(~head~0.base)|)} assume true; {440#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:58,944 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {440#(= 0 |old(~head~0.base)|)} {413#(not (= 0 ~head~0.base))} #86#return; {404#false} is VALID [2020-07-17 22:27:58,945 INFO L280 TraceCheckUtils]: 19: Hoare triple {404#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {404#false} is VALID [2020-07-17 22:27:58,945 INFO L263 TraceCheckUtils]: 20: Hoare triple {404#false} call #t~ret8 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {437#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#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-17 22:27:58,945 INFO L280 TraceCheckUtils]: 21: Hoare triple {437#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {403#true} is VALID [2020-07-17 22:27:58,945 INFO L280 TraceCheckUtils]: 22: Hoare triple {403#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {403#true} is VALID [2020-07-17 22:27:58,946 INFO L280 TraceCheckUtils]: 23: Hoare triple {403#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {403#true} is VALID [2020-07-17 22:27:58,946 INFO L280 TraceCheckUtils]: 24: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-17 22:27:58,946 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {403#true} {404#false} #88#return; {404#false} is VALID [2020-07-17 22:27:58,946 INFO L280 TraceCheckUtils]: 26: Hoare triple {404#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;havoc #t~ret8; {404#false} is VALID [2020-07-17 22:27:58,947 INFO L263 TraceCheckUtils]: 27: Hoare triple {404#false} call #t~ret9 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {437#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#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-17 22:27:58,947 INFO L280 TraceCheckUtils]: 28: Hoare triple {437#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {403#true} is VALID [2020-07-17 22:27:58,947 INFO L280 TraceCheckUtils]: 29: Hoare triple {403#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {403#true} is VALID [2020-07-17 22:27:58,947 INFO L280 TraceCheckUtils]: 30: Hoare triple {403#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {403#true} is VALID [2020-07-17 22:27:58,948 INFO L280 TraceCheckUtils]: 31: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-17 22:27:58,948 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {403#true} {404#false} #90#return; {404#false} is VALID [2020-07-17 22:27:58,948 INFO L280 TraceCheckUtils]: 33: Hoare triple {404#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;havoc #t~ret9; {404#false} is VALID [2020-07-17 22:27:58,948 INFO L263 TraceCheckUtils]: 34: Hoare triple {404#false} call #t~ret10.base, #t~ret10.offset := search_list(~head~0.base, ~head~0.offset, 2); {403#true} is VALID [2020-07-17 22:27:58,949 INFO L280 TraceCheckUtils]: 35: Hoare triple {403#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {403#true} is VALID [2020-07-17 22:27:58,949 INFO L280 TraceCheckUtils]: 36: Hoare triple {403#true} #t~short3 := ~l.base != 0 || ~l.offset != 0; {403#true} is VALID [2020-07-17 22:27:58,949 INFO L280 TraceCheckUtils]: 37: Hoare triple {403#true} assume #t~short3;call #t~mem2 := read~int(~l.base, ~l.offset, 4);#t~short3 := #t~mem2 != ~k; {403#true} is VALID [2020-07-17 22:27:58,949 INFO L280 TraceCheckUtils]: 38: Hoare triple {403#true} assume !#t~short3;havoc #t~mem2;havoc #t~short3; {403#true} is VALID [2020-07-17 22:27:58,950 INFO L280 TraceCheckUtils]: 39: Hoare triple {403#true} #res.base, #res.offset := ~l.base, ~l.offset; {403#true} is VALID [2020-07-17 22:27:58,950 INFO L280 TraceCheckUtils]: 40: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-17 22:27:58,950 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {403#true} {404#false} #92#return; {404#false} is VALID [2020-07-17 22:27:58,950 INFO L280 TraceCheckUtils]: 42: Hoare triple {404#false} ~temp~0.base, ~temp~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset;call #t~mem11 := read~int(~temp~0.base, ~temp~0.offset, 4); {404#false} is VALID [2020-07-17 22:27:58,951 INFO L263 TraceCheckUtils]: 43: Hoare triple {404#false} call __VERIFIER_assert((if 1 == #t~mem11 then 1 else 0)); {404#false} is VALID [2020-07-17 22:27:58,951 INFO L280 TraceCheckUtils]: 44: Hoare triple {404#false} ~cond := #in~cond; {404#false} is VALID [2020-07-17 22:27:58,951 INFO L280 TraceCheckUtils]: 45: Hoare triple {404#false} assume 0 == ~cond; {404#false} is VALID [2020-07-17 22:27:58,951 INFO L280 TraceCheckUtils]: 46: Hoare triple {404#false} assume !false; {404#false} is VALID [2020-07-17 22:27:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-17 22:27:58,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174244120] [2020-07-17 22:27:58,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001537625] [2020-07-17 22:27:58,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:59,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-17 22:27:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:59,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:27:59,203 INFO L263 TraceCheckUtils]: 0: Hoare triple {403#true} call ULTIMATE.init(); {403#true} is VALID [2020-07-17 22:27:59,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~head~0.base, ~head~0.offset := 0, 0; {403#true} is VALID [2020-07-17 22:27:59,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-17 22:27:59,204 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {403#true} {403#true} #96#return; {403#true} is VALID [2020-07-17 22:27:59,204 INFO L263 TraceCheckUtils]: 4: Hoare triple {403#true} call #t~ret13 := main(); {403#true} is VALID [2020-07-17 22:27:59,204 INFO L280 TraceCheckUtils]: 5: Hoare triple {403#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {403#true} is VALID [2020-07-17 22:27:59,205 INFO L263 TraceCheckUtils]: 6: Hoare triple {403#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {403#true} is VALID [2020-07-17 22:27:59,205 INFO L280 TraceCheckUtils]: 7: Hoare triple {403#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {403#true} is VALID [2020-07-17 22:27:59,205 INFO L280 TraceCheckUtils]: 8: Hoare triple {403#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {403#true} is VALID [2020-07-17 22:27:59,205 INFO L280 TraceCheckUtils]: 9: Hoare triple {403#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {403#true} is VALID [2020-07-17 22:27:59,206 INFO L280 TraceCheckUtils]: 10: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-17 22:27:59,206 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {403#true} {403#true} #84#return; {403#true} is VALID [2020-07-17 22:27:59,206 INFO L280 TraceCheckUtils]: 12: Hoare triple {403#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {403#true} is VALID [2020-07-17 22:27:59,206 INFO L263 TraceCheckUtils]: 13: Hoare triple {403#true} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {403#true} is VALID [2020-07-17 22:27:59,208 INFO L280 TraceCheckUtils]: 14: Hoare triple {403#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {438#(not (= 0 insert_list_~l.base))} is VALID [2020-07-17 22:27:59,209 INFO L280 TraceCheckUtils]: 15: Hoare triple {438#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {438#(not (= 0 insert_list_~l.base))} is VALID [2020-07-17 22:27:59,210 INFO L280 TraceCheckUtils]: 16: Hoare triple {438#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {413#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:59,210 INFO L280 TraceCheckUtils]: 17: Hoare triple {413#(not (= 0 ~head~0.base))} assume true; {413#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:59,212 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {413#(not (= 0 ~head~0.base))} {403#true} #86#return; {413#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:59,212 INFO L280 TraceCheckUtils]: 19: Hoare triple {413#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {413#(not (= 0 ~head~0.base))} is VALID [2020-07-17 22:27:59,213 INFO L263 TraceCheckUtils]: 20: Hoare triple {413#(not (= 0 ~head~0.base))} call #t~ret8 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {439#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-17 22:27:59,214 INFO L280 TraceCheckUtils]: 21: Hoare triple {439#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {439#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-17 22:27:59,215 INFO L280 TraceCheckUtils]: 22: Hoare triple {439#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {440#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:59,216 INFO L280 TraceCheckUtils]: 23: Hoare triple {440#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {440#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:59,217 INFO L280 TraceCheckUtils]: 24: Hoare triple {440#(= 0 |old(~head~0.base)|)} assume true; {440#(= 0 |old(~head~0.base)|)} is VALID [2020-07-17 22:27:59,218 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {440#(= 0 |old(~head~0.base)|)} {413#(not (= 0 ~head~0.base))} #88#return; {404#false} is VALID [2020-07-17 22:27:59,219 INFO L280 TraceCheckUtils]: 26: Hoare triple {404#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;havoc #t~ret8; {404#false} is VALID [2020-07-17 22:27:59,219 INFO L263 TraceCheckUtils]: 27: Hoare triple {404#false} call #t~ret9 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {404#false} is VALID [2020-07-17 22:27:59,219 INFO L280 TraceCheckUtils]: 28: Hoare triple {404#false} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {404#false} is VALID [2020-07-17 22:27:59,219 INFO L280 TraceCheckUtils]: 29: Hoare triple {404#false} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {404#false} is VALID [2020-07-17 22:27:59,220 INFO L280 TraceCheckUtils]: 30: Hoare triple {404#false} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {404#false} is VALID [2020-07-17 22:27:59,220 INFO L280 TraceCheckUtils]: 31: Hoare triple {404#false} assume true; {404#false} is VALID [2020-07-17 22:27:59,220 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {404#false} {404#false} #90#return; {404#false} is VALID [2020-07-17 22:27:59,220 INFO L280 TraceCheckUtils]: 33: Hoare triple {404#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;havoc #t~ret9; {404#false} is VALID [2020-07-17 22:27:59,221 INFO L263 TraceCheckUtils]: 34: Hoare triple {404#false} call #t~ret10.base, #t~ret10.offset := search_list(~head~0.base, ~head~0.offset, 2); {404#false} is VALID [2020-07-17 22:27:59,221 INFO L280 TraceCheckUtils]: 35: Hoare triple {404#false} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {404#false} is VALID [2020-07-17 22:27:59,221 INFO L280 TraceCheckUtils]: 36: Hoare triple {404#false} #t~short3 := ~l.base != 0 || ~l.offset != 0; {404#false} is VALID [2020-07-17 22:27:59,221 INFO L280 TraceCheckUtils]: 37: Hoare triple {404#false} assume #t~short3;call #t~mem2 := read~int(~l.base, ~l.offset, 4);#t~short3 := #t~mem2 != ~k; {404#false} is VALID [2020-07-17 22:27:59,222 INFO L280 TraceCheckUtils]: 38: Hoare triple {404#false} assume !#t~short3;havoc #t~mem2;havoc #t~short3; {404#false} is VALID [2020-07-17 22:27:59,222 INFO L280 TraceCheckUtils]: 39: Hoare triple {404#false} #res.base, #res.offset := ~l.base, ~l.offset; {404#false} is VALID [2020-07-17 22:27:59,222 INFO L280 TraceCheckUtils]: 40: Hoare triple {404#false} assume true; {404#false} is VALID [2020-07-17 22:27:59,222 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {404#false} {404#false} #92#return; {404#false} is VALID [2020-07-17 22:27:59,223 INFO L280 TraceCheckUtils]: 42: Hoare triple {404#false} ~temp~0.base, ~temp~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset;call #t~mem11 := read~int(~temp~0.base, ~temp~0.offset, 4); {404#false} is VALID [2020-07-17 22:27:59,223 INFO L263 TraceCheckUtils]: 43: Hoare triple {404#false} call __VERIFIER_assert((if 1 == #t~mem11 then 1 else 0)); {404#false} is VALID [2020-07-17 22:27:59,223 INFO L280 TraceCheckUtils]: 44: Hoare triple {404#false} ~cond := #in~cond; {404#false} is VALID [2020-07-17 22:27:59,223 INFO L280 TraceCheckUtils]: 45: Hoare triple {404#false} assume 0 == ~cond; {404#false} is VALID [2020-07-17 22:27:59,224 INFO L280 TraceCheckUtils]: 46: Hoare triple {404#false} assume !false; {404#false} is VALID [2020-07-17 22:27:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:27:59,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:27:59,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2020-07-17 22:27:59,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978308628] [2020-07-17 22:27:59,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-07-17 22:27:59,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:59,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:27:59,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:59,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:27:59,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:59,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:27:59,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:27:59,349 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 8 states. [2020-07-17 22:28:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:00,371 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2020-07-17 22:28:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:28:00,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-07-17 22:28:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:28:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:28:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2020-07-17 22:28:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:28:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2020-07-17 22:28:00,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2020-07-17 22:28:00,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:28:00,547 INFO L225 Difference]: With dead ends: 73 [2020-07-17 22:28:00,547 INFO L226 Difference]: Without dead ends: 49 [2020-07-17 22:28:00,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:28:00,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-17 22:28:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2020-07-17 22:28:00,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:28:00,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 38 states. [2020-07-17 22:28:00,591 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 38 states. [2020-07-17 22:28:00,592 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 38 states. [2020-07-17 22:28:00,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:00,597 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2020-07-17 22:28:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2020-07-17 22:28:00,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:00,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:00,598 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 49 states. [2020-07-17 22:28:00,599 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 49 states. [2020-07-17 22:28:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:00,606 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2020-07-17 22:28:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2020-07-17 22:28:00,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:00,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:00,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:28:00,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:28:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-17 22:28:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-07-17 22:28:00,616 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 47 [2020-07-17 22:28:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:28:00,616 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-07-17 22:28:00,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:28:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-17 22:28:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-17 22:28:00,618 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:28:00,618 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:00,831 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:28:00,832 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:28:00,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:28:00,833 INFO L82 PathProgramCache]: Analyzing trace with hash 874015054, now seen corresponding path program 1 times [2020-07-17 22:28:00,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:28:00,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185900059] [2020-07-17 22:28:00,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:28:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:28:00,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:28:00,891 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.interpolateCongruence(CCInterpolator.java:300) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.computeInterpolants(CCInterpolator.java:415) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:297) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:279) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:135) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:236) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:213) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:874) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:337) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:239) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-17 22:28:00,900 INFO L168 Benchmark]: Toolchain (without parser) took 5570.87 ms. Allocated memory was 145.2 MB in the beginning and 287.3 MB in the end (delta: 142.1 MB). Free memory was 101.3 MB in the beginning and 181.9 MB in the end (delta: -80.6 MB). Peak memory consumption was 61.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:28:00,901 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-17 22:28:00,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.57 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 101.1 MB in the beginning and 167.7 MB in the end (delta: -66.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:28:00,903 INFO L168 Benchmark]: Boogie Preprocessor took 78.63 ms. Allocated memory is still 203.4 MB. Free memory was 167.7 MB in the beginning and 164.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:28:00,903 INFO L168 Benchmark]: RCFGBuilder took 775.29 ms. Allocated memory is still 203.4 MB. Free memory was 164.5 MB in the beginning and 109.1 MB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:28:00,904 INFO L168 Benchmark]: TraceAbstraction took 4033.09 ms. Allocated memory was 203.4 MB in the beginning and 287.3 MB in the end (delta: 83.9 MB). Free memory was 108.5 MB in the beginning and 181.9 MB in the end (delta: -73.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:28:00,908 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.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 675.57 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 101.1 MB in the beginning and 167.7 MB in the end (delta: -66.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.63 ms. Allocated memory is still 203.4 MB. Free memory was 167.7 MB in the beginning and 164.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 775.29 ms. Allocated memory is still 203.4 MB. Free memory was 164.5 MB in the beginning and 109.1 MB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4033.09 ms. Allocated memory was 203.4 MB in the beginning and 287.3 MB in the end (delta: 83.9 MB). Free memory was 108.5 MB in the beginning and 181.9 MB in the end (delta: -73.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.interpolateCongruence(CCInterpolator.java:300) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...