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-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:50:40,939 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:50:40,946 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:50:40,958 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:50:40,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:50:40,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:50:40,961 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:50:40,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:50:40,964 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:50:40,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:50:40,966 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:50:40,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:50:40,967 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:50:40,968 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:50:40,969 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:50:40,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:50:40,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:50:40,973 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:50:40,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:50:40,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:50:40,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:50:40,979 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:50:40,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:50:40,985 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:50:40,985 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:50:40,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:50:40,990 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:50:40,991 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:50:40,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:50:40,993 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:50:40,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:50:40,998 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:50:40,998 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:50:40,998 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:50:41,001 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:50:41,002 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:50:41,002 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-18 23:50:41,031 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:50:41,031 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:50:41,035 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:50:41,035 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:50:41,036 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:50:41,036 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:50:41,036 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:50:41,036 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:50:41,036 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:50:41,038 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:50:41,038 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:50:41,038 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:50:41,038 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:50:41,038 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:50:41,039 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:50:41,039 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:50:41,039 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:50:41,039 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:50:41,039 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:50:41,039 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:50:41,041 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:50:41,041 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:50:41,041 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:50:41,041 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:50:41,042 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:50:41,042 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:50:41,042 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:50:41,042 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:50:41,042 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:50:41,042 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:50:41,043 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:50:41,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:50:41,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:50:41,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:50:41,124 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:50:41,125 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:50:41,125 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-18 23:50:41,188 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b2580d0/95699126d36b4848b18608e459b1a8ac/FLAG118df5307 [2018-11-18 23:50:41,774 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:50:41,774 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-18 23:50:41,788 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b2580d0/95699126d36b4848b18608e459b1a8ac/FLAG118df5307 [2018-11-18 23:50:42,005 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b2580d0/95699126d36b4848b18608e459b1a8ac [2018-11-18 23:50:42,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:50:42,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:50:42,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:50:42,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:50:42,022 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:50:42,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:50:42" (1/1) ... [2018-11-18 23:50:42,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5e625b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:42, skipping insertion in model container [2018-11-18 23:50:42,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:50:42" (1/1) ... [2018-11-18 23:50:42,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:50:42,109 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:50:42,533 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:50:42,546 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:50:42,619 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:50:42,767 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:50:42,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:42 WrapperNode [2018-11-18 23:50:42,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:50:42,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:50:42,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:50:42,769 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:50:42,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:42" (1/1) ... [2018-11-18 23:50:42,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:42" (1/1) ... [2018-11-18 23:50:42,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:42" (1/1) ... [2018-11-18 23:50:42,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:42" (1/1) ... [2018-11-18 23:50:42,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:42" (1/1) ... [2018-11-18 23:50:42,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:42" (1/1) ... [2018-11-18 23:50:42,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:42" (1/1) ... [2018-11-18 23:50:42,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:50:42,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:50:42,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:50:42,845 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:50:42,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:42" (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-18 23:50:42,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:50:42,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:50:42,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 23:50:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 23:50:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 23:50:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 23:50:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-18 23:50:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2018-11-18 23:50:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:50:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:50:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 23:50:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 23:50:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 23:50:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 23:50:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 23:50:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 23:50:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 23:50:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 23:50:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 23:50:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 23:50:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 23:50:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 23:50:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 23:50:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 23:50:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 23:50:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 23:50:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 23:50:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 23:50:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 23:50:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 23:50:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 23:50:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 23:50:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 23:50:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 23:50:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 23:50:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 23:50:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 23:50:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 23:50:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 23:50:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 23:50:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 23:50:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 23:50:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 23:50:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 23:50:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 23:50:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 23:50:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 23:50:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 23:50:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 23:50:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 23:50:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 23:50:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 23:50:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 23:50:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 23:50:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 23:50:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 23:50:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 23:50:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 23:50:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 23:50:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 23:50:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 23:50:42,912 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 23:50:42,912 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 23:50:42,912 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 23:50:42,912 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 23:50:42,912 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 23:50:42,912 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 23:50:42,912 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 23:50:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 23:50:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 23:50:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 23:50:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 23:50:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 23:50:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 23:50:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 23:50:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 23:50:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 23:50:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 23:50:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 23:50:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 23:50:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 23:50:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 23:50:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 23:50:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 23:50:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 23:50:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 23:50:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 23:50:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 23:50:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 23:50:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 23:50:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 23:50:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 23:50:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 23:50:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 23:50:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 23:50:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 23:50:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 23:50:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 23:50:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 23:50:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 23:50:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 23:50:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 23:50:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 23:50:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 23:50:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 23:50:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 23:50:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 23:50:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 23:50:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 23:50:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 23:50:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 23:50:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 23:50:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 23:50:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 23:50:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 23:50:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 23:50:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:50:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 23:50:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:50:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-18 23:50:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2018-11-18 23:50:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 23:50:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:50:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:50:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:50:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:50:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:50:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:50:44,000 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:50:44,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:50:44 BoogieIcfgContainer [2018-11-18 23:50:44,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:50:44,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:50:44,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:50:44,005 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:50:44,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:50:42" (1/3) ... [2018-11-18 23:50:44,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d9075d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:50:44, skipping insertion in model container [2018-11-18 23:50:44,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:50:42" (2/3) ... [2018-11-18 23:50:44,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d9075d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:50:44, skipping insertion in model container [2018-11-18 23:50:44,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:50:44" (3/3) ... [2018-11-18 23:50:44,009 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-18 23:50:44,018 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:50:44,025 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:50:44,042 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:50:44,088 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:50:44,089 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:50:44,089 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:50:44,089 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:50:44,090 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:50:44,091 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:50:44,091 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:50:44,091 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:50:44,091 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:50:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-18 23:50:44,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:50:44,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:50:44,128 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:50:44,131 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:50:44,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:50:44,137 INFO L82 PathProgramCache]: Analyzing trace with hash 146580837, now seen corresponding path program 1 times [2018-11-18 23:50:44,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:50:44,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:50:44,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:50:44,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:50:44,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:50:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:50:44,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2018-11-18 23:50:44,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {41#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41#true} is VALID [2018-11-18 23:50:44,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-18 23:50:44,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #99#return; {41#true} is VALID [2018-11-18 23:50:44,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret11 := main(); {41#true} is VALID [2018-11-18 23:50:44,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, ~#s~0.base, ~#s~0.offset, 4); {41#true} is VALID [2018-11-18 23:50:44,350 INFO L256 TraceCheckUtils]: 6: Hoare triple {41#true} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {41#true} is VALID [2018-11-18 23:50:44,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {41#true} is VALID [2018-11-18 23:50:44,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {41#true} assume !true; {42#false} is VALID [2018-11-18 23:50:44,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {42#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {42#false} is VALID [2018-11-18 23:50:44,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {42#false} assume true; {42#false} is VALID [2018-11-18 23:50:44,360 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {42#false} {41#true} #93#return; {42#false} is VALID [2018-11-18 23:50:44,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {42#false} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {42#false} is VALID [2018-11-18 23:50:44,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {42#false} assume !true; {42#false} is VALID [2018-11-18 23:50:44,361 INFO L273 TraceCheckUtils]: 14: Hoare triple {42#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {42#false} is VALID [2018-11-18 23:50:44,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {42#false} is VALID [2018-11-18 23:50:44,362 INFO L273 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2018-11-18 23:50:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:50:44,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:50:44,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:50:44,373 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 23:50:44,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:50:44,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:50:44,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:50:44,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:50:44,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:50:44,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:50:44,530 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-18 23:50:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:44,863 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-18 23:50:44,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:50:44,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 23:50:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:50:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:50:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2018-11-18 23:50:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:50:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2018-11-18 23:50:44,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2018-11-18 23:50:45,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:50:45,487 INFO L225 Difference]: With dead ends: 59 [2018-11-18 23:50:45,487 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 23:50:45,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:50:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 23:50:45,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 23:50:45,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:50:45,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-18 23:50:45,533 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 23:50:45,533 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 23:50:45,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:45,538 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-18 23:50:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-18 23:50:45,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:50:45,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:50:45,540 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 23:50:45,540 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 23:50:45,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:45,545 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-18 23:50:45,545 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-18 23:50:45,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:50:45,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:50:45,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:50:45,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:50:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 23:50:45,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-18 23:50:45,551 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 17 [2018-11-18 23:50:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:50:45,552 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-18 23:50:45,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:50:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-18 23:50:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 23:50:45,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:50:45,553 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:50:45,554 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:50:45,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:50:45,554 INFO L82 PathProgramCache]: Analyzing trace with hash 388380852, now seen corresponding path program 1 times [2018-11-18 23:50:45,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:50:45,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:50:45,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:50:45,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:50:45,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:50:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:50:45,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2018-11-18 23:50:45,693 INFO L273 TraceCheckUtils]: 1: Hoare triple {225#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {225#true} is VALID [2018-11-18 23:50:45,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2018-11-18 23:50:45,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #99#return; {225#true} is VALID [2018-11-18 23:50:45,693 INFO L256 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret11 := main(); {225#true} is VALID [2018-11-18 23:50:45,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {225#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, ~#s~0.base, ~#s~0.offset, 4); {227#(<= 2 main_~len~0)} is VALID [2018-11-18 23:50:45,695 INFO L256 TraceCheckUtils]: 6: Hoare triple {227#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {225#true} is VALID [2018-11-18 23:50:45,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {225#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {225#true} is VALID [2018-11-18 23:50:45,695 INFO L273 TraceCheckUtils]: 8: Hoare triple {225#true} assume true; {225#true} is VALID [2018-11-18 23:50:45,695 INFO L273 TraceCheckUtils]: 9: Hoare triple {225#true} assume !(~len > 0); {225#true} is VALID [2018-11-18 23:50:45,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {225#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {225#true} is VALID [2018-11-18 23:50:45,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {225#true} assume true; {225#true} is VALID [2018-11-18 23:50:45,698 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {225#true} {227#(<= 2 main_~len~0)} #93#return; {227#(<= 2 main_~len~0)} is VALID [2018-11-18 23:50:45,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {227#(<= 2 main_~len~0)} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {228#(<= 1 main_~i~0)} is VALID [2018-11-18 23:50:45,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {228#(<= 1 main_~i~0)} assume true; {228#(<= 1 main_~i~0)} is VALID [2018-11-18 23:50:45,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {228#(<= 1 main_~i~0)} assume !(~i~0 >= 0); {226#false} is VALID [2018-11-18 23:50:45,701 INFO L273 TraceCheckUtils]: 16: Hoare triple {226#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {226#false} is VALID [2018-11-18 23:50:45,701 INFO L273 TraceCheckUtils]: 17: Hoare triple {226#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {226#false} is VALID [2018-11-18 23:50:45,702 INFO L273 TraceCheckUtils]: 18: Hoare triple {226#false} assume !false; {226#false} is VALID [2018-11-18 23:50:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:50:45,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:50:45,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:50:45,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-18 23:50:45,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:50:45,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:50:45,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:50:45,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:50:45,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:50:45,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:50:45,762 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2018-11-18 23:50:46,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:46,044 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-18 23:50:46,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:50:46,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-18 23:50:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:50:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:50:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-18 23:50:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:50:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-18 23:50:46,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2018-11-18 23:50:46,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:50:46,204 INFO L225 Difference]: With dead ends: 39 [2018-11-18 23:50:46,205 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 23:50:46,206 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:50:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 23:50:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-18 23:50:46,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:50:46,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2018-11-18 23:50:46,234 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2018-11-18 23:50:46,234 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2018-11-18 23:50:46,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:46,239 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-18 23:50:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-18 23:50:46,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:50:46,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:50:46,240 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2018-11-18 23:50:46,240 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2018-11-18 23:50:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:46,244 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-18 23:50:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-18 23:50:46,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:50:46,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:50:46,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:50:46,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:50:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 23:50:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-18 23:50:46,248 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 19 [2018-11-18 23:50:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:50:46,248 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-18 23:50:46,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:50:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-18 23:50:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 23:50:46,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:50:46,251 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 23:50:46,251 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:50:46,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:50:46,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1535376639, now seen corresponding path program 1 times [2018-11-18 23:50:46,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:50:46,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:50:46,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:50:46,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:50:46,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:50:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:50:46,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {401#true} call ULTIMATE.init(); {401#true} is VALID [2018-11-18 23:50:46,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {401#true} is VALID [2018-11-18 23:50:46,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {401#true} assume true; {401#true} is VALID [2018-11-18 23:50:46,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {401#true} {401#true} #99#return; {401#true} is VALID [2018-11-18 23:50:46,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {401#true} call #t~ret11 := main(); {401#true} is VALID [2018-11-18 23:50:46,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {401#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, ~#s~0.base, ~#s~0.offset, 4); {403#(<= 2 main_~len~0)} is VALID [2018-11-18 23:50:46,399 INFO L256 TraceCheckUtils]: 6: Hoare triple {403#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {401#true} is VALID [2018-11-18 23:50:46,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {401#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {404#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-18 23:50:46,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {404#(<= |dll_create_#in~len| dll_create_~len)} assume true; {404#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-18 23:50:46,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {404#(<= |dll_create_#in~len| dll_create_~len)} assume !(~len > 0); {405#(<= |dll_create_#in~len| 0)} is VALID [2018-11-18 23:50:46,408 INFO L273 TraceCheckUtils]: 10: Hoare triple {405#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {405#(<= |dll_create_#in~len| 0)} is VALID [2018-11-18 23:50:46,410 INFO L273 TraceCheckUtils]: 11: Hoare triple {405#(<= |dll_create_#in~len| 0)} assume true; {405#(<= |dll_create_#in~len| 0)} is VALID [2018-11-18 23:50:46,412 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {405#(<= |dll_create_#in~len| 0)} {403#(<= 2 main_~len~0)} #93#return; {402#false} is VALID [2018-11-18 23:50:46,412 INFO L273 TraceCheckUtils]: 13: Hoare triple {402#false} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {402#false} is VALID [2018-11-18 23:50:46,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-18 23:50:46,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {402#false} assume !!(~i~0 >= 0); {402#false} is VALID [2018-11-18 23:50:46,414 INFO L256 TraceCheckUtils]: 16: Hoare triple {402#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {401#true} is VALID [2018-11-18 23:50:46,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {401#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {401#true} is VALID [2018-11-18 23:50:46,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {401#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {401#true} is VALID [2018-11-18 23:50:46,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {401#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {401#true} is VALID [2018-11-18 23:50:46,416 INFO L273 TraceCheckUtils]: 20: Hoare triple {401#true} assume true; {401#true} is VALID [2018-11-18 23:50:46,416 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {401#true} {402#false} #95#return; {402#false} is VALID [2018-11-18 23:50:46,416 INFO L273 TraceCheckUtils]: 22: Hoare triple {402#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {402#false} is VALID [2018-11-18 23:50:46,417 INFO L273 TraceCheckUtils]: 23: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-18 23:50:46,417 INFO L273 TraceCheckUtils]: 24: Hoare triple {402#false} assume !(~i~0 >= 0); {402#false} is VALID [2018-11-18 23:50:46,417 INFO L273 TraceCheckUtils]: 25: Hoare triple {402#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {402#false} is VALID [2018-11-18 23:50:46,418 INFO L273 TraceCheckUtils]: 26: Hoare triple {402#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {402#false} is VALID [2018-11-18 23:50:46,418 INFO L273 TraceCheckUtils]: 27: Hoare triple {402#false} assume !false; {402#false} is VALID [2018-11-18 23:50:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 23:50:46,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:50:46,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 23:50:46,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-18 23:50:46,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:50:46,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:50:46,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:50:46,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:50:46,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:50:46,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:50:46,516 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 5 states. [2018-11-18 23:50:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:46,775 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-18 23:50:46,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:50:46,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-18 23:50:46,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:50:46,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:50:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-18 23:50:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:50:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-18 23:50:46,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2018-11-18 23:50:46,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:50:46,876 INFO L225 Difference]: With dead ends: 58 [2018-11-18 23:50:46,876 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 23:50:46,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:50:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 23:50:46,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-18 23:50:46,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:50:46,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 35 states. [2018-11-18 23:50:46,913 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 35 states. [2018-11-18 23:50:46,913 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 35 states. [2018-11-18 23:50:46,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:46,917 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-18 23:50:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-18 23:50:46,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:50:46,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:50:46,918 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 39 states. [2018-11-18 23:50:46,919 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 39 states. [2018-11-18 23:50:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:46,921 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-18 23:50:46,922 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-18 23:50:46,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:50:46,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:50:46,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:50:46,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:50:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 23:50:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-18 23:50:46,926 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 28 [2018-11-18 23:50:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:50:46,926 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-18 23:50:46,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:50:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-18 23:50:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 23:50:46,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:50:46,928 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 23:50:46,928 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:50:46,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:50:46,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1146429781, now seen corresponding path program 1 times [2018-11-18 23:50:46,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:50:46,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:50:46,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:50:46,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:50:46,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:50:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:50:47,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {612#true} call ULTIMATE.init(); {612#true} is VALID [2018-11-18 23:50:47,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {612#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {612#true} is VALID [2018-11-18 23:50:47,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-18 23:50:47,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {612#true} {612#true} #99#return; {612#true} is VALID [2018-11-18 23:50:47,018 INFO L256 TraceCheckUtils]: 4: Hoare triple {612#true} call #t~ret11 := main(); {612#true} is VALID [2018-11-18 23:50:47,018 INFO L273 TraceCheckUtils]: 5: Hoare triple {612#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, ~#s~0.base, ~#s~0.offset, 4); {612#true} is VALID [2018-11-18 23:50:47,018 INFO L256 TraceCheckUtils]: 6: Hoare triple {612#true} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {612#true} is VALID [2018-11-18 23:50:47,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {612#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {614#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-18 23:50:47,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {614#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume true; {614#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-18 23:50:47,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {614#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {614#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-18 23:50:47,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {614#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {614#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-18 23:50:47,025 INFO L273 TraceCheckUtils]: 11: Hoare triple {614#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {614#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-18 23:50:47,027 INFO L273 TraceCheckUtils]: 12: Hoare triple {614#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {613#false} is VALID [2018-11-18 23:50:47,027 INFO L273 TraceCheckUtils]: 13: Hoare triple {613#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {613#false} is VALID [2018-11-18 23:50:47,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {613#false} assume true; {613#false} is VALID [2018-11-18 23:50:47,027 INFO L273 TraceCheckUtils]: 15: Hoare triple {613#false} assume !(~len > 0); {613#false} is VALID [2018-11-18 23:50:47,028 INFO L273 TraceCheckUtils]: 16: Hoare triple {613#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {613#false} is VALID [2018-11-18 23:50:47,028 INFO L273 TraceCheckUtils]: 17: Hoare triple {613#false} assume true; {613#false} is VALID [2018-11-18 23:50:47,028 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {613#false} {612#true} #93#return; {613#false} is VALID [2018-11-18 23:50:47,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {613#false} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {613#false} is VALID [2018-11-18 23:50:47,029 INFO L273 TraceCheckUtils]: 20: Hoare triple {613#false} assume true; {613#false} is VALID [2018-11-18 23:50:47,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {613#false} assume !!(~i~0 >= 0); {613#false} is VALID [2018-11-18 23:50:47,029 INFO L256 TraceCheckUtils]: 22: Hoare triple {613#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {612#true} is VALID [2018-11-18 23:50:47,030 INFO L273 TraceCheckUtils]: 23: Hoare triple {612#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {612#true} is VALID [2018-11-18 23:50:47,030 INFO L273 TraceCheckUtils]: 24: Hoare triple {612#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {612#true} is VALID [2018-11-18 23:50:47,030 INFO L273 TraceCheckUtils]: 25: Hoare triple {612#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {612#true} is VALID [2018-11-18 23:50:47,031 INFO L273 TraceCheckUtils]: 26: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-18 23:50:47,031 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {612#true} {613#false} #95#return; {613#false} is VALID [2018-11-18 23:50:47,031 INFO L273 TraceCheckUtils]: 28: Hoare triple {613#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {613#false} is VALID [2018-11-18 23:50:47,031 INFO L273 TraceCheckUtils]: 29: Hoare triple {613#false} assume true; {613#false} is VALID [2018-11-18 23:50:47,031 INFO L273 TraceCheckUtils]: 30: Hoare triple {613#false} assume !(~i~0 >= 0); {613#false} is VALID [2018-11-18 23:50:47,032 INFO L273 TraceCheckUtils]: 31: Hoare triple {613#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {613#false} is VALID [2018-11-18 23:50:47,032 INFO L273 TraceCheckUtils]: 32: Hoare triple {613#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {613#false} is VALID [2018-11-18 23:50:47,032 INFO L273 TraceCheckUtils]: 33: Hoare triple {613#false} assume !false; {613#false} is VALID [2018-11-18 23:50:47,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 23:50:47,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:50:47,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:50:47,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 23:50:47,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:50:47,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:50:47,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:50:47,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:50:47,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:50:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:50:47,106 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 3 states. [2018-11-18 23:50:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:47,251 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-18 23:50:47,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:50:47,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 23:50:47,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:50:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:50:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2018-11-18 23:50:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:50:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2018-11-18 23:50:47,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2018-11-18 23:50:47,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:50:47,389 INFO L225 Difference]: With dead ends: 64 [2018-11-18 23:50:47,389 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 23:50:47,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:50:47,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 23:50:47,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-18 23:50:47,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:50:47,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-18 23:50:47,419 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-18 23:50:47,419 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-18 23:50:47,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:47,422 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-18 23:50:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-18 23:50:47,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:50:47,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:50:47,423 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-18 23:50:47,423 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-18 23:50:47,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:47,426 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-18 23:50:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-18 23:50:47,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:50:47,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:50:47,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:50:47,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:50:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 23:50:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-18 23:50:47,429 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 34 [2018-11-18 23:50:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:50:47,430 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-18 23:50:47,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:50:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-18 23:50:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 23:50:47,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:50:47,432 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 23:50:47,432 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:50:47,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:50:47,432 INFO L82 PathProgramCache]: Analyzing trace with hash -927575063, now seen corresponding path program 1 times [2018-11-18 23:50:47,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:50:47,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:50:47,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:50:47,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:50:47,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:50:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:50:47,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {829#true} is VALID [2018-11-18 23:50:47,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {829#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {829#true} is VALID [2018-11-18 23:50:47,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {829#true} assume true; {829#true} is VALID [2018-11-18 23:50:47,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} #99#return; {829#true} is VALID [2018-11-18 23:50:47,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {829#true} call #t~ret11 := main(); {829#true} is VALID [2018-11-18 23:50:47,602 INFO L273 TraceCheckUtils]: 5: Hoare triple {829#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, ~#s~0.base, ~#s~0.offset, 4); {831#(<= 2 main_~len~0)} is VALID [2018-11-18 23:50:47,603 INFO L256 TraceCheckUtils]: 6: Hoare triple {831#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {829#true} is VALID [2018-11-18 23:50:47,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {829#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {829#true} is VALID [2018-11-18 23:50:47,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {829#true} assume true; {829#true} is VALID [2018-11-18 23:50:47,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {829#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {829#true} is VALID [2018-11-18 23:50:47,604 INFO L273 TraceCheckUtils]: 10: Hoare triple {829#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {829#true} is VALID [2018-11-18 23:50:47,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {829#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {829#true} is VALID [2018-11-18 23:50:47,604 INFO L273 TraceCheckUtils]: 12: Hoare triple {829#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {829#true} is VALID [2018-11-18 23:50:47,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {829#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {829#true} is VALID [2018-11-18 23:50:47,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {829#true} assume true; {829#true} is VALID [2018-11-18 23:50:47,605 INFO L273 TraceCheckUtils]: 15: Hoare triple {829#true} assume !(~len > 0); {829#true} is VALID [2018-11-18 23:50:47,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {829#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {829#true} is VALID [2018-11-18 23:50:47,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {829#true} assume true; {829#true} is VALID [2018-11-18 23:50:47,610 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {829#true} {831#(<= 2 main_~len~0)} #93#return; {831#(<= 2 main_~len~0)} is VALID [2018-11-18 23:50:47,612 INFO L273 TraceCheckUtils]: 19: Hoare triple {831#(<= 2 main_~len~0)} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {832#(<= 1 main_~i~0)} is VALID [2018-11-18 23:50:47,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {832#(<= 1 main_~i~0)} assume true; {832#(<= 1 main_~i~0)} is VALID [2018-11-18 23:50:47,615 INFO L273 TraceCheckUtils]: 21: Hoare triple {832#(<= 1 main_~i~0)} assume !!(~i~0 >= 0); {832#(<= 1 main_~i~0)} is VALID [2018-11-18 23:50:47,615 INFO L256 TraceCheckUtils]: 22: Hoare triple {832#(<= 1 main_~i~0)} call dll_remove_first(~#s~0.base, ~#s~0.offset); {829#true} is VALID [2018-11-18 23:50:47,616 INFO L273 TraceCheckUtils]: 23: Hoare triple {829#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {829#true} is VALID [2018-11-18 23:50:47,616 INFO L273 TraceCheckUtils]: 24: Hoare triple {829#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {829#true} is VALID [2018-11-18 23:50:47,616 INFO L273 TraceCheckUtils]: 25: Hoare triple {829#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {829#true} is VALID [2018-11-18 23:50:47,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {829#true} assume true; {829#true} is VALID [2018-11-18 23:50:47,626 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {829#true} {832#(<= 1 main_~i~0)} #95#return; {832#(<= 1 main_~i~0)} is VALID [2018-11-18 23:50:47,632 INFO L273 TraceCheckUtils]: 28: Hoare triple {832#(<= 1 main_~i~0)} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {833#(<= 0 main_~i~0)} is VALID [2018-11-18 23:50:47,634 INFO L273 TraceCheckUtils]: 29: Hoare triple {833#(<= 0 main_~i~0)} assume true; {833#(<= 0 main_~i~0)} is VALID [2018-11-18 23:50:47,637 INFO L273 TraceCheckUtils]: 30: Hoare triple {833#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {830#false} is VALID [2018-11-18 23:50:47,637 INFO L273 TraceCheckUtils]: 31: Hoare triple {830#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {830#false} is VALID [2018-11-18 23:50:47,638 INFO L273 TraceCheckUtils]: 32: Hoare triple {830#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {830#false} is VALID [2018-11-18 23:50:47,638 INFO L273 TraceCheckUtils]: 33: Hoare triple {830#false} assume !false; {830#false} is VALID [2018-11-18 23:50:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 23:50:47,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:50:47,640 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-18 23:50:47,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:50:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:50:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:50:47,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:50:48,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {829#true} is VALID [2018-11-18 23:50:48,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {829#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {829#true} is VALID [2018-11-18 23:50:48,123 INFO L273 TraceCheckUtils]: 2: Hoare triple {829#true} assume true; {829#true} is VALID [2018-11-18 23:50:48,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} #99#return; {829#true} is VALID [2018-11-18 23:50:48,124 INFO L256 TraceCheckUtils]: 4: Hoare triple {829#true} call #t~ret11 := main(); {829#true} is VALID [2018-11-18 23:50:48,124 INFO L273 TraceCheckUtils]: 5: Hoare triple {829#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, ~#s~0.base, ~#s~0.offset, 4); {831#(<= 2 main_~len~0)} is VALID [2018-11-18 23:50:48,125 INFO L256 TraceCheckUtils]: 6: Hoare triple {831#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {829#true} is VALID [2018-11-18 23:50:48,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {829#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {858#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-18 23:50:48,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {858#(<= |dll_create_#in~len| dll_create_~len)} assume true; {858#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-18 23:50:48,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {858#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {858#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-18 23:50:48,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {858#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {858#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-18 23:50:48,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {858#(<= |dll_create_#in~len| dll_create_~len)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {858#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-18 23:50:48,128 INFO L273 TraceCheckUtils]: 12: Hoare triple {858#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {858#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-18 23:50:48,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {858#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {877#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-18 23:50:48,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {877#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume true; {877#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-18 23:50:48,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {877#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {884#(<= |dll_create_#in~len| 1)} is VALID [2018-11-18 23:50:48,131 INFO L273 TraceCheckUtils]: 16: Hoare triple {884#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {884#(<= |dll_create_#in~len| 1)} is VALID [2018-11-18 23:50:48,132 INFO L273 TraceCheckUtils]: 17: Hoare triple {884#(<= |dll_create_#in~len| 1)} assume true; {884#(<= |dll_create_#in~len| 1)} is VALID [2018-11-18 23:50:48,134 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {884#(<= |dll_create_#in~len| 1)} {831#(<= 2 main_~len~0)} #93#return; {830#false} is VALID [2018-11-18 23:50:48,134 INFO L273 TraceCheckUtils]: 19: Hoare triple {830#false} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {830#false} is VALID [2018-11-18 23:50:48,134 INFO L273 TraceCheckUtils]: 20: Hoare triple {830#false} assume true; {830#false} is VALID [2018-11-18 23:50:48,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {830#false} assume !!(~i~0 >= 0); {830#false} is VALID [2018-11-18 23:50:48,135 INFO L256 TraceCheckUtils]: 22: Hoare triple {830#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {830#false} is VALID [2018-11-18 23:50:48,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {830#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {830#false} is VALID [2018-11-18 23:50:48,136 INFO L273 TraceCheckUtils]: 24: Hoare triple {830#false} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {830#false} is VALID [2018-11-18 23:50:48,136 INFO L273 TraceCheckUtils]: 25: Hoare triple {830#false} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {830#false} is VALID [2018-11-18 23:50:48,136 INFO L273 TraceCheckUtils]: 26: Hoare triple {830#false} assume true; {830#false} is VALID [2018-11-18 23:50:48,137 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {830#false} {830#false} #95#return; {830#false} is VALID [2018-11-18 23:50:48,137 INFO L273 TraceCheckUtils]: 28: Hoare triple {830#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {830#false} is VALID [2018-11-18 23:50:48,137 INFO L273 TraceCheckUtils]: 29: Hoare triple {830#false} assume true; {830#false} is VALID [2018-11-18 23:50:48,137 INFO L273 TraceCheckUtils]: 30: Hoare triple {830#false} assume !(~i~0 >= 0); {830#false} is VALID [2018-11-18 23:50:48,138 INFO L273 TraceCheckUtils]: 31: Hoare triple {830#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {830#false} is VALID [2018-11-18 23:50:48,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {830#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {830#false} is VALID [2018-11-18 23:50:48,138 INFO L273 TraceCheckUtils]: 33: Hoare triple {830#false} assume !false; {830#false} is VALID [2018-11-18 23:50:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 23:50:48,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:50:48,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-18 23:50:48,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-18 23:50:48,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:50:48,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 23:50:48,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:50:48,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 23:50:48,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 23:50:48,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:50:48,352 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 8 states. [2018-11-18 23:50:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:48,969 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2018-11-18 23:50:48,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 23:50:48,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-18 23:50:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:50:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:50:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2018-11-18 23:50:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:50:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2018-11-18 23:50:48,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2018-11-18 23:50:49,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:50:49,137 INFO L225 Difference]: With dead ends: 68 [2018-11-18 23:50:49,137 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 23:50:49,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:50:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 23:50:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-18 23:50:49,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:50:49,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 45 states. [2018-11-18 23:50:49,215 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 45 states. [2018-11-18 23:50:49,215 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 45 states. [2018-11-18 23:50:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:49,218 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-18 23:50:49,219 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-18 23:50:49,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:50:49,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:50:49,220 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 49 states. [2018-11-18 23:50:49,220 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 49 states. [2018-11-18 23:50:49,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:50:49,223 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-18 23:50:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-18 23:50:49,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:50:49,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:50:49,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:50:49,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:50:49,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 23:50:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-18 23:50:49,231 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 34 [2018-11-18 23:50:49,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:50:49,231 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-18 23:50:49,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 23:50:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-18 23:50:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 23:50:49,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:50:49,233 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:50:49,233 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:50:49,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:50:49,234 INFO L82 PathProgramCache]: Analyzing trace with hash 212915390, now seen corresponding path program 1 times [2018-11-18 23:50:49,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:50:49,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:50:49,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:50:49,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:50:49,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:50:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:50:51,745 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-11-18 23:50:52,420 WARN L180 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-11-18 23:50:53,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {1192#true} call ULTIMATE.init(); {1192#true} is VALID [2018-11-18 23:50:53,525 INFO L273 TraceCheckUtils]: 1: Hoare triple {1192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1192#true} is VALID [2018-11-18 23:50:53,526 INFO L273 TraceCheckUtils]: 2: Hoare triple {1192#true} assume true; {1192#true} is VALID [2018-11-18 23:50:53,526 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1192#true} {1192#true} #99#return; {1192#true} is VALID [2018-11-18 23:50:53,526 INFO L256 TraceCheckUtils]: 4: Hoare triple {1192#true} call #t~ret11 := main(); {1192#true} is VALID [2018-11-18 23:50:53,527 INFO L273 TraceCheckUtils]: 5: Hoare triple {1192#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, ~#s~0.base, ~#s~0.offset, 4); {1194#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2018-11-18 23:50:53,528 INFO L256 TraceCheckUtils]: 6: Hoare triple {1194#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1195#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 23:50:53,528 INFO L273 TraceCheckUtils]: 7: Hoare triple {1195#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1196#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0) (= |#valid| |old(#valid)|))} is VALID [2018-11-18 23:50:53,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {1196#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0) (= |#valid| |old(#valid)|))} assume true; {1196#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0) (= |#valid| |old(#valid)|))} is VALID [2018-11-18 23:50:53,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {1196#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0) (= |#valid| |old(#valid)|))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1197#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= (select |#valid| dll_create_~new_head~0.base) 1) (= 0 dll_create_~new_head~0.offset) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-18 23:50:53,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {1197#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= (select |#valid| dll_create_~new_head~0.base) 1) (= 0 dll_create_~new_head~0.offset) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1197#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= (select |#valid| dll_create_~new_head~0.base) 1) (= 0 dll_create_~new_head~0.offset) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-18 23:50:53,553 INFO L273 TraceCheckUtils]: 11: Hoare triple {1197#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= (select |#valid| dll_create_~new_head~0.base) 1) (= 0 dll_create_~new_head~0.offset) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1198#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select |#valid| dll_create_~new_head~0.base) 1) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-18 23:50:53,568 INFO L273 TraceCheckUtils]: 12: Hoare triple {1198#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select |#valid| dll_create_~new_head~0.base) 1) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1199#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select |#valid| dll_create_~new_head~0.base) 1) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-18 23:50:53,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {1199#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select |#valid| dll_create_~new_head~0.base) 1) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1200#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= (select |#valid| dll_create_~head~0.base) 1) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-18 23:50:53,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {1200#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= (select |#valid| dll_create_~head~0.base) 1) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1200#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= (select |#valid| dll_create_~head~0.base) 1) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-18 23:50:53,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {1200#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= (select |#valid| dll_create_~head~0.base) 1) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1201#(and (= 0 (select (select (store |#memory_$Pointer$.offset| dll_create_~new_head~0.base (store (store (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4) dll_create_~head~0.offset) (+ dll_create_~new_head~0.offset 8) 0)) dll_create_~head~0.base) 4)) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.base| dll_create_~new_head~0.base (store (store (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4) dll_create_~head~0.base) (+ dll_create_~new_head~0.offset 8) 0)) dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2018-11-18 23:50:53,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {1201#(and (= 0 (select (select (store |#memory_$Pointer$.offset| dll_create_~new_head~0.base (store (store (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4) dll_create_~head~0.offset) (+ dll_create_~new_head~0.offset 8) 0)) dll_create_~head~0.base) 4)) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.base| dll_create_~new_head~0.base (store (store (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4) dll_create_~head~0.base) (+ dll_create_~new_head~0.offset 8) 0)) dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1201#(and (= 0 (select (select (store |#memory_$Pointer$.offset| dll_create_~new_head~0.base (store (store (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4) dll_create_~head~0.offset) (+ dll_create_~new_head~0.offset 8) 0)) dll_create_~head~0.base) 4)) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.base| dll_create_~new_head~0.base (store (store (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4) dll_create_~head~0.base) (+ dll_create_~new_head~0.offset 8) 0)) dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2018-11-18 23:50:53,589 INFO L273 TraceCheckUtils]: 17: Hoare triple {1201#(and (= 0 (select (select (store |#memory_$Pointer$.offset| dll_create_~new_head~0.base (store (store (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4) dll_create_~head~0.offset) (+ dll_create_~new_head~0.offset 8) 0)) dll_create_~head~0.base) 4)) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.base| dll_create_~new_head~0.base (store (store (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4) dll_create_~head~0.base) (+ dll_create_~new_head~0.offset 8) 0)) dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1202#(and (= 0 (select (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base) 4)) (= 0 (select (select (store |#memory_$Pointer$.offset| dll_create_~head~0.base (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset) 4)) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= dll_create_~head~0.base (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2018-11-18 23:50:53,591 INFO L273 TraceCheckUtils]: 18: Hoare triple {1202#(and (= 0 (select (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base) 4)) (= 0 (select (select (store |#memory_$Pointer$.offset| dll_create_~head~0.base (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset) 4)) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= dll_create_~head~0.base (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1203#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))))} is VALID [2018-11-18 23:50:53,592 INFO L273 TraceCheckUtils]: 19: Hoare triple {1203#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1204#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} is VALID [2018-11-18 23:50:53,594 INFO L273 TraceCheckUtils]: 20: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} assume true; {1204#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} is VALID [2018-11-18 23:50:53,595 INFO L273 TraceCheckUtils]: 21: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} assume !(~len > 0); {1204#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} is VALID [2018-11-18 23:50:53,596 INFO L273 TraceCheckUtils]: 22: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1205#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= 0 (select |old(#valid)| |dll_create_#res.base|)) (= 0 |dll_create_#res.offset|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)))} is VALID [2018-11-18 23:50:53,597 INFO L273 TraceCheckUtils]: 23: Hoare triple {1205#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= 0 (select |old(#valid)| |dll_create_#res.base|)) (= 0 |dll_create_#res.offset|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)))} assume true; {1205#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= 0 (select |old(#valid)| |dll_create_#res.base|)) (= 0 |dll_create_#res.offset|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)))} is VALID [2018-11-18 23:50:53,601 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1205#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= 0 (select |old(#valid)| |dll_create_#res.base|)) (= 0 |dll_create_#res.offset|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)))} {1194#(= (select |#valid| |main_~#s~0.base|) 1)} #93#return; {1206#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret8.base|)) (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret8.base|)) |main_#t~ret8.base|) 4)) 4)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#s~0.base| (store (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret8.offset|)) (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret8.base|)) |main_#t~ret8.base|) 4)) 4)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#s~0.base| (store (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret8.offset|)) |main_#t~ret8.base|) 4)) (= 0 |main_#t~ret8.offset|) (not (= |main_~#s~0.base| (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret8.base|)) |main_#t~ret8.base|) 4))))} is VALID [2018-11-18 23:50:53,603 INFO L273 TraceCheckUtils]: 25: Hoare triple {1206#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret8.base|)) (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret8.base|)) |main_#t~ret8.base|) 4)) 4)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#s~0.base| (store (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret8.offset|)) (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret8.base|)) |main_#t~ret8.base|) 4)) 4)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#s~0.base| (store (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret8.offset|)) |main_#t~ret8.base|) 4)) (= 0 |main_#t~ret8.offset|) (not (= |main_~#s~0.base| (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret8.base|)) |main_#t~ret8.base|) 4))))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {1207#(and (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-18 23:50:53,604 INFO L273 TraceCheckUtils]: 26: Hoare triple {1207#(and (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume true; {1207#(and (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-18 23:50:53,606 INFO L273 TraceCheckUtils]: 27: Hoare triple {1207#(and (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume !!(~i~0 >= 0); {1207#(and (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-18 23:50:53,607 INFO L256 TraceCheckUtils]: 28: Hoare triple {1207#(and (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1208#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-18 23:50:53,609 INFO L273 TraceCheckUtils]: 29: Hoare triple {1208#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {1209#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (or (not (= dll_remove_first_~temp~1.base dll_remove_first_~head.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) |dll_remove_first_#in~head.base|)) (or (= dll_remove_first_~temp~1.base dll_remove_first_~head.base) (and (or (and (= dll_remove_first_~temp~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4))) (= (select |old(#memory_$Pointer$.offset)| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= dll_remove_first_~temp~1.offset 0)) (or (not (= dll_remove_first_~temp~1.offset 0)) (and (= dll_remove_first_~temp~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4))) (= (select |#memory_$Pointer$.offset| dll_remove_first_~temp~1.base) (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base))))))) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} is VALID [2018-11-18 23:50:53,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {1209#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (or (not (= dll_remove_first_~temp~1.base dll_remove_first_~head.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) |dll_remove_first_#in~head.base|)) (or (= dll_remove_first_~temp~1.base dll_remove_first_~head.base) (and (or (and (= dll_remove_first_~temp~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4))) (= (select |old(#memory_$Pointer$.offset)| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= dll_remove_first_~temp~1.offset 0)) (or (not (= dll_remove_first_~temp~1.offset 0)) (and (= dll_remove_first_~temp~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4))) (= (select |#memory_$Pointer$.offset| dll_remove_first_~temp~1.base) (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base))))))) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1210#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (or (= dll_remove_first_~temp~1.base dll_remove_first_~head.base) (and (or (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) 0)) (= dll_remove_first_~temp~1.offset 0)) (or (and (= (store (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8) (select (select (store |#memory_$Pointer$.base| dll_remove_first_~head.base (store (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.base)) dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8))) (select (store |#memory_$Pointer$.base| dll_remove_first_~head.base (store (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.base)) dll_remove_first_~temp~1.base)) (= (select (store |#memory_$Pointer$.offset| dll_remove_first_~head.base (store (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.offset)) dll_remove_first_~temp~1.base) (store (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8) (select (select (store |#memory_$Pointer$.offset| dll_remove_first_~head.base (store (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.offset)) dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8)))) (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4))) (not (= dll_remove_first_~temp~1.offset 0))))) (or (not (= dll_remove_first_~temp~1.base dll_remove_first_~head.base)) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) |dll_remove_first_#in~head.base|))) (not (= (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) 0))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} is VALID [2018-11-18 23:50:53,615 INFO L273 TraceCheckUtils]: 31: Hoare triple {1210#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (or (= dll_remove_first_~temp~1.base dll_remove_first_~head.base) (and (or (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) 0)) (= dll_remove_first_~temp~1.offset 0)) (or (and (= (store (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8) (select (select (store |#memory_$Pointer$.base| dll_remove_first_~head.base (store (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.base)) dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8))) (select (store |#memory_$Pointer$.base| dll_remove_first_~head.base (store (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.base)) dll_remove_first_~temp~1.base)) (= (select (store |#memory_$Pointer$.offset| dll_remove_first_~head.base (store (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.offset)) dll_remove_first_~temp~1.base) (store (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8) (select (select (store |#memory_$Pointer$.offset| dll_remove_first_~head.base (store (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.offset)) dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8)))) (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4))) (not (= dll_remove_first_~temp~1.offset 0))))) (or (not (= dll_remove_first_~temp~1.base dll_remove_first_~head.base)) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) |dll_remove_first_#in~head.base|))) (not (= (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) 0))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1211#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) |dll_remove_first_#in~head.base|) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) 0)) (and (<= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (= (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (@diff (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (@diff (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))))) (or (<= 8 (@diff (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))) (= (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)))) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))))) (or (<= 8 (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} is VALID [2018-11-18 23:50:53,616 INFO L273 TraceCheckUtils]: 32: Hoare triple {1211#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) |dll_remove_first_#in~head.base|) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) 0)) (and (<= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (= (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (@diff (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (@diff (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))))) (or (<= 8 (@diff (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))) (= (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)))) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))))) (or (<= 8 (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} assume true; {1211#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) |dll_remove_first_#in~head.base|) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) 0)) (and (<= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (= (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (@diff (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (@diff (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))))) (or (<= 8 (@diff (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))) (= (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)))) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))))) (or (<= 8 (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} is VALID [2018-11-18 23:50:53,623 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1211#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) |dll_remove_first_#in~head.base|) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) 0)) (and (<= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (= (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (@diff (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (@diff (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))))) (or (<= 8 (@diff (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))) (= (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)))) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))))) (or (<= 8 (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} {1207#(and (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} #95#return; {1212#(and (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)))} is VALID [2018-11-18 23:50:53,624 INFO L273 TraceCheckUtils]: 34: Hoare triple {1212#(and (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)))} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {1212#(and (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)))} is VALID [2018-11-18 23:50:53,632 INFO L273 TraceCheckUtils]: 35: Hoare triple {1212#(and (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)))} assume true; {1212#(and (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)))} is VALID [2018-11-18 23:50:53,633 INFO L273 TraceCheckUtils]: 36: Hoare triple {1212#(and (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)))} assume !!(~i~0 >= 0); {1212#(and (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)))} is VALID [2018-11-18 23:50:53,634 INFO L256 TraceCheckUtils]: 37: Hoare triple {1212#(and (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)))} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1208#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-18 23:50:53,635 INFO L273 TraceCheckUtils]: 38: Hoare triple {1208#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {1213#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (= dll_remove_first_~temp~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4))) (= dll_remove_first_~temp~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} is VALID [2018-11-18 23:50:53,636 INFO L273 TraceCheckUtils]: 39: Hoare triple {1213#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (= dll_remove_first_~temp~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4))) (= dll_remove_first_~temp~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1214#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (<= (+ (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) 1) 0) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) 0)) (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4))) (<= 1 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} is VALID [2018-11-18 23:50:53,638 INFO L273 TraceCheckUtils]: 40: Hoare triple {1214#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (<= (+ (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) 1) 0) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) 0)) (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4))) (<= 1 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1215#(or (<= (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 1) 0) (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) 0)) (<= 1 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))} is VALID [2018-11-18 23:50:53,639 INFO L273 TraceCheckUtils]: 41: Hoare triple {1215#(or (<= (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 1) 0) (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) 0)) (<= 1 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))} assume true; {1215#(or (<= (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 1) 0) (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) 0)) (<= 1 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))} is VALID [2018-11-18 23:50:53,640 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1215#(or (<= (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 1) 0) (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) 0)) (<= 1 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)))} {1212#(and (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)))} #95#return; {1193#false} is VALID [2018-11-18 23:50:53,641 INFO L273 TraceCheckUtils]: 43: Hoare triple {1193#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {1193#false} is VALID [2018-11-18 23:50:53,641 INFO L273 TraceCheckUtils]: 44: Hoare triple {1193#false} assume true; {1193#false} is VALID [2018-11-18 23:50:53,641 INFO L273 TraceCheckUtils]: 45: Hoare triple {1193#false} assume !(~i~0 >= 0); {1193#false} is VALID [2018-11-18 23:50:53,641 INFO L273 TraceCheckUtils]: 46: Hoare triple {1193#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1193#false} is VALID [2018-11-18 23:50:53,642 INFO L273 TraceCheckUtils]: 47: Hoare triple {1193#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1193#false} is VALID [2018-11-18 23:50:53,642 INFO L273 TraceCheckUtils]: 48: Hoare triple {1193#false} assume !false; {1193#false} is VALID [2018-11-18 23:50:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 23:50:53,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:50:53,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:50:53,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:50:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:50:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:50:53,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:50:53,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 23:50:53,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 23:50:53,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:50:53,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 23:50:53,902 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:50:53,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-18 23:50:54,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 23:50:54,020 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:50:54,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 23:50:54,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 23:50:54,033 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:50:54,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:50:54,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-18 23:50:54,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 23:50:54,077 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:50:54,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 23:50:54,082 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 23:50:54,089 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:50:54,096 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:50:54,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:50:54,116 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:62, output treesize:62 [2018-11-18 23:50:54,592 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:50:54,593 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 30338 column 76: unknown constant v_#valid_25 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:164) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:174) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:320) 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.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:112) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:59) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.normalforms.NnfTransformer.transform(NnfTransformer.java:150) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) 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-18 23:50:54,598 INFO L168 Benchmark]: Toolchain (without parser) took 12582.70 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 867.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -680.1 MB). Peak memory consumption was 187.0 MB. Max. memory is 7.1 GB. [2018-11-18 23:50:54,599 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-18 23:50:54,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.5 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2018-11-18 23:50:54,602 INFO L168 Benchmark]: Boogie Preprocessor took 75.45 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.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-18 23:50:54,603 INFO L168 Benchmark]: RCFGBuilder took 1156.04 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: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 7.1 GB. [2018-11-18 23:50:54,604 INFO L168 Benchmark]: TraceAbstraction took 10595.62 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 134.7 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 39.5 MB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. [2018-11-18 23:50:54,608 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 750.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.5 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.45 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.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1156.04 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: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10595.62 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 134.7 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 39.5 MB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 30338 column 76: unknown constant v_#valid_25 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 30338 column 76: unknown constant v_#valid_25: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...