java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:22:08,448 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:22:08,450 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:22:08,462 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:22:08,462 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:22:08,463 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:22:08,465 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:22:08,467 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:22:08,468 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:22:08,469 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:22:08,470 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:22:08,470 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:22:08,471 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:22:08,473 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:22:08,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:22:08,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:22:08,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:22:08,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:22:08,480 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:22:08,481 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:22:08,482 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:22:08,485 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:22:08,491 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:22:08,491 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:22:08,491 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:22:08,492 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:22:08,497 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:22:08,500 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:22:08,501 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:22:08,502 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:22:08,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:22:08,507 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:22:08,507 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:22:08,507 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:22:08,508 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:22:08,509 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:22:08,509 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:22:08,542 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:22:08,542 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:22:08,544 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:22:08,544 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:22:08,545 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:22:08,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:22:08,545 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:22:08,546 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:22:08,546 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:22:08,546 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:22:08,546 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:22:08,546 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:22:08,547 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:22:08,547 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:22:08,547 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:22:08,547 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:22:08,547 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:22:08,549 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:22:08,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:22:08,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:22:08,549 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:22:08,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:22:08,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:22:08,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:22:08,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:22:08,551 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:22:08,551 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:22:08,551 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:22:08,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:22:08,551 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:22:08,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:22:08,640 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:22:08,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:22:08,647 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:22:08,647 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:22:08,648 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:22:08,714 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90dce265c/9ef4cbb583be474489aba36436e96275/FLAG15c1d429f [2018-11-14 17:22:09,221 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:22:09,222 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:22:09,238 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90dce265c/9ef4cbb583be474489aba36436e96275/FLAG15c1d429f [2018-11-14 17:22:09,252 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90dce265c/9ef4cbb583be474489aba36436e96275 [2018-11-14 17:22:09,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:22:09,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:22:09,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:22:09,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:22:09,268 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:22:09,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:09" (1/1) ... [2018-11-14 17:22:09,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e089e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:09, skipping insertion in model container [2018-11-14 17:22:09,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:09" (1/1) ... [2018-11-14 17:22:09,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:22:09,329 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:22:09,692 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:22:09,707 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:22:09,796 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:22:09,934 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:22:09,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:09 WrapperNode [2018-11-14 17:22:09,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:22:09,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:22:09,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:22:09,936 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:22:09,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:09" (1/1) ... [2018-11-14 17:22:09,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:09" (1/1) ... [2018-11-14 17:22:09,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:09" (1/1) ... [2018-11-14 17:22:09,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:09" (1/1) ... [2018-11-14 17:22:09,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:09" (1/1) ... [2018-11-14 17:22:10,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:09" (1/1) ... [2018-11-14 17:22:10,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:09" (1/1) ... [2018-11-14 17:22:10,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:22:10,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:22:10,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:22:10,010 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:22:10,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:09" (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 [2018-11-14 17:22:10,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:22:10,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:22:10,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:22:10,072 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2018-11-14 17:22:10,072 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2018-11-14 17:22:10,072 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:22:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:22:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:22:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:22:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:22:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:22:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:22:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:22:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:22:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:22:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:22:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:22:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:22:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:22:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:22:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:22:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:22:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:22:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:22:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:22:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:22:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:22:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:22:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:22:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:22:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:22:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:22:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:22:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:22:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:22:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:22:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:22:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:22:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:22:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:22:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:22:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:22:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:22:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:22:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:22:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:22:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:22:10,079 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:22:10,079 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:22:10,079 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:22:10,079 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:22:10,079 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:22:10,079 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:22:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:22:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:22:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:22:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:22:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:22:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:22:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:22:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:22:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:22:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:22:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:22:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:22:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:22:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:22:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:22:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:22:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:22:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:22:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:22:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-14 17:22:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:22:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:22:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:22:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:22:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:22:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:22:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:22:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:22:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:22:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:22:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:22:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:22:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:22:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:22:10,085 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:22:10,085 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:22:10,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:22:10,085 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:22:10,085 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:22:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:22:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:22:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:22:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:22:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:22:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:22:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:22:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:22:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:22:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:22:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:22:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:22:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:22:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:22:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:22:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:22:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:22:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2018-11-14 17:22:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:22:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:22:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2018-11-14 17:22:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:22:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:22:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:22:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:22:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:22:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:22:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:22:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:22:10,991 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:22:10,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:10 BoogieIcfgContainer [2018-11-14 17:22:10,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:22:10,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:22:10,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:22:10,996 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:22:10,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:22:09" (1/3) ... [2018-11-14 17:22:10,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372262a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:10, skipping insertion in model container [2018-11-14 17:22:10,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:09" (2/3) ... [2018-11-14 17:22:10,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372262a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:10, skipping insertion in model container [2018-11-14 17:22:10,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:10" (3/3) ... [2018-11-14 17:22:10,999 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:22:11,008 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:22:11,016 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:22:11,034 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:22:11,071 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:22:11,072 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:22:11,072 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:22:11,072 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:22:11,072 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:22:11,072 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:22:11,073 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:22:11,073 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:22:11,073 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:22:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-14 17:22:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 17:22:11,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:11,102 INFO L375 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] [2018-11-14 17:22:11,105 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:11,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:11,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1101714923, now seen corresponding path program 1 times [2018-11-14 17:22:11,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:11,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:11,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:11,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:11,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:11,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {46#true} is VALID [2018-11-14 17:22:11,642 INFO L273 TraceCheckUtils]: 1: Hoare triple {46#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {46#true} is VALID [2018-11-14 17:22:11,642 INFO L273 TraceCheckUtils]: 2: Hoare triple {46#true} assume true; {46#true} is VALID [2018-11-14 17:22:11,643 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46#true} {46#true} #88#return; {46#true} is VALID [2018-11-14 17:22:11,643 INFO L256 TraceCheckUtils]: 4: Hoare triple {46#true} call #t~ret11 := main(); {46#true} is VALID [2018-11-14 17:22:11,643 INFO L273 TraceCheckUtils]: 5: Hoare triple {46#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {46#true} is VALID [2018-11-14 17:22:11,644 INFO L256 TraceCheckUtils]: 6: Hoare triple {46#true} call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {46#true} is VALID [2018-11-14 17:22:11,645 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {48#(not (= insert_list_~l.base 0))} is VALID [2018-11-14 17:22:11,646 INFO L273 TraceCheckUtils]: 8: Hoare triple {48#(not (= insert_list_~l.base 0))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {48#(not (= insert_list_~l.base 0))} is VALID [2018-11-14 17:22:11,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {48#(not (= insert_list_~l.base 0))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {49#(not (= ~head~0.base 0))} is VALID [2018-11-14 17:22:11,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {49#(not (= ~head~0.base 0))} assume true; {49#(not (= ~head~0.base 0))} is VALID [2018-11-14 17:22:11,650 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {49#(not (= ~head~0.base 0))} {46#true} #76#return; {49#(not (= ~head~0.base 0))} is VALID [2018-11-14 17:22:11,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {49#(not (= ~head~0.base 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;havoc #t~ret4; {49#(not (= ~head~0.base 0))} is VALID [2018-11-14 17:22:11,653 INFO L256 TraceCheckUtils]: 13: Hoare triple {49#(not (= ~head~0.base 0))} call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {50#(= ~head~0.base |old(~head~0.base)|)} is VALID [2018-11-14 17:22:11,655 INFO L273 TraceCheckUtils]: 14: Hoare triple {50#(= ~head~0.base |old(~head~0.base)|)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {50#(= ~head~0.base |old(~head~0.base)|)} is VALID [2018-11-14 17:22:11,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {50#(= ~head~0.base |old(~head~0.base)|)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {51#(= 0 |old(~head~0.base)|)} is VALID [2018-11-14 17:22:11,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {51#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {51#(= 0 |old(~head~0.base)|)} is VALID [2018-11-14 17:22:11,662 INFO L273 TraceCheckUtils]: 17: Hoare triple {51#(= 0 |old(~head~0.base)|)} assume true; {51#(= 0 |old(~head~0.base)|)} is VALID [2018-11-14 17:22:11,664 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {51#(= 0 |old(~head~0.base)|)} {49#(not (= ~head~0.base 0))} #78#return; {47#false} is VALID [2018-11-14 17:22:11,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {47#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;havoc #t~ret5; {47#false} is VALID [2018-11-14 17:22:11,665 INFO L256 TraceCheckUtils]: 20: Hoare triple {47#false} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {46#true} is VALID [2018-11-14 17:22:11,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {46#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {46#true} is VALID [2018-11-14 17:22:11,666 INFO L273 TraceCheckUtils]: 22: Hoare triple {46#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {46#true} is VALID [2018-11-14 17:22:11,666 INFO L273 TraceCheckUtils]: 23: Hoare triple {46#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {46#true} is VALID [2018-11-14 17:22:11,666 INFO L273 TraceCheckUtils]: 24: Hoare triple {46#true} assume true; {46#true} is VALID [2018-11-14 17:22:11,667 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {46#true} {47#false} #80#return; {47#false} is VALID [2018-11-14 17:22:11,667 INFO L273 TraceCheckUtils]: 26: Hoare triple {47#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {47#false} is VALID [2018-11-14 17:22:11,667 INFO L256 TraceCheckUtils]: 27: Hoare triple {47#false} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {46#true} is VALID [2018-11-14 17:22:11,668 INFO L273 TraceCheckUtils]: 28: Hoare triple {46#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {46#true} is VALID [2018-11-14 17:22:11,668 INFO L273 TraceCheckUtils]: 29: Hoare triple {46#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {46#true} is VALID [2018-11-14 17:22:11,668 INFO L273 TraceCheckUtils]: 30: Hoare triple {46#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {46#true} is VALID [2018-11-14 17:22:11,669 INFO L273 TraceCheckUtils]: 31: Hoare triple {46#true} assume true; {46#true} is VALID [2018-11-14 17:22:11,669 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {46#true} {47#false} #82#return; {47#false} is VALID [2018-11-14 17:22:11,669 INFO L273 TraceCheckUtils]: 33: Hoare triple {47#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {47#false} is VALID [2018-11-14 17:22:11,670 INFO L256 TraceCheckUtils]: 34: Hoare triple {47#false} call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); {46#true} is VALID [2018-11-14 17:22:11,670 INFO L273 TraceCheckUtils]: 35: Hoare triple {46#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {46#true} is VALID [2018-11-14 17:22:11,670 INFO L273 TraceCheckUtils]: 36: Hoare triple {46#true} assume !true; {46#true} is VALID [2018-11-14 17:22:11,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {46#true} #res.base, #res.offset := ~l.base, ~l.offset; {46#true} is VALID [2018-11-14 17:22:11,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {46#true} assume true; {46#true} is VALID [2018-11-14 17:22:11,671 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {46#true} {47#false} #84#return; {47#false} is VALID [2018-11-14 17:22:11,672 INFO L273 TraceCheckUtils]: 40: Hoare triple {47#false} ~temp~0.base, ~temp~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9 := read~int(~temp~0.base, ~temp~0.offset + 0, 4); {47#false} is VALID [2018-11-14 17:22:11,672 INFO L256 TraceCheckUtils]: 41: Hoare triple {47#false} call __VERIFIER_assert((if #t~mem9 == 1 then 1 else 0)); {47#false} is VALID [2018-11-14 17:22:11,672 INFO L273 TraceCheckUtils]: 42: Hoare triple {47#false} ~cond := #in~cond; {47#false} is VALID [2018-11-14 17:22:11,672 INFO L273 TraceCheckUtils]: 43: Hoare triple {47#false} assume ~cond == 0; {47#false} is VALID [2018-11-14 17:22:11,673 INFO L273 TraceCheckUtils]: 44: Hoare triple {47#false} assume !false; {47#false} is VALID [2018-11-14 17:22:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 17:22:11,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:22:11,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:22:11,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:11,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:22:12,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {46#true} is VALID [2018-11-14 17:22:12,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {46#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {46#true} is VALID [2018-11-14 17:22:12,194 INFO L273 TraceCheckUtils]: 2: Hoare triple {46#true} assume true; {46#true} is VALID [2018-11-14 17:22:12,194 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46#true} {46#true} #88#return; {46#true} is VALID [2018-11-14 17:22:12,194 INFO L256 TraceCheckUtils]: 4: Hoare triple {46#true} call #t~ret11 := main(); {46#true} is VALID [2018-11-14 17:22:12,195 INFO L273 TraceCheckUtils]: 5: Hoare triple {46#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {46#true} is VALID [2018-11-14 17:22:12,195 INFO L256 TraceCheckUtils]: 6: Hoare triple {46#true} call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {46#true} is VALID [2018-11-14 17:22:12,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {46#true} is VALID [2018-11-14 17:22:12,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {46#true} is VALID [2018-11-14 17:22:12,196 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {46#true} is VALID [2018-11-14 17:22:12,196 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#true} assume true; {46#true} is VALID [2018-11-14 17:22:12,197 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {46#true} {46#true} #76#return; {46#true} is VALID [2018-11-14 17:22:12,197 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;havoc #t~ret4; {46#true} is VALID [2018-11-14 17:22:12,197 INFO L256 TraceCheckUtils]: 13: Hoare triple {46#true} call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {46#true} is VALID [2018-11-14 17:22:12,198 INFO L273 TraceCheckUtils]: 14: Hoare triple {46#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {46#true} is VALID [2018-11-14 17:22:12,198 INFO L273 TraceCheckUtils]: 15: Hoare triple {46#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {46#true} is VALID [2018-11-14 17:22:12,198 INFO L273 TraceCheckUtils]: 16: Hoare triple {46#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {46#true} is VALID [2018-11-14 17:22:12,199 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#true} assume true; {46#true} is VALID [2018-11-14 17:22:12,199 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {46#true} {46#true} #78#return; {46#true} is VALID [2018-11-14 17:22:12,199 INFO L273 TraceCheckUtils]: 19: Hoare triple {46#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;havoc #t~ret5; {46#true} is VALID [2018-11-14 17:22:12,200 INFO L256 TraceCheckUtils]: 20: Hoare triple {46#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {46#true} is VALID [2018-11-14 17:22:12,200 INFO L273 TraceCheckUtils]: 21: Hoare triple {46#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {46#true} is VALID [2018-11-14 17:22:12,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {46#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {46#true} is VALID [2018-11-14 17:22:12,201 INFO L273 TraceCheckUtils]: 23: Hoare triple {46#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {46#true} is VALID [2018-11-14 17:22:12,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {46#true} assume true; {46#true} is VALID [2018-11-14 17:22:12,201 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {46#true} {46#true} #80#return; {46#true} is VALID [2018-11-14 17:22:12,202 INFO L273 TraceCheckUtils]: 26: Hoare triple {46#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {46#true} is VALID [2018-11-14 17:22:12,202 INFO L256 TraceCheckUtils]: 27: Hoare triple {46#true} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {46#true} is VALID [2018-11-14 17:22:12,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {46#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {46#true} is VALID [2018-11-14 17:22:12,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {46#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {46#true} is VALID [2018-11-14 17:22:12,203 INFO L273 TraceCheckUtils]: 30: Hoare triple {46#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {46#true} is VALID [2018-11-14 17:22:12,203 INFO L273 TraceCheckUtils]: 31: Hoare triple {46#true} assume true; {46#true} is VALID [2018-11-14 17:22:12,203 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {46#true} {46#true} #82#return; {46#true} is VALID [2018-11-14 17:22:12,203 INFO L273 TraceCheckUtils]: 33: Hoare triple {46#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {46#true} is VALID [2018-11-14 17:22:12,204 INFO L256 TraceCheckUtils]: 34: Hoare triple {46#true} call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); {46#true} is VALID [2018-11-14 17:22:12,204 INFO L273 TraceCheckUtils]: 35: Hoare triple {46#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {46#true} is VALID [2018-11-14 17:22:12,205 INFO L273 TraceCheckUtils]: 36: Hoare triple {46#true} assume !true; {47#false} is VALID [2018-11-14 17:22:12,205 INFO L273 TraceCheckUtils]: 37: Hoare triple {47#false} #res.base, #res.offset := ~l.base, ~l.offset; {47#false} is VALID [2018-11-14 17:22:12,205 INFO L273 TraceCheckUtils]: 38: Hoare triple {47#false} assume true; {47#false} is VALID [2018-11-14 17:22:12,205 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {47#false} {46#true} #84#return; {47#false} is VALID [2018-11-14 17:22:12,206 INFO L273 TraceCheckUtils]: 40: Hoare triple {47#false} ~temp~0.base, ~temp~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9 := read~int(~temp~0.base, ~temp~0.offset + 0, 4); {47#false} is VALID [2018-11-14 17:22:12,206 INFO L256 TraceCheckUtils]: 41: Hoare triple {47#false} call __VERIFIER_assert((if #t~mem9 == 1 then 1 else 0)); {47#false} is VALID [2018-11-14 17:22:12,206 INFO L273 TraceCheckUtils]: 42: Hoare triple {47#false} ~cond := #in~cond; {47#false} is VALID [2018-11-14 17:22:12,206 INFO L273 TraceCheckUtils]: 43: Hoare triple {47#false} assume ~cond == 0; {47#false} is VALID [2018-11-14 17:22:12,207 INFO L273 TraceCheckUtils]: 44: Hoare triple {47#false} assume !false; {47#false} is VALID [2018-11-14 17:22:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 17:22:12,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:22:12,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2018-11-14 17:22:12,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-14 17:22:12,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:12,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:22:12,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:12,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:22:12,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:22:12,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:22:12,499 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2018-11-14 17:22:13,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:13,805 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2018-11-14 17:22:13,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:22:13,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-14 17:22:13,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:22:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 140 transitions. [2018-11-14 17:22:13,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:22:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 140 transitions. [2018-11-14 17:22:13,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 140 transitions. [2018-11-14 17:22:14,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:14,319 INFO L225 Difference]: With dead ends: 102 [2018-11-14 17:22:14,319 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 17:22:14,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:22:14,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 17:22:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 39. [2018-11-14 17:22:14,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:14,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 39 states. [2018-11-14 17:22:14,443 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 39 states. [2018-11-14 17:22:14,443 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 39 states. [2018-11-14 17:22:14,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:14,451 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-11-14 17:22:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-14 17:22:14,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:14,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:14,454 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 50 states. [2018-11-14 17:22:14,454 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 50 states. [2018-11-14 17:22:14,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:14,460 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-11-14 17:22:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-14 17:22:14,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:14,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:14,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:14,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:22:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-14 17:22:14,473 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 45 [2018-11-14 17:22:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:14,473 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-14 17:22:14,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:22:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 17:22:14,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 17:22:14,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:14,476 INFO L375 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, 1] [2018-11-14 17:22:14,476 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:14,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:14,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2012418106, now seen corresponding path program 1 times [2018-11-14 17:22:14,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:14,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:14,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:14,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:14,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:14,865 INFO L256 TraceCheckUtils]: 0: Hoare triple {495#true} call ULTIMATE.init(); {495#true} is VALID [2018-11-14 17:22:14,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {495#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {495#true} is VALID [2018-11-14 17:22:14,866 INFO L273 TraceCheckUtils]: 2: Hoare triple {495#true} assume true; {495#true} is VALID [2018-11-14 17:22:14,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {495#true} {495#true} #88#return; {495#true} is VALID [2018-11-14 17:22:14,867 INFO L256 TraceCheckUtils]: 4: Hoare triple {495#true} call #t~ret11 := main(); {495#true} is VALID [2018-11-14 17:22:14,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {495#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {495#true} is VALID [2018-11-14 17:22:14,868 INFO L256 TraceCheckUtils]: 6: Hoare triple {495#true} call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {495#true} is VALID [2018-11-14 17:22:14,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {495#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {495#true} is VALID [2018-11-14 17:22:14,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {495#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {495#true} is VALID [2018-11-14 17:22:14,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {495#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {495#true} is VALID [2018-11-14 17:22:14,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {495#true} assume true; {495#true} is VALID [2018-11-14 17:22:14,870 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {495#true} {495#true} #76#return; {495#true} is VALID [2018-11-14 17:22:14,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {495#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;havoc #t~ret4; {495#true} is VALID [2018-11-14 17:22:14,870 INFO L256 TraceCheckUtils]: 13: Hoare triple {495#true} call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {495#true} is VALID [2018-11-14 17:22:14,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {495#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {495#true} is VALID [2018-11-14 17:22:14,871 INFO L273 TraceCheckUtils]: 15: Hoare triple {495#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {495#true} is VALID [2018-11-14 17:22:14,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {495#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {495#true} is VALID [2018-11-14 17:22:14,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {495#true} assume true; {495#true} is VALID [2018-11-14 17:22:14,872 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {495#true} {495#true} #78#return; {495#true} is VALID [2018-11-14 17:22:14,872 INFO L273 TraceCheckUtils]: 19: Hoare triple {495#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;havoc #t~ret5; {495#true} is VALID [2018-11-14 17:22:14,872 INFO L256 TraceCheckUtils]: 20: Hoare triple {495#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {495#true} is VALID [2018-11-14 17:22:14,873 INFO L273 TraceCheckUtils]: 21: Hoare triple {495#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {495#true} is VALID [2018-11-14 17:22:14,873 INFO L273 TraceCheckUtils]: 22: Hoare triple {495#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {495#true} is VALID [2018-11-14 17:22:14,873 INFO L273 TraceCheckUtils]: 23: Hoare triple {495#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {495#true} is VALID [2018-11-14 17:22:14,873 INFO L273 TraceCheckUtils]: 24: Hoare triple {495#true} assume true; {495#true} is VALID [2018-11-14 17:22:14,874 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {495#true} {495#true} #80#return; {495#true} is VALID [2018-11-14 17:22:14,874 INFO L273 TraceCheckUtils]: 26: Hoare triple {495#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {495#true} is VALID [2018-11-14 17:22:14,874 INFO L256 TraceCheckUtils]: 27: Hoare triple {495#true} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {495#true} is VALID [2018-11-14 17:22:14,876 INFO L273 TraceCheckUtils]: 28: Hoare triple {495#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {497#(<= |insert_list_#in~k| insert_list_~k)} is VALID [2018-11-14 17:22:14,877 INFO L273 TraceCheckUtils]: 29: Hoare triple {497#(<= |insert_list_#in~k| insert_list_~k)} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {498#(<= |insert_list_#in~k| (select (select |#memory_int| insert_list_~l.base) insert_list_~l.offset))} is VALID [2018-11-14 17:22:14,878 INFO L273 TraceCheckUtils]: 30: Hoare triple {498#(<= |insert_list_#in~k| (select (select |#memory_int| insert_list_~l.base) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {499#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-14 17:22:14,894 INFO L273 TraceCheckUtils]: 31: Hoare triple {499#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} assume true; {499#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-14 17:22:14,896 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {499#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} {495#true} #82#return; {500#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-14 17:22:14,898 INFO L273 TraceCheckUtils]: 33: Hoare triple {500#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {500#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-14 17:22:14,898 INFO L256 TraceCheckUtils]: 34: Hoare triple {500#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); {495#true} is VALID [2018-11-14 17:22:14,899 INFO L273 TraceCheckUtils]: 35: Hoare triple {495#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {501#(and (= search_list_~l.base ~head~0.base) (<= search_list_~k |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} is VALID [2018-11-14 17:22:14,900 INFO L273 TraceCheckUtils]: 36: Hoare triple {501#(and (= search_list_~l.base ~head~0.base) (<= search_list_~k |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} assume true; {501#(and (= search_list_~l.base ~head~0.base) (<= search_list_~k |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} is VALID [2018-11-14 17:22:14,902 INFO L273 TraceCheckUtils]: 37: Hoare triple {501#(and (= search_list_~l.base ~head~0.base) (<= search_list_~k |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} #t~short1 := ~l.base != 0 || ~l.offset != 0; {501#(and (= search_list_~l.base ~head~0.base) (<= search_list_~k |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} is VALID [2018-11-14 17:22:14,912 INFO L273 TraceCheckUtils]: 38: Hoare triple {501#(and (= search_list_~l.base ~head~0.base) (<= search_list_~k |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} assume #t~short1;call #t~mem0 := read~int(~l.base, ~l.offset + 0, 4);#t~short1 := #t~mem0 != ~k; {502#(or (and (= search_list_~l.base ~head~0.base) (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset)) |search_list_#t~short1|)} is VALID [2018-11-14 17:22:14,913 INFO L273 TraceCheckUtils]: 39: Hoare triple {502#(or (and (= search_list_~l.base ~head~0.base) (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset)) |search_list_#t~short1|)} assume !#t~short1;havoc #t~mem0;havoc #t~short1; {503#(and (= search_list_~l.base ~head~0.base) (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} is VALID [2018-11-14 17:22:14,914 INFO L273 TraceCheckUtils]: 40: Hoare triple {503#(and (= search_list_~l.base ~head~0.base) (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} #res.base, #res.offset := ~l.base, ~l.offset; {504#(<= (select (select |#memory_int| ~head~0.base) ~head~0.offset) |search_list_#in~k|)} is VALID [2018-11-14 17:22:14,914 INFO L273 TraceCheckUtils]: 41: Hoare triple {504#(<= (select (select |#memory_int| ~head~0.base) ~head~0.offset) |search_list_#in~k|)} assume true; {504#(<= (select (select |#memory_int| ~head~0.base) ~head~0.offset) |search_list_#in~k|)} is VALID [2018-11-14 17:22:14,915 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {504#(<= (select (select |#memory_int| ~head~0.base) ~head~0.offset) |search_list_#in~k|)} {500#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} #84#return; {496#false} is VALID [2018-11-14 17:22:14,916 INFO L273 TraceCheckUtils]: 43: Hoare triple {496#false} ~temp~0.base, ~temp~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9 := read~int(~temp~0.base, ~temp~0.offset + 0, 4); {496#false} is VALID [2018-11-14 17:22:14,916 INFO L256 TraceCheckUtils]: 44: Hoare triple {496#false} call __VERIFIER_assert((if #t~mem9 == 1 then 1 else 0)); {496#false} is VALID [2018-11-14 17:22:14,916 INFO L273 TraceCheckUtils]: 45: Hoare triple {496#false} ~cond := #in~cond; {496#false} is VALID [2018-11-14 17:22:14,916 INFO L273 TraceCheckUtils]: 46: Hoare triple {496#false} assume ~cond == 0; {496#false} is VALID [2018-11-14 17:22:14,916 INFO L273 TraceCheckUtils]: 47: Hoare triple {496#false} assume !false; {496#false} is VALID [2018-11-14 17:22:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:22:14,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:14,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-14 17:22:14,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-11-14 17:22:14,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:14,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:22:15,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:15,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:22:15,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:22:15,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:22:15,026 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 10 states. [2018-11-14 17:22:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:16,309 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-14 17:22:16,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:22:16,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-11-14 17:22:16,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:22:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2018-11-14 17:22:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:22:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2018-11-14 17:22:16,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 61 transitions. [2018-11-14 17:22:16,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:16,485 INFO L225 Difference]: With dead ends: 59 [2018-11-14 17:22:16,486 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 17:22:16,487 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:22:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 17:22:16,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-11-14 17:22:16,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:16,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 43 states. [2018-11-14 17:22:16,584 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 43 states. [2018-11-14 17:22:16,584 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 43 states. [2018-11-14 17:22:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:16,589 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-14 17:22:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-14 17:22:16,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:16,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:16,591 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 50 states. [2018-11-14 17:22:16,591 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 50 states. [2018-11-14 17:22:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:16,596 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-14 17:22:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-14 17:22:16,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:16,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:16,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:16,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 17:22:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-14 17:22:16,600 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 48 [2018-11-14 17:22:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:16,601 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-14 17:22:16,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:22:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-14 17:22:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 17:22:16,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:16,603 INFO L375 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, 1] [2018-11-14 17:22:16,603 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:16,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:16,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1889522180, now seen corresponding path program 1 times [2018-11-14 17:22:16,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:16,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:16,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:16,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:16,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:16,884 INFO L256 TraceCheckUtils]: 0: Hoare triple {756#true} call ULTIMATE.init(); {756#true} is VALID [2018-11-14 17:22:16,884 INFO L273 TraceCheckUtils]: 1: Hoare triple {756#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {756#true} is VALID [2018-11-14 17:22:16,885 INFO L273 TraceCheckUtils]: 2: Hoare triple {756#true} assume true; {756#true} is VALID [2018-11-14 17:22:16,885 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {756#true} {756#true} #88#return; {756#true} is VALID [2018-11-14 17:22:16,885 INFO L256 TraceCheckUtils]: 4: Hoare triple {756#true} call #t~ret11 := main(); {756#true} is VALID [2018-11-14 17:22:16,885 INFO L273 TraceCheckUtils]: 5: Hoare triple {756#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {756#true} is VALID [2018-11-14 17:22:16,886 INFO L256 TraceCheckUtils]: 6: Hoare triple {756#true} call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {756#true} is VALID [2018-11-14 17:22:16,886 INFO L273 TraceCheckUtils]: 7: Hoare triple {756#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {756#true} is VALID [2018-11-14 17:22:16,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {756#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {756#true} is VALID [2018-11-14 17:22:16,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {756#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {756#true} is VALID [2018-11-14 17:22:16,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {756#true} assume true; {756#true} is VALID [2018-11-14 17:22:16,887 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {756#true} {756#true} #76#return; {756#true} is VALID [2018-11-14 17:22:16,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {756#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;havoc #t~ret4; {756#true} is VALID [2018-11-14 17:22:16,887 INFO L256 TraceCheckUtils]: 13: Hoare triple {756#true} call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {756#true} is VALID [2018-11-14 17:22:16,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {756#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {756#true} is VALID [2018-11-14 17:22:16,887 INFO L273 TraceCheckUtils]: 15: Hoare triple {756#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {756#true} is VALID [2018-11-14 17:22:16,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {756#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {756#true} is VALID [2018-11-14 17:22:16,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {756#true} assume true; {756#true} is VALID [2018-11-14 17:22:16,888 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {756#true} {756#true} #78#return; {756#true} is VALID [2018-11-14 17:22:16,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {756#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;havoc #t~ret5; {756#true} is VALID [2018-11-14 17:22:16,888 INFO L256 TraceCheckUtils]: 20: Hoare triple {756#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {756#true} is VALID [2018-11-14 17:22:16,889 INFO L273 TraceCheckUtils]: 21: Hoare triple {756#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {756#true} is VALID [2018-11-14 17:22:16,889 INFO L273 TraceCheckUtils]: 22: Hoare triple {756#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {756#true} is VALID [2018-11-14 17:22:16,889 INFO L273 TraceCheckUtils]: 23: Hoare triple {756#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {756#true} is VALID [2018-11-14 17:22:16,889 INFO L273 TraceCheckUtils]: 24: Hoare triple {756#true} assume true; {756#true} is VALID [2018-11-14 17:22:16,889 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {756#true} {756#true} #80#return; {756#true} is VALID [2018-11-14 17:22:16,890 INFO L273 TraceCheckUtils]: 26: Hoare triple {756#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {756#true} is VALID [2018-11-14 17:22:16,890 INFO L256 TraceCheckUtils]: 27: Hoare triple {756#true} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {756#true} is VALID [2018-11-14 17:22:16,891 INFO L273 TraceCheckUtils]: 28: Hoare triple {756#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset + 0, 4); {758#(not (= insert_list_~l.base 0))} is VALID [2018-11-14 17:22:16,891 INFO L273 TraceCheckUtils]: 29: Hoare triple {758#(not (= insert_list_~l.base 0))} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {758#(not (= insert_list_~l.base 0))} is VALID [2018-11-14 17:22:16,892 INFO L273 TraceCheckUtils]: 30: Hoare triple {758#(not (= insert_list_~l.base 0))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {759#(not (= ~head~0.base 0))} is VALID [2018-11-14 17:22:16,892 INFO L273 TraceCheckUtils]: 31: Hoare triple {759#(not (= ~head~0.base 0))} assume true; {759#(not (= ~head~0.base 0))} is VALID [2018-11-14 17:22:16,894 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {759#(not (= ~head~0.base 0))} {756#true} #82#return; {759#(not (= ~head~0.base 0))} is VALID [2018-11-14 17:22:16,895 INFO L273 TraceCheckUtils]: 33: Hoare triple {759#(not (= ~head~0.base 0))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {759#(not (= ~head~0.base 0))} is VALID [2018-11-14 17:22:16,895 INFO L256 TraceCheckUtils]: 34: Hoare triple {759#(not (= ~head~0.base 0))} call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); {756#true} is VALID [2018-11-14 17:22:16,896 INFO L273 TraceCheckUtils]: 35: Hoare triple {756#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {760#(= search_list_~l.base ~head~0.base)} is VALID [2018-11-14 17:22:16,896 INFO L273 TraceCheckUtils]: 36: Hoare triple {760#(= search_list_~l.base ~head~0.base)} assume true; {760#(= search_list_~l.base ~head~0.base)} is VALID [2018-11-14 17:22:16,898 INFO L273 TraceCheckUtils]: 37: Hoare triple {760#(= search_list_~l.base ~head~0.base)} #t~short1 := ~l.base != 0 || ~l.offset != 0; {761#(or (= 0 ~head~0.base) |search_list_#t~short1|)} is VALID [2018-11-14 17:22:16,898 INFO L273 TraceCheckUtils]: 38: Hoare triple {761#(or (= 0 ~head~0.base) |search_list_#t~short1|)} assume !#t~short1; {762#(= 0 ~head~0.base)} is VALID [2018-11-14 17:22:16,899 INFO L273 TraceCheckUtils]: 39: Hoare triple {762#(= 0 ~head~0.base)} assume !#t~short1;havoc #t~mem0;havoc #t~short1; {762#(= 0 ~head~0.base)} is VALID [2018-11-14 17:22:16,900 INFO L273 TraceCheckUtils]: 40: Hoare triple {762#(= 0 ~head~0.base)} #res.base, #res.offset := ~l.base, ~l.offset; {762#(= 0 ~head~0.base)} is VALID [2018-11-14 17:22:16,902 INFO L273 TraceCheckUtils]: 41: Hoare triple {762#(= 0 ~head~0.base)} assume true; {762#(= 0 ~head~0.base)} is VALID [2018-11-14 17:22:16,904 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {762#(= 0 ~head~0.base)} {759#(not (= ~head~0.base 0))} #84#return; {757#false} is VALID [2018-11-14 17:22:16,904 INFO L273 TraceCheckUtils]: 43: Hoare triple {757#false} ~temp~0.base, ~temp~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9 := read~int(~temp~0.base, ~temp~0.offset + 0, 4); {757#false} is VALID [2018-11-14 17:22:16,905 INFO L256 TraceCheckUtils]: 44: Hoare triple {757#false} call __VERIFIER_assert((if #t~mem9 == 1 then 1 else 0)); {757#false} is VALID [2018-11-14 17:22:16,905 INFO L273 TraceCheckUtils]: 45: Hoare triple {757#false} ~cond := #in~cond; {757#false} is VALID [2018-11-14 17:22:16,905 INFO L273 TraceCheckUtils]: 46: Hoare triple {757#false} assume ~cond == 0; {757#false} is VALID [2018-11-14 17:22:16,906 INFO L273 TraceCheckUtils]: 47: Hoare triple {757#false} assume !false; {757#false} is VALID [2018-11-14 17:22:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:22:16,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:16,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 17:22:16,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-14 17:22:16,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:16,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:22:16,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:16,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:22:16,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:22:16,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:22:16,999 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 7 states. [2018-11-14 17:22:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:17,496 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-14 17:22:17,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:22:17,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-14 17:22:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:22:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2018-11-14 17:22:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:22:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2018-11-14 17:22:17,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2018-11-14 17:22:17,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:17,731 INFO L225 Difference]: With dead ends: 57 [2018-11-14 17:22:17,731 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 17:22:17,732 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:22:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 17:22:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-14 17:22:17,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:17,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-14 17:22:17,784 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-14 17:22:17,784 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-14 17:22:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:17,788 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-14 17:22:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 17:22:17,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:17,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:17,790 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-14 17:22:17,790 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-14 17:22:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:17,794 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-14 17:22:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 17:22:17,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:17,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:17,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:17,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 17:22:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-14 17:22:17,799 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 48 [2018-11-14 17:22:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:17,799 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-14 17:22:17,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:22:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-14 17:22:17,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 17:22:17,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:17,801 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:17,802 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:17,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:17,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1846463888, now seen corresponding path program 1 times [2018-11-14 17:22:17,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:17,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:17,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:19,026 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:316) 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) [2018-11-14 17:22:19,031 INFO L168 Benchmark]: Toolchain (without parser) took 9768.59 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 878.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -882.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:22:19,033 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:22:19,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.5 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:19,034 INFO L168 Benchmark]: Boogie Preprocessor took 73.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:19,035 INFO L168 Benchmark]: RCFGBuilder took 981.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:19,036 INFO L168 Benchmark]: TraceAbstraction took 8037.20 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 137.9 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -156.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:22:19,040 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 671.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.5 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 981.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8037.20 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 137.9 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -156.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...