./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:58:23,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:58:23,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:58:23,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:58:23,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:58:23,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:58:23,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:58:23,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:58:23,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:58:23,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:58:23,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:58:23,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:58:23,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:58:23,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:58:23,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:58:23,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:58:23,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:58:23,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:58:23,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:58:23,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:58:23,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:58:23,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:58:23,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:58:23,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:58:23,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:58:23,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:58:23,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:58:23,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:58:23,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:58:23,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:58:23,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:58:23,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:58:23,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:58:23,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:58:23,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:58:23,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:58:23,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:58:23,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:58:23,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:58:23,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:58:23,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:58:23,975 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:58:24,004 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:58:24,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:58:24,005 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:58:24,005 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:58:24,006 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:58:24,006 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:58:24,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:58:24,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:58:24,007 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:58:24,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:58:24,008 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:58:24,008 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:58:24,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:58:24,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:58:24,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:58:24,009 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:58:24,009 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:58:24,009 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:58:24,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:58:24,009 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:58:24,010 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:58:24,010 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:58:24,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:58:24,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:58:24,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:58:24,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:58:24,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:58:24,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:58:24,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:58:24,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:58:24,013 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 [2022-02-20 23:58:24,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:58:24,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:58:24,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:58:24,301 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:58:24,302 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:58:24,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2022-02-20 23:58:24,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4a7faea/8002269348004566a5489ff8cc573133/FLAG12f253be7 [2022-02-20 23:58:24,789 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:58:24,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2022-02-20 23:58:24,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4a7faea/8002269348004566a5489ff8cc573133/FLAG12f253be7 [2022-02-20 23:58:24,815 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4a7faea/8002269348004566a5489ff8cc573133 [2022-02-20 23:58:24,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:58:24,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:58:24,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:58:24,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:58:24,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:58:24,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:58:24" (1/1) ... [2022-02-20 23:58:24,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d91677c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:24, skipping insertion in model container [2022-02-20 23:58:24,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:58:24" (1/1) ... [2022-02-20 23:58:24,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:58:24,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:58:25,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i[24275,24288] [2022-02-20 23:58:25,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:58:25,110 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:58:25,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i[24275,24288] [2022-02-20 23:58:25,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:58:25,173 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:58:25,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:25 WrapperNode [2022-02-20 23:58:25,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:58:25,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:58:25,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:58:25,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:58:25,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:25" (1/1) ... [2022-02-20 23:58:25,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:25" (1/1) ... [2022-02-20 23:58:25,222 INFO L137 Inliner]: procedures = 126, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2022-02-20 23:58:25,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:58:25,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:58:25,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:58:25,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:58:25,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:25" (1/1) ... [2022-02-20 23:58:25,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:25" (1/1) ... [2022-02-20 23:58:25,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:25" (1/1) ... [2022-02-20 23:58:25,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:25" (1/1) ... [2022-02-20 23:58:25,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:25" (1/1) ... [2022-02-20 23:58:25,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:25" (1/1) ... [2022-02-20 23:58:25,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:25" (1/1) ... [2022-02-20 23:58:25,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:58:25,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:58:25,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:58:25,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:58:25,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:25" (1/1) ... [2022-02-20 23:58:25,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:58:25,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:25,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:58:25,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:58:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-02-20 23:58:25,315 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-02-20 23:58:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:58:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:58:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:58:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:58:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:58:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:58:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:58:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:58:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:58:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:58:25,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:58:25,447 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:58:25,450 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:58:25,485 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-02-20 23:58:25,758 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:58:25,764 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:58:25,764 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:58:25,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:58:25 BoogieIcfgContainer [2022-02-20 23:58:25,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:58:25,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:58:25,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:58:25,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:58:25,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:58:24" (1/3) ... [2022-02-20 23:58:25,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3698d555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:58:25, skipping insertion in model container [2022-02-20 23:58:25,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:25" (2/3) ... [2022-02-20 23:58:25,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3698d555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:58:25, skipping insertion in model container [2022-02-20 23:58:25,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:58:25" (3/3) ... [2022-02-20 23:58:25,778 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_reverse.i [2022-02-20 23:58:25,784 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:58:25,784 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-02-20 23:58:25,826 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:58:25,831 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:58:25,831 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-02-20 23:58:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 40 states have (on average 2.1) internal successors, (84), 74 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:58:25,853 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:25,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:58:25,855 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:25,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:25,874 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-02-20 23:58:25,882 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:25,883 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300920460] [2022-02-20 23:58:25,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:25,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:26,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {79#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {79#true} is VALID [2022-02-20 23:58:26,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {79#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {79#true} is VALID [2022-02-20 23:58:26,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {79#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {81#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:26,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {81#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {81#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:26,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {81#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} assume !(1 == #valid[dll_create_~new_head~0#1.base]); {80#false} is VALID [2022-02-20 23:58:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:26,089 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:26,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300920460] [2022-02-20 23:58:26,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300920460] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:26,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:26,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:58:26,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895834410] [2022-02-20 23:58:26,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:26,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:58:26,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:26,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:26,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:26,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:26,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:26,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:26,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:26,156 INFO L87 Difference]: Start difference. First operand has 76 states, 40 states have (on average 2.1) internal successors, (84), 74 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:26,415 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2022-02-20 23:58:26,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:26,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:58:26,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 23:58:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 23:58:26,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2022-02-20 23:58:26,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:26,565 INFO L225 Difference]: With dead ends: 120 [2022-02-20 23:58:26,565 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 23:58:26,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:26,569 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 60 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:26,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 131 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 23:58:26,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2022-02-20 23:58:26,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:26,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 68 states, 37 states have (on average 1.945945945945946) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:26,597 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 68 states, 37 states have (on average 1.945945945945946) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:26,598 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 68 states, 37 states have (on average 1.945945945945946) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:26,604 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-02-20 23:58:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2022-02-20 23:58:26,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:26,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:26,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 37 states have (on average 1.945945945945946) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 115 states. [2022-02-20 23:58:26,606 INFO L87 Difference]: Start difference. First operand has 68 states, 37 states have (on average 1.945945945945946) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 115 states. [2022-02-20 23:58:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:26,612 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-02-20 23:58:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2022-02-20 23:58:26,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:26,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:26,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:26,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.945945945945946) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-02-20 23:58:26,640 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 5 [2022-02-20 23:58:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:26,641 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-02-20 23:58:26,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-02-20 23:58:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:58:26,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:26,642 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:58:26,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:58:26,643 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:26,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:26,646 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-02-20 23:58:26,647 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:26,647 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427085594] [2022-02-20 23:58:26,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:26,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:26,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {502#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {502#true} is VALID [2022-02-20 23:58:26,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {502#true} is VALID [2022-02-20 23:58:26,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {502#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {504#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:58:26,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {504#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (- 12)) 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {504#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:58:26,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {504#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (- 12)) 0))} assume !(4 + dll_create_~new_head~0#1.offset <= #length[dll_create_~new_head~0#1.base] && 0 <= dll_create_~new_head~0#1.offset); {503#false} is VALID [2022-02-20 23:58:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:26,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:26,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427085594] [2022-02-20 23:58:26,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427085594] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:26,739 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:26,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:58:26,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456184750] [2022-02-20 23:58:26,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:26,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:58:26,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:26,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:26,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:26,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:26,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:26,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:26,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:26,748 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:26,948 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2022-02-20 23:58:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:26,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:58:26,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 23:58:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:26,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 23:58:26,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2022-02-20 23:58:27,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:27,080 INFO L225 Difference]: With dead ends: 119 [2022-02-20 23:58:27,080 INFO L226 Difference]: Without dead ends: 119 [2022-02-20 23:58:27,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:27,082 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 65 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:27,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 138 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-02-20 23:58:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 65. [2022-02-20 23:58:27,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:27,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 65 states, 37 states have (on average 1.864864864864865) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,088 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 65 states, 37 states have (on average 1.864864864864865) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,088 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 65 states, 37 states have (on average 1.864864864864865) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:27,092 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2022-02-20 23:58:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2022-02-20 23:58:27,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:27,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:27,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 37 states have (on average 1.864864864864865) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 119 states. [2022-02-20 23:58:27,094 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.864864864864865) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 119 states. [2022-02-20 23:58:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:27,097 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2022-02-20 23:58:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2022-02-20 23:58:27,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:27,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:27,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:27,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.864864864864865) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-02-20 23:58:27,101 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 5 [2022-02-20 23:58:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:27,101 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-02-20 23:58:27,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-02-20 23:58:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:58:27,102 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:27,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:27,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:58:27,103 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:27,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:27,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113103, now seen corresponding path program 1 times [2022-02-20 23:58:27,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:27,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613302070] [2022-02-20 23:58:27,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:27,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:27,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {929#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {929#true} is VALID [2022-02-20 23:58:27,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {931#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:27,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {931#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !(dll_create_~len#1 > 0); {930#false} is VALID [2022-02-20 23:58:27,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {930#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {930#false} is VALID [2022-02-20 23:58:27,141 INFO L290 TraceCheckUtils]: 4: Hoare triple {930#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {930#false} is VALID [2022-02-20 23:58:27,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {930#false} assume !(main_~i~0#1 >= 0); {930#false} is VALID [2022-02-20 23:58:27,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {930#false} assume !(1 == #valid[main_~#s~0#1.base]); {930#false} is VALID [2022-02-20 23:58:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:27,142 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:27,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613302070] [2022-02-20 23:58:27,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613302070] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:27,143 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:27,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:58:27,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639014473] [2022-02-20 23:58:27,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:27,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:58:27,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:27,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:27,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:27,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:27,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:27,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:27,152 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:27,225 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-02-20 23:58:27,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:27,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:58:27,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:27,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 23:58:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 23:58:27,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2022-02-20 23:58:27,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:27,294 INFO L225 Difference]: With dead ends: 75 [2022-02-20 23:58:27,294 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 23:58:27,295 INFO L932 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 [2022-02-20 23:58:27,299 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 10 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:27,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 132 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 23:58:27,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2022-02-20 23:58:27,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:27,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 66 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,308 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 66 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,308 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 66 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:27,314 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-02-20 23:58:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-02-20 23:58:27,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:27,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:27,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 75 states. [2022-02-20 23:58:27,319 INFO L87 Difference]: Start difference. First operand has 66 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 75 states. [2022-02-20 23:58:27,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:27,321 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-02-20 23:58:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-02-20 23:58:27,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:27,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:27,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:27,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-02-20 23:58:27,324 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 7 [2022-02-20 23:58:27,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:27,324 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-02-20 23:58:27,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-02-20 23:58:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:58:27,325 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:27,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:27,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:58:27,326 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:27,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:27,327 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-02-20 23:58:27,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:27,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24728032] [2022-02-20 23:58:27,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:27,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:27,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {1225#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {1225#true} is VALID [2022-02-20 23:58:27,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {1225#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {1227#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:27,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {1227#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1227#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:27,381 INFO L290 TraceCheckUtils]: 3: Hoare triple {1227#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1227#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:27,382 INFO L290 TraceCheckUtils]: 4: Hoare triple {1227#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {1227#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:27,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {1227#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {1227#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:27,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {1227#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {1227#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:27,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {1226#false} is VALID [2022-02-20 23:58:27,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {1226#false} assume !(1 == #valid[dll_create_~head~0#1.base]); {1226#false} is VALID [2022-02-20 23:58:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:27,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:27,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24728032] [2022-02-20 23:58:27,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24728032] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:27,385 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:27,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:58:27,386 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041257056] [2022-02-20 23:58:27,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:27,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:58:27,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:27,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:27,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:27,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:27,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:27,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:27,396 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:27,468 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-02-20 23:58:27,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:27,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:58:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-02-20 23:58:27,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-02-20 23:58:27,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-02-20 23:58:27,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:27,535 INFO L225 Difference]: With dead ends: 72 [2022-02-20 23:58:27,535 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 23:58:27,535 INFO L932 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 [2022-02-20 23:58:27,544 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:27,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:27,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 23:58:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-02-20 23:58:27,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:27,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 71 states, 43 states have (on average 1.744186046511628) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,555 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 71 states, 43 states have (on average 1.744186046511628) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,561 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 71 states, 43 states have (on average 1.744186046511628) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:27,563 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-02-20 23:58:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-02-20 23:58:27,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:27,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:27,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 43 states have (on average 1.744186046511628) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 72 states. [2022-02-20 23:58:27,565 INFO L87 Difference]: Start difference. First operand has 71 states, 43 states have (on average 1.744186046511628) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 72 states. [2022-02-20 23:58:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:27,567 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-02-20 23:58:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-02-20 23:58:27,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:27,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:27,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:27,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.744186046511628) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-02-20 23:58:27,570 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 9 [2022-02-20 23:58:27,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:27,571 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-02-20 23:58:27,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-02-20 23:58:27,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:58:27,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:27,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:27,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:58:27,572 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:27,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:27,573 INFO L85 PathProgramCache]: Analyzing trace with hash -763066850, now seen corresponding path program 1 times [2022-02-20 23:58:27,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:27,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031502674] [2022-02-20 23:58:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:27,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {1517#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {1517#true} is VALID [2022-02-20 23:58:27,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {1517#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {1519#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:27,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {1519#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1519#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:27,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {1519#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1519#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:27,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {1519#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {1519#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:27,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {1519#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {1519#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:27,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {1519#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {1519#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:27,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {1519#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {1519#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:27,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {1519#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {1520#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {1520#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {1518#false} is VALID [2022-02-20 23:58:27,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {1518#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {1518#false} is VALID [2022-02-20 23:58:27,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {1518#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {1518#false} is VALID [2022-02-20 23:58:27,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {1518#false} assume !(main_~i~0#1 >= 0); {1518#false} is VALID [2022-02-20 23:58:27,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {1518#false} assume !(1 == #valid[main_~#s~0#1.base]); {1518#false} is VALID [2022-02-20 23:58:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:27,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:27,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031502674] [2022-02-20 23:58:27,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031502674] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:27,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795083329] [2022-02-20 23:58:27,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:27,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:27,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:27,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:58:27,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:58:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:27,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:58:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:27,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:27,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {1517#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {1517#true} is VALID [2022-02-20 23:58:27,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {1517#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {1520#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {1520#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {1518#false} is VALID [2022-02-20 23:58:27,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {1518#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {1518#false} is VALID [2022-02-20 23:58:27,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {1518#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {1518#false} is VALID [2022-02-20 23:58:27,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {1518#false} assume !(main_~i~0#1 >= 0); {1518#false} is VALID [2022-02-20 23:58:27,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {1518#false} assume !(1 == #valid[main_~#s~0#1.base]); {1518#false} is VALID [2022-02-20 23:58:27,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:27,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:27,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {1518#false} assume !(1 == #valid[main_~#s~0#1.base]); {1518#false} is VALID [2022-02-20 23:58:27,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {1518#false} assume !(main_~i~0#1 >= 0); {1518#false} is VALID [2022-02-20 23:58:27,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {1518#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {1518#false} is VALID [2022-02-20 23:58:27,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {1518#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {1518#false} is VALID [2022-02-20 23:58:27,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {1520#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {1518#false} is VALID [2022-02-20 23:58:27,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {1520#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {1517#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {1527#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:27,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {1517#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {1517#true} is VALID [2022-02-20 23:58:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:27,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795083329] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:27,991 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:27,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-02-20 23:58:27,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983331614] [2022-02-20 23:58:27,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:27,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:58:27,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:27,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:28,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:28,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:58:28,015 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:28,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:58:28,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:58:28,016 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:28,131 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-02-20 23:58:28,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:58:28,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:58:28,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:28,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:28,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-02-20 23:58:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-02-20 23:58:28,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-02-20 23:58:28,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:28,205 INFO L225 Difference]: With dead ends: 73 [2022-02-20 23:58:28,205 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 23:58:28,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:58:28,206 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 16 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:28,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 188 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 23:58:28,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-02-20 23:58:28,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:28,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 45 states have (on average 1.711111111111111) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:28,210 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 45 states have (on average 1.711111111111111) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:28,210 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 45 states have (on average 1.711111111111111) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:28,212 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-02-20 23:58:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-02-20 23:58:28,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:28,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:28,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 45 states have (on average 1.711111111111111) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 73 states. [2022-02-20 23:58:28,212 INFO L87 Difference]: Start difference. First operand has 73 states, 45 states have (on average 1.711111111111111) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 73 states. [2022-02-20 23:58:28,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:28,214 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-02-20 23:58:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-02-20 23:58:28,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:28,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:28,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:28,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.711111111111111) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-02-20 23:58:28,217 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 14 [2022-02-20 23:58:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:28,217 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-02-20 23:58:28,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-02-20 23:58:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:58:28,218 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:28,218 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:28,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:28,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:28,446 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:28,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:28,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-02-20 23:58:28,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:28,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755456837] [2022-02-20 23:58:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:28,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:28,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {1894#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {1894#true} is VALID [2022-02-20 23:58:28,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {1894#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {1894#true} is VALID [2022-02-20 23:58:28,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {1894#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1894#true} is VALID [2022-02-20 23:58:28,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {1894#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1894#true} is VALID [2022-02-20 23:58:28,607 INFO L290 TraceCheckUtils]: 4: Hoare triple {1894#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1898#(or (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))} is VALID [2022-02-20 23:58:28,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {1898#(or (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1898#(or (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))} is VALID [2022-02-20 23:58:28,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {1898#(or (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !(1 == #valid[dll_create_~head~0#1.base]); {1895#false} is VALID [2022-02-20 23:58:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:28,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:28,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755456837] [2022-02-20 23:58:28,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755456837] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:28,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103743026] [2022-02-20 23:58:28,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:28,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:28,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:28,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:58:28,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:58:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:28,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:58:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:28,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:28,745 INFO L390 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 [2022-02-20 23:58:28,830 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:58:28,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 23:58:28,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {1894#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {1894#true} is VALID [2022-02-20 23:58:28,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {1894#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {1894#true} is VALID [2022-02-20 23:58:28,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {1894#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {1896#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:28,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !(1 == #valid[dll_create_~head~0#1.base]); {1895#false} is VALID [2022-02-20 23:58:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:28,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:29,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !(1 == #valid[dll_create_~head~0#1.base]); {1895#false} is VALID [2022-02-20 23:58:29,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:29,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:29,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:29,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:29,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:29,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {1965#(forall ((v_ArrVal_162 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18|))) (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| v_ArrVal_162) |ULTIMATE.start_dll_create_~head~0#1.base|) 1)))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1897#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:29,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {1969#(forall ((v_ArrVal_162 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18|))) (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| v_ArrVal_162) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {1965#(forall ((v_ArrVal_162 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18|))) (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| v_ArrVal_162) |ULTIMATE.start_dll_create_~head~0#1.base|) 1)))} is VALID [2022-02-20 23:58:29,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {1969#(forall ((v_ArrVal_162 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18|))) (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| v_ArrVal_162) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {1969#(forall ((v_ArrVal_162 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18|))) (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| v_ArrVal_162) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} is VALID [2022-02-20 23:58:29,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {1969#(forall ((v_ArrVal_162 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18|))) (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| v_ArrVal_162) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {1969#(forall ((v_ArrVal_162 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18|))) (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| v_ArrVal_162) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} is VALID [2022-02-20 23:58:29,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {1969#(forall ((v_ArrVal_162 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18|))) (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| v_ArrVal_162) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {1969#(forall ((v_ArrVal_162 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18|))) (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| v_ArrVal_162) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} is VALID [2022-02-20 23:58:29,342 INFO L290 TraceCheckUtils]: 4: Hoare triple {1969#(forall ((v_ArrVal_162 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18|))) (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| v_ArrVal_162) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {1969#(forall ((v_ArrVal_162 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18|))) (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| v_ArrVal_162) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} is VALID [2022-02-20 23:58:29,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {1969#(forall ((v_ArrVal_162 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18|))) (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| v_ArrVal_162) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1969#(forall ((v_ArrVal_162 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18|))) (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| v_ArrVal_162) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} is VALID [2022-02-20 23:58:29,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {1894#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1969#(forall ((v_ArrVal_162 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18|))) (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_18| v_ArrVal_162) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} is VALID [2022-02-20 23:58:29,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {1894#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {1894#true} is VALID [2022-02-20 23:58:29,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {1894#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {1894#true} is VALID [2022-02-20 23:58:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:29,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103743026] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:29,345 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:29,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-02-20 23:58:29,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174416898] [2022-02-20 23:58:29,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:29,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:58:29,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:29,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:29,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:29,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:58:29,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:29,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:58:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:29,379 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:29,675 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-02-20 23:58:29,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:58:29,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:58:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-02-20 23:58:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-02-20 23:58:29,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-02-20 23:58:29,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:29,773 INFO L225 Difference]: With dead ends: 116 [2022-02-20 23:58:29,774 INFO L226 Difference]: Without dead ends: 116 [2022-02-20 23:58:29,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:58:29,775 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 211 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:29,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 125 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 59 Unchecked, 0.1s Time] [2022-02-20 23:58:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-20 23:58:29,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 72. [2022-02-20 23:58:29,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:29,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 72 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:29,781 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 72 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:29,782 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 72 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:29,784 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-02-20 23:58:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-02-20 23:58:29,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:29,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:29,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 116 states. [2022-02-20 23:58:29,785 INFO L87 Difference]: Start difference. First operand has 72 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 116 states. [2022-02-20 23:58:29,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:29,788 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-02-20 23:58:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-02-20 23:58:29,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:29,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:29,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:29,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-02-20 23:58:29,791 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 16 [2022-02-20 23:58:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:29,791 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-02-20 23:58:29,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-02-20 23:58:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:58:29,792 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:29,792 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:29,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:30,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 23:58:30,005 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:30,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:30,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-02-20 23:58:30,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:30,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760634048] [2022-02-20 23:58:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:30,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:30,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {2417#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {2417#true} is VALID [2022-02-20 23:58:30,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {2417#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {2417#true} is VALID [2022-02-20 23:58:30,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {2417#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {2419#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:30,159 INFO L290 TraceCheckUtils]: 3: Hoare triple {2419#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {2419#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:30,160 INFO L290 TraceCheckUtils]: 4: Hoare triple {2419#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {2420#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:30,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {2420#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {2420#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:30,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {2420#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {2420#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:30,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {2420#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {2420#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:30,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {2420#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {2421#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:30,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {2421#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {2422#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:30,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {2422#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {2422#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:30,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {2422#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {2422#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:30,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {2422#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {2422#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:30,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {2422#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {2422#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:30,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {2422#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {2422#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:30,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {2422#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(4 + (8 + dll_create_~head~0#1.offset) <= #length[dll_create_~head~0#1.base] && 0 <= 8 + dll_create_~head~0#1.offset); {2418#false} is VALID [2022-02-20 23:58:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:30,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:30,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760634048] [2022-02-20 23:58:30,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760634048] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:30,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140542765] [2022-02-20 23:58:30,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:30,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:30,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:30,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:58:30,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:58:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:30,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:58:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:30,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:30,280 INFO L390 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 [2022-02-20 23:58:30,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:30,407 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:30,420 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:58:30,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:58:30,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {2417#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {2417#true} is VALID [2022-02-20 23:58:30,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {2417#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {2417#true} is VALID [2022-02-20 23:58:30,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {2417#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {2432#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 23:58:30,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {2432#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {2432#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 23:58:30,483 INFO L290 TraceCheckUtils]: 4: Hoare triple {2432#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {2432#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 23:58:30,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {2432#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {2432#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 23:58:30,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {2432#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {2445#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:58:30,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {2445#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {2445#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:58:30,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {2445#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {2452#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:30,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {2452#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {2456#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:30,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {2456#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {2456#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:30,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {2456#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {2456#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:30,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {2456#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {2456#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:30,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {2456#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {2456#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:30,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {2456#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {2456#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:30,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(4 + (8 + dll_create_~head~0#1.offset) <= #length[dll_create_~head~0#1.base] && 0 <= 8 + dll_create_~head~0#1.offset); {2418#false} is VALID [2022-02-20 23:58:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:30,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:30,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 37 treesize of output 33 [2022-02-20 23:58:31,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {2475#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))} assume !(4 + (8 + dll_create_~head~0#1.offset) <= #length[dll_create_~head~0#1.base] && 0 <= 8 + dll_create_~head~0#1.offset); {2418#false} is VALID [2022-02-20 23:58:31,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {2475#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {2475#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))} is VALID [2022-02-20 23:58:31,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {2475#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {2475#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))} is VALID [2022-02-20 23:58:31,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {2475#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {2475#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))} is VALID [2022-02-20 23:58:31,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {2475#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))} is VALID [2022-02-20 23:58:31,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {2475#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {2475#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))} is VALID [2022-02-20 23:58:31,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {2494#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_248 Int)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 12) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| v_ArrVal_248) |ULTIMATE.start_dll_create_~head~0#1.base|))) (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0))))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {2475#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))} is VALID [2022-02-20 23:58:31,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {2498#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_248 Int)) (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| v_ArrVal_248) |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0))))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {2494#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_248 Int)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 12) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| v_ArrVal_248) |ULTIMATE.start_dll_create_~head~0#1.base|))) (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0))))} is VALID [2022-02-20 23:58:31,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {2498#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_248 Int)) (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| v_ArrVal_248) |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0))))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {2498#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_248 Int)) (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| v_ArrVal_248) |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0))))} is VALID [2022-02-20 23:58:31,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {2505#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0))))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {2498#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_248 Int)) (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| v_ArrVal_248) |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0))))} is VALID [2022-02-20 23:58:31,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {2505#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0))))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {2505#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0))))} is VALID [2022-02-20 23:58:31,013 INFO L290 TraceCheckUtils]: 4: Hoare triple {2505#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0))))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {2505#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0))))} is VALID [2022-02-20 23:58:31,014 INFO L290 TraceCheckUtils]: 3: Hoare triple {2505#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0))))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {2505#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0))))} is VALID [2022-02-20 23:58:31,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {2417#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {2505#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0))))} is VALID [2022-02-20 23:58:31,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {2417#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {2417#true} is VALID [2022-02-20 23:58:31,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {2417#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {2417#true} is VALID [2022-02-20 23:58:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:31,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140542765] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:31,016 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:31,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-02-20 23:58:31,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051981091] [2022-02-20 23:58:31,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:31,017 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:58:31,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:31,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:31,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:31,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:58:31,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:31,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:58:31,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:58:31,059 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:31,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:31,581 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-02-20 23:58:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:58:31,581 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:58:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2022-02-20 23:58:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2022-02-20 23:58:31,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 122 transitions. [2022-02-20 23:58:31,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:31,689 INFO L225 Difference]: With dead ends: 115 [2022-02-20 23:58:31,689 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 23:58:31,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:58:31,690 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 324 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:31,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 108 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 122 Unchecked, 0.1s Time] [2022-02-20 23:58:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 23:58:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2022-02-20 23:58:31,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:31,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 71 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:31,694 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 71 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:31,694 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 71 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:31,696 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-02-20 23:58:31,696 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2022-02-20 23:58:31,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:31,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:31,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 115 states. [2022-02-20 23:58:31,697 INFO L87 Difference]: Start difference. First operand has 71 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 115 states. [2022-02-20 23:58:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:31,700 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-02-20 23:58:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2022-02-20 23:58:31,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:31,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:31,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:31,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-02-20 23:58:31,702 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 16 [2022-02-20 23:58:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:31,702 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-02-20 23:58:31,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-02-20 23:58:31,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:58:31,703 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:31,703 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:31,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:31,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:31,916 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:31,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:31,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 2 times [2022-02-20 23:58:31,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:31,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620231547] [2022-02-20 23:58:31,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:31,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:31,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {2945#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {2945#true} is VALID [2022-02-20 23:58:31,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {2945#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {2945#true} is VALID [2022-02-20 23:58:31,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {2945#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {2947#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:31,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {2947#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {2947#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:31,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {2947#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {2947#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:31,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {2947#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {2947#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:31,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {2947#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {2947#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:31,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {2947#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {2947#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:31,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {2947#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {2948#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:31,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {2948#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {2948#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:31,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {2948#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {2948#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:31,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {2948#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {2948#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:31,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {2948#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {2948#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:31,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {2948#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {2948#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:31,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {2948#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {2946#false} is VALID [2022-02-20 23:58:31,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {2946#false} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {2946#false} is VALID [2022-02-20 23:58:31,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {2946#false} assume !(dll_create_~len#1 > 0); {2946#false} is VALID [2022-02-20 23:58:31,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {2946#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {2946#false} is VALID [2022-02-20 23:58:31,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {2946#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {2946#false} is VALID [2022-02-20 23:58:31,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {2946#false} assume !(main_~i~0#1 >= 0); {2946#false} is VALID [2022-02-20 23:58:31,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {2946#false} assume !(1 == #valid[main_~#s~0#1.base]); {2946#false} is VALID [2022-02-20 23:58:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:31,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:31,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620231547] [2022-02-20 23:58:31,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620231547] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:31,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744146042] [2022-02-20 23:58:31,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:58:31,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:31,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:31,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:58:31,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:58:32,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:58:32,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:58:32,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:58:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:32,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:32,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {2945#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {2945#true} is VALID [2022-02-20 23:58:32,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {2945#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,181 INFO L290 TraceCheckUtils]: 4: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:32,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {2955#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {3007#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:32,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {3007#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {2946#false} is VALID [2022-02-20 23:58:32,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {2946#false} assume !(1 == #valid[main_~#s~0#1.base]); {2946#false} is VALID [2022-02-20 23:58:32,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:58:32,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:32,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744146042] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:32,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:58:32,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-02-20 23:58:32,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472448516] [2022-02-20 23:58:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:32,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:58:32,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:32,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:32,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:32,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:58:32,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:32,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:58:32,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:58:32,207 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:32,304 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-02-20 23:58:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:58:32,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:58:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-02-20 23:58:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-02-20 23:58:32,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 113 transitions. [2022-02-20 23:58:32,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:32,397 INFO L225 Difference]: With dead ends: 114 [2022-02-20 23:58:32,397 INFO L226 Difference]: Without dead ends: 114 [2022-02-20 23:58:32,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:32,398 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 144 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:32,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-02-20 23:58:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 72. [2022-02-20 23:58:32,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:32,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 72 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:32,401 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 72 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:32,401 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 72 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:32,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:32,404 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-02-20 23:58:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2022-02-20 23:58:32,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:32,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:32,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 114 states. [2022-02-20 23:58:32,405 INFO L87 Difference]: Start difference. First operand has 72 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 114 states. [2022-02-20 23:58:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:32,407 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-02-20 23:58:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2022-02-20 23:58:32,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:32,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:32,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:32,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-02-20 23:58:32,409 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 21 [2022-02-20 23:58:32,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:32,410 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-02-20 23:58:32,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-02-20 23:58:32,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:58:32,410 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:32,410 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:32,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:32,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:32,623 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:32,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:32,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 1 times [2022-02-20 23:58:32,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:32,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508317978] [2022-02-20 23:58:32,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:32,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:32,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {3429#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {3429#true} is VALID [2022-02-20 23:58:32,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {3429#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {3429#true} is VALID [2022-02-20 23:58:32,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {3429#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3430#false} is VALID [2022-02-20 23:58:32,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {3430#false} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3430#false} is VALID [2022-02-20 23:58:32,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {3430#false} assume !(dll_create_~len#1 > 0); {3430#false} is VALID [2022-02-20 23:58:32,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {3430#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {3430#false} is VALID [2022-02-20 23:58:32,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {3430#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {3430#false} is VALID [2022-02-20 23:58:32,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {3430#false} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {3430#false} is VALID [2022-02-20 23:58:32,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {3430#false} assume !(1 == #valid[dll_remove_last_~head#1.base]); {3430#false} is VALID [2022-02-20 23:58:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:32,712 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:32,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508317978] [2022-02-20 23:58:32,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508317978] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:32,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929277597] [2022-02-20 23:58:32,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:32,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:32,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:32,715 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:58:32,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:58:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:32,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:58:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:32,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:32,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {3429#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {3429#true} is VALID [2022-02-20 23:58:32,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {3429#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {3429#true} is VALID [2022-02-20 23:58:32,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {3429#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3430#false} is VALID [2022-02-20 23:58:32,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {3430#false} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3430#false} is VALID [2022-02-20 23:58:32,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {3430#false} assume !(dll_create_~len#1 > 0); {3430#false} is VALID [2022-02-20 23:58:32,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {3430#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {3430#false} is VALID [2022-02-20 23:58:32,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {3430#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {3430#false} is VALID [2022-02-20 23:58:32,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {3430#false} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {3430#false} is VALID [2022-02-20 23:58:32,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {3430#false} assume !(1 == #valid[dll_remove_last_~head#1.base]); {3430#false} is VALID [2022-02-20 23:58:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:32,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:32,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {3430#false} assume !(1 == #valid[dll_remove_last_~head#1.base]); {3430#false} is VALID [2022-02-20 23:58:32,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {3430#false} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {3430#false} is VALID [2022-02-20 23:58:32,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {3430#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {3430#false} is VALID [2022-02-20 23:58:32,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {3430#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {3430#false} is VALID [2022-02-20 23:58:32,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {3430#false} assume !(dll_create_~len#1 > 0); {3430#false} is VALID [2022-02-20 23:58:32,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {3430#false} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3430#false} is VALID [2022-02-20 23:58:32,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3430#false} is VALID [2022-02-20 23:58:32,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3432#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {3429#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {3431#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:32,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {3429#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {3429#true} is VALID [2022-02-20 23:58:32,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {3429#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {3429#true} is VALID [2022-02-20 23:58:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:32,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929277597] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:32,919 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:32,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-02-20 23:58:32,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648421747] [2022-02-20 23:58:32,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:32,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:58:32,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:32,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:32,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:32,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:58:32,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:32,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:58:32,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:58:32,938 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:33,040 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-02-20 23:58:33,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:58:33,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:58:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-02-20 23:58:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-02-20 23:58:33,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 74 transitions. [2022-02-20 23:58:33,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:33,119 INFO L225 Difference]: With dead ends: 72 [2022-02-20 23:58:33,120 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 23:58:33,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:58:33,120 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 117 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:33,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 63 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 23:58:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-02-20 23:58:33,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:33,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 72 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:33,123 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 72 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:33,123 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 72 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:33,125 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-02-20 23:58:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-02-20 23:58:33,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:33,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:33,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 72 states. [2022-02-20 23:58:33,125 INFO L87 Difference]: Start difference. First operand has 72 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 72 states. [2022-02-20 23:58:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:33,126 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-02-20 23:58:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-02-20 23:58:33,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:33,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:33,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:33,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:33,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-02-20 23:58:33,128 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 21 [2022-02-20 23:58:33,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:33,128 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-02-20 23:58:33,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:33,128 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-02-20 23:58:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:58:33,129 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:33,129 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:33,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:33,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:33,348 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:33,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:33,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822154, now seen corresponding path program 1 times [2022-02-20 23:58:33,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:33,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314696040] [2022-02-20 23:58:33,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:33,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:33,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {3845#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {3845#true} is VALID [2022-02-20 23:58:33,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {3845#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {3848#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {3848#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3848#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {3848#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3848#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {3848#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {3848#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {3848#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {3848#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {3848#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3848#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {3848#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {3849#(or (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:58:33,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {3849#(or (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3849#(or (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:58:33,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {3849#(or (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(dll_create_~len#1 > 0); {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {3850#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1)} is VALID [2022-02-20 23:58:33,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {3850#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1)} assume !(1 == #valid[dll_remove_last_~head#1.base]); {3846#false} is VALID [2022-02-20 23:58:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:58:33,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:33,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314696040] [2022-02-20 23:58:33,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314696040] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:33,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539633474] [2022-02-20 23:58:33,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:33,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:33,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:33,452 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:58:33,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:58:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:33,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:58:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:33,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:33,581 INFO L390 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 [2022-02-20 23:58:33,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:33,644 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:33,685 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:58:33,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:33,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {3845#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {3845#true} is VALID [2022-02-20 23:58:33,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {3845#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {3857#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:58:33,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {3857#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(dll_create_~len#1 > 0); {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {3850#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1)} is VALID [2022-02-20 23:58:33,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {3850#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1)} assume !(1 == #valid[dll_remove_last_~head#1.base]); {3846#false} is VALID [2022-02-20 23:58:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:58:33,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:34,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {3850#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1)} assume !(1 == #valid[dll_remove_last_~head#1.base]); {3846#false} is VALID [2022-02-20 23:58:34,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {3850#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1)} is VALID [2022-02-20 23:58:34,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(dll_create_~len#1 > 0); {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,018 INFO L290 TraceCheckUtils]: 4: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,019 INFO L290 TraceCheckUtils]: 3: Hoare triple {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {3975#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| Int) (v_ArrVal_514 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| v_ArrVal_514) |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| |#StackHeapBarrier|))))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {3847#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:58:34,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {3845#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {3975#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| Int) (v_ArrVal_514 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| v_ArrVal_514) |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:58:34,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {3845#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {3845#true} is VALID [2022-02-20 23:58:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:58:34,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539633474] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:34,022 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:34,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-02-20 23:58:34,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94950441] [2022-02-20 23:58:34,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:34,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:58:34,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:34,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:34,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:34,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:58:34,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:34,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:58:34,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:58:34,052 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:34,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,315 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-02-20 23:58:34,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:58:34,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:58:34,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2022-02-20 23:58:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2022-02-20 23:58:34,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 118 transitions. [2022-02-20 23:58:34,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:34,411 INFO L225 Difference]: With dead ends: 113 [2022-02-20 23:58:34,411 INFO L226 Difference]: Without dead ends: 113 [2022-02-20 23:58:34,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:58:34,412 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 210 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:34,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 71 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 1 Unchecked, 0.1s Time] [2022-02-20 23:58:34,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-02-20 23:58:34,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71. [2022-02-20 23:58:34,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:34,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 71 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:34,415 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 71 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:34,415 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 71 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,417 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-02-20 23:58:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-02-20 23:58:34,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:34,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:34,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 113 states. [2022-02-20 23:58:34,418 INFO L87 Difference]: Start difference. First operand has 71 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 113 states. [2022-02-20 23:58:34,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,420 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-02-20 23:58:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-02-20 23:58:34,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:34,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:34,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:34,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-02-20 23:58:34,422 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 22 [2022-02-20 23:58:34,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:34,422 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-02-20 23:58:34,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-02-20 23:58:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:58:34,423 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:34,423 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:34,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:34,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:34,643 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:34,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822155, now seen corresponding path program 1 times [2022-02-20 23:58:34,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:34,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607414369] [2022-02-20 23:58:34,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:34,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:34,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {4397#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {4397#true} is VALID [2022-02-20 23:58:34,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {4397#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {4399#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {4399#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {4400#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,813 INFO L290 TraceCheckUtils]: 3: Hoare triple {4400#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4400#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {4400#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {4400#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {4400#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {4400#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {4400#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {4400#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {4400#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {4400#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {4400#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {4401#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {4401#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {4402#(and (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {4402#(and (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4402#(and (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {4402#(and (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {4402#(and (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {4402#(and (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {4402#(and (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {4402#(and (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {4402#(and (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {4402#(and (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {4402#(and (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {4402#(and (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {4402#(and (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {4402#(and (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {4403#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {4403#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} assume !(dll_create_~len#1 > 0); {4403#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {4403#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {4403#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {4403#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {4403#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:58:34,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {4403#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {4404#(and (= (select |#length| |ULTIMATE.start_dll_remove_last_~head#1.base|) 4) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} is VALID [2022-02-20 23:58:34,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {4404#(and (= (select |#length| |ULTIMATE.start_dll_remove_last_~head#1.base|) 4) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} assume !(4 + dll_remove_last_~head#1.offset <= #length[dll_remove_last_~head#1.base] && 0 <= dll_remove_last_~head#1.offset); {4398#false} is VALID [2022-02-20 23:58:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:34,826 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:34,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607414369] [2022-02-20 23:58:34,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607414369] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:34,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423545315] [2022-02-20 23:58:34,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:34,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:34,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:34,828 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:58:34,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 23:58:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:34,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:58:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:34,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:34,993 INFO L390 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 [2022-02-20 23:58:35,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:35,060 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:35,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:35,219 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:35,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {4397#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {4397#true} is VALID [2022-02-20 23:58:35,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {4397#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,350 INFO L290 TraceCheckUtils]: 3: Hoare triple {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,351 INFO L290 TraceCheckUtils]: 4: Hoare triple {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {4411#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(dll_create_~len#1 > 0); {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:35,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {4436#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {4470#(and (<= 4 (select |#length| |ULTIMATE.start_dll_remove_last_~head#1.base|)) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} is VALID [2022-02-20 23:58:35,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {4470#(and (<= 4 (select |#length| |ULTIMATE.start_dll_remove_last_~head#1.base|)) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} assume !(4 + dll_remove_last_~head#1.offset <= #length[dll_remove_last_~head#1.base] && 0 <= dll_remove_last_~head#1.offset); {4398#false} is VALID [2022-02-20 23:58:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:35,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:36,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {4474#(and (<= 0 |ULTIMATE.start_dll_remove_last_~head#1.offset|) (<= (+ |ULTIMATE.start_dll_remove_last_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_remove_last_~head#1.base|)))} assume !(4 + dll_remove_last_~head#1.offset <= #length[dll_remove_last_~head#1.base] && 0 <= dll_remove_last_~head#1.offset); {4398#false} is VALID [2022-02-20 23:58:36,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {4474#(and (<= 0 |ULTIMATE.start_dll_remove_last_~head#1.offset|) (<= (+ |ULTIMATE.start_dll_remove_last_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_remove_last_~head#1.base|)))} is VALID [2022-02-20 23:58:36,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 23:58:36,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 23:58:36,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} assume !(dll_create_~len#1 > 0); {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 23:58:36,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 23:58:36,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 23:58:36,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 23:58:36,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 23:58:36,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 23:58:36,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 23:58:36,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 23:58:36,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {4478#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 23:58:36,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:58:36,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:58:36,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:58:36,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:58:36,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:58:36,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:58:36,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:58:36,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {4397#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {4512#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_614 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:58:36,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {4397#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {4397#true} is VALID [2022-02-20 23:58:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:36,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423545315] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:36,872 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:36,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2022-02-20 23:58:36,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936267563] [2022-02-20 23:58:36,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:36,873 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:58:36,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:36,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:36,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:36,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:58:36,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:36,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:58:36,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:58:36,930 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:37,380 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-02-20 23:58:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:58:37,381 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:58:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-02-20 23:58:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-02-20 23:58:37,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 103 transitions. [2022-02-20 23:58:37,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:37,484 INFO L225 Difference]: With dead ends: 96 [2022-02-20 23:58:37,484 INFO L226 Difference]: Without dead ends: 96 [2022-02-20 23:58:37,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:58:37,485 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 446 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:37,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 51 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-20 23:58:37,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2022-02-20 23:58:37,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:37,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 66 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:37,487 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 66 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:37,487 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 66 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:37,489 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-02-20 23:58:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-02-20 23:58:37,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:37,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:37,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 96 states. [2022-02-20 23:58:37,490 INFO L87 Difference]: Start difference. First operand has 66 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 96 states. [2022-02-20 23:58:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:37,491 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-02-20 23:58:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-02-20 23:58:37,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:37,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:37,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:37,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-02-20 23:58:37,493 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 22 [2022-02-20 23:58:37,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:37,493 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-02-20 23:58:37,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-02-20 23:58:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:58:37,493 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:37,493 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:37,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:37,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:37,717 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:37,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:37,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022636, now seen corresponding path program 1 times [2022-02-20 23:58:37,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:37,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659786620] [2022-02-20 23:58:37,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:37,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:37,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {4899#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {4899#true} is VALID [2022-02-20 23:58:37,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {4899#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {4899#true} is VALID [2022-02-20 23:58:37,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {4899#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {4899#true} is VALID [2022-02-20 23:58:37,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {4899#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4899#true} is VALID [2022-02-20 23:58:37,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {4899#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {4899#true} is VALID [2022-02-20 23:58:37,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {4899#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {4899#true} is VALID [2022-02-20 23:58:37,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {4899#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {4899#true} is VALID [2022-02-20 23:58:37,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {4899#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {4899#true} is VALID [2022-02-20 23:58:37,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {4899#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {4899#true} is VALID [2022-02-20 23:58:37,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {4899#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {4899#true} is VALID [2022-02-20 23:58:37,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {4899#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4899#true} is VALID [2022-02-20 23:58:37,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {4899#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {4901#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:37,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {4901#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {4901#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:37,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {4901#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {4901#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:37,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {4901#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {4901#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:37,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {4901#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {4901#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:37,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {4901#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {4902#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:37,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {4902#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !(dll_create_~len#1 > 0); {4902#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:37,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {4902#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {4903#(= (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:37,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {4903#(= (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) 1)} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {4904#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 1)} is VALID [2022-02-20 23:58:37,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {4904#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 1)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {4905#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-20 23:58:37,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {4905#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {4906#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:58:37,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {4906#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) 1)} assume !(1 == #valid[dll_remove_last_#t~mem6#1.base]); {4900#false} is VALID [2022-02-20 23:58:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:58:37,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:37,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659786620] [2022-02-20 23:58:37,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659786620] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:37,815 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:37,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:58:37,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594508782] [2022-02-20 23:58:37,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:37,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:58:37,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:37,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:37,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:37,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:58:37,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:37,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:58:37,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:58:37,836 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:38,355 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-02-20 23:58:38,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:58:38,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:58:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-02-20 23:58:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-02-20 23:58:38,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 100 transitions. [2022-02-20 23:58:38,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:38,442 INFO L225 Difference]: With dead ends: 95 [2022-02-20 23:58:38,442 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 23:58:38,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:58:38,443 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 156 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:38,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 181 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:58:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 23:58:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2022-02-20 23:58:38,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:38,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 67 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:38,445 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 67 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:38,445 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 67 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:38,447 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-02-20 23:58:38,447 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2022-02-20 23:58:38,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:38,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:38,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 95 states. [2022-02-20 23:58:38,448 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 95 states. [2022-02-20 23:58:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:38,449 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-02-20 23:58:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2022-02-20 23:58:38,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:38,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:38,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:38,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-02-20 23:58:38,451 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2022-02-20 23:58:38,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:38,452 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-02-20 23:58:38,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-02-20 23:58:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:58:38,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:38,452 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:38,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:58:38,453 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:38,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:38,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022635, now seen corresponding path program 1 times [2022-02-20 23:58:38,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:38,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817536720] [2022-02-20 23:58:38,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:38,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:38,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {5272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {5272#true} is VALID [2022-02-20 23:58:38,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {5272#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {5272#true} is VALID [2022-02-20 23:58:38,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {5272#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {5272#true} is VALID [2022-02-20 23:58:38,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {5272#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {5272#true} is VALID [2022-02-20 23:58:38,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {5272#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {5272#true} is VALID [2022-02-20 23:58:38,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {5272#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {5272#true} is VALID [2022-02-20 23:58:38,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {5272#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {5272#true} is VALID [2022-02-20 23:58:38,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {5272#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {5272#true} is VALID [2022-02-20 23:58:38,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {5272#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {5272#true} is VALID [2022-02-20 23:58:38,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {5272#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {5274#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:38,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {5274#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {5274#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:38,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {5274#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {5274#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:38,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {5274#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {5274#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:38,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {5274#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {5274#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:38,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {5274#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {5274#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:38,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {5274#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {5274#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:38,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {5274#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {5275#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:38,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {5275#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(dll_create_~len#1 > 0); {5275#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:38,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {5275#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {5276#(and (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= 12 (select |#length| |ULTIMATE.start_dll_create_#res#1.base|)))} is VALID [2022-02-20 23:58:38,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {5276#(and (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= 12 (select |#length| |ULTIMATE.start_dll_create_#res#1.base|)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {5277#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 12))} is VALID [2022-02-20 23:58:38,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {5277#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 12))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {5278#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} is VALID [2022-02-20 23:58:38,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {5278#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {5279#(and (= |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:58:38,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {5279#(and (= |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (- 12)) 0))} assume !(4 + (4 + dll_remove_last_#t~mem6#1.offset) <= #length[dll_remove_last_#t~mem6#1.base] && 0 <= 4 + dll_remove_last_#t~mem6#1.offset); {5273#false} is VALID [2022-02-20 23:58:38,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:38,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:38,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817536720] [2022-02-20 23:58:38,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817536720] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:38,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:38,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:58:38,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935888254] [2022-02-20 23:58:38,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:38,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:58:38,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:38,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:38,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:38,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:58:38,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:38,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:58:38,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:58:38,594 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:39,184 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-02-20 23:58:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:58:39,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:58:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-02-20 23:58:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-02-20 23:58:39,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 95 transitions. [2022-02-20 23:58:39,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:39,268 INFO L225 Difference]: With dead ends: 90 [2022-02-20 23:58:39,268 INFO L226 Difference]: Without dead ends: 90 [2022-02-20 23:58:39,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:58:39,269 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 282 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:39,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 132 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:58:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-20 23:58:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2022-02-20 23:58:39,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:39,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 67 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,271 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 67 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,271 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 67 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:39,273 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-02-20 23:58:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-02-20 23:58:39,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:39,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:39,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 90 states. [2022-02-20 23:58:39,274 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 90 states. [2022-02-20 23:58:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:39,275 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-02-20 23:58:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-02-20 23:58:39,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:39,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:39,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:39,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-02-20 23:58:39,277 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 23 [2022-02-20 23:58:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:39,277 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-02-20 23:58:39,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-02-20 23:58:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:58:39,278 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:39,278 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:39,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:58:39,279 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:39,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1033118353, now seen corresponding path program 1 times [2022-02-20 23:58:39,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:39,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161602913] [2022-02-20 23:58:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:39,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:39,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {5630#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {5630#true} is VALID [2022-02-20 23:58:39,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {5630#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {5630#true} is VALID [2022-02-20 23:58:39,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {5630#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {5630#true} is VALID [2022-02-20 23:58:39,347 INFO L290 TraceCheckUtils]: 3: Hoare triple {5630#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {5630#true} is VALID [2022-02-20 23:58:39,347 INFO L290 TraceCheckUtils]: 4: Hoare triple {5630#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {5630#true} is VALID [2022-02-20 23:58:39,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {5630#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {5630#true} is VALID [2022-02-20 23:58:39,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {5630#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {5630#true} is VALID [2022-02-20 23:58:39,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {5630#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {5630#true} is VALID [2022-02-20 23:58:39,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {5630#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {5630#true} is VALID [2022-02-20 23:58:39,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {5630#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {5632#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:39,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {5632#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {5632#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:39,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {5632#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {5632#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:39,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {5632#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {5632#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:39,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {5632#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {5632#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:39,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {5632#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {5632#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:39,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {5632#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {5632#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:39,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {5632#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {5633#(= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)} is VALID [2022-02-20 23:58:39,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {5633#(= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)} assume !(dll_create_~len#1 > 0); {5633#(= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)} is VALID [2022-02-20 23:58:39,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {5633#(= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {5634#(= |ULTIMATE.start_dll_create_#res#1.offset| 0)} is VALID [2022-02-20 23:58:39,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {5634#(= |ULTIMATE.start_dll_create_#res#1.offset| 0)} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {5635#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)} is VALID [2022-02-20 23:58:39,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {5635#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {5636#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)} is VALID [2022-02-20 23:58:39,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {5636#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {5636#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)} is VALID [2022-02-20 23:58:39,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {5636#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {5636#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)} is VALID [2022-02-20 23:58:39,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {5636#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)} assume 0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset; {5636#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)} is VALID [2022-02-20 23:58:39,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {5636#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)} SUMMARY for call dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L605 {5637#(= |ULTIMATE.start_dll_remove_last_#t~mem8#1.offset| 0)} is VALID [2022-02-20 23:58:39,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {5637#(= |ULTIMATE.start_dll_remove_last_#t~mem8#1.offset| 0)} assume !(0 == dll_remove_last_#t~mem8#1.offset); {5631#false} is VALID [2022-02-20 23:58:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:39,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:39,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161602913] [2022-02-20 23:58:39,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161602913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:39,357 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:39,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:58:39,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733098449] [2022-02-20 23:58:39,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:39,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:58:39,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:39,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:39,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:58:39,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:39,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:58:39,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:58:39,382 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:39,688 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-02-20 23:58:39,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:58:39,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:58:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-02-20 23:58:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-02-20 23:58:39,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-02-20 23:58:39,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:39,752 INFO L225 Difference]: With dead ends: 66 [2022-02-20 23:58:39,752 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 23:58:39,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:58:39,753 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 224 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:39,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 82 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 23:58:39,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-02-20 23:58:39,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:39,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 48 states have (on average 1.4375) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,755 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 48 states have (on average 1.4375) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,755 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 48 states have (on average 1.4375) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:39,756 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-02-20 23:58:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-02-20 23:58:39,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:39,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:39,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 48 states have (on average 1.4375) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 66 states. [2022-02-20 23:58:39,757 INFO L87 Difference]: Start difference. First operand has 66 states, 48 states have (on average 1.4375) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 66 states. [2022-02-20 23:58:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:39,758 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-02-20 23:58:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-02-20 23:58:39,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:39,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:39,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:39,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4375) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-02-20 23:58:39,760 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2022-02-20 23:58:39,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:39,760 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-02-20 23:58:39,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-02-20 23:58:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:58:39,763 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:39,763 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:39,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:58:39,763 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:39,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1961897973, now seen corresponding path program 1 times [2022-02-20 23:58:39,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:39,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139697321] [2022-02-20 23:58:39,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:39,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:39,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {5917#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {5917#true} is VALID [2022-02-20 23:58:39,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {5917#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {5917#true} is VALID [2022-02-20 23:58:39,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {5917#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {5917#true} is VALID [2022-02-20 23:58:39,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {5917#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {5917#true} is VALID [2022-02-20 23:58:39,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {5917#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {5917#true} is VALID [2022-02-20 23:58:39,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {5917#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {5917#true} is VALID [2022-02-20 23:58:39,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {5917#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {5917#true} is VALID [2022-02-20 23:58:39,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {5917#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {5917#true} is VALID [2022-02-20 23:58:39,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {5917#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {5917#true} is VALID [2022-02-20 23:58:39,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {5917#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {5919#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {5919#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {5919#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {5919#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {5919#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {5919#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {5919#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {5919#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {5919#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {5919#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {5919#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {5919#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {5919#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {5919#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {5920#(<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {5920#(<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} assume !(dll_create_~len#1 > 0); {5920#(<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {5920#(<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {5921#(<= (+ |ULTIMATE.start_dll_create_#res#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {5921#(<= (+ |ULTIMATE.start_dll_create_#res#1.base| 1) |#StackHeapBarrier|)} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {5922#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {5922#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |#StackHeapBarrier|)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {5923#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {5923#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {5923#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {5923#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {5923#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {5923#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} assume 0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset; {5923#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {5923#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L605 {5924#(<= (+ |ULTIMATE.start_dll_remove_last_#t~mem8#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {5924#(<= (+ |ULTIMATE.start_dll_remove_last_#t~mem8#1.base| 1) |#StackHeapBarrier|)} assume 0 == dll_remove_last_#t~mem8#1.offset; {5924#(<= (+ |ULTIMATE.start_dll_remove_last_#t~mem8#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:39,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {5924#(<= (+ |ULTIMATE.start_dll_remove_last_#t~mem8#1.base| 1) |#StackHeapBarrier|)} assume !(dll_remove_last_#t~mem8#1.base < #StackHeapBarrier); {5918#false} is VALID [2022-02-20 23:58:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:39,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:39,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139697321] [2022-02-20 23:58:39,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139697321] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:39,902 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:39,903 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:58:39,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730110290] [2022-02-20 23:58:39,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:39,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:58:39,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:39,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:39,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:39,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:58:39,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:39,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:58:39,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:58:39,927 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,412 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-02-20 23:58:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:58:40,412 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:58:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2022-02-20 23:58:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2022-02-20 23:58:40,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 92 transitions. [2022-02-20 23:58:40,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:40,487 INFO L225 Difference]: With dead ends: 87 [2022-02-20 23:58:40,487 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 23:58:40,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:58:40,488 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 260 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:40,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 125 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:58:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 23:58:40,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2022-02-20 23:58:40,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:40,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,491 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,492 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,493 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-02-20 23:58:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2022-02-20 23:58:40,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:40,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:40,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-20 23:58:40,494 INFO L87 Difference]: Start difference. First operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-20 23:58:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,502 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-02-20 23:58:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2022-02-20 23:58:40,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:40,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:40,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:40,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-02-20 23:58:40,504 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 27 [2022-02-20 23:58:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:40,504 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-02-20 23:58:40,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-02-20 23:58:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:58:40,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:40,505 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:40,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:58:40,506 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:40,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:40,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1962328922, now seen corresponding path program 1 times [2022-02-20 23:58:40,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:40,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132769810] [2022-02-20 23:58:40,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:40,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:40,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {6271#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {6271#true} is VALID [2022-02-20 23:58:40,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {6271#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {6271#true} is VALID [2022-02-20 23:58:40,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {6271#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {6271#true} is VALID [2022-02-20 23:58:40,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {6271#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6271#true} is VALID [2022-02-20 23:58:40,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {6271#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {6271#true} is VALID [2022-02-20 23:58:40,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {6271#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {6271#true} is VALID [2022-02-20 23:58:40,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {6271#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {6271#true} is VALID [2022-02-20 23:58:40,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {6271#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {6271#true} is VALID [2022-02-20 23:58:40,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {6271#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {6271#true} is VALID [2022-02-20 23:58:40,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {6271#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {6271#true} is VALID [2022-02-20 23:58:40,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {6271#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6271#true} is VALID [2022-02-20 23:58:40,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {6271#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {6271#true} is VALID [2022-02-20 23:58:40,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {6271#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {6271#true} is VALID [2022-02-20 23:58:40,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {6271#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {6271#true} is VALID [2022-02-20 23:58:40,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {6271#true} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {6271#true} is VALID [2022-02-20 23:58:40,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {6271#true} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {6271#true} is VALID [2022-02-20 23:58:40,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {6271#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {6271#true} is VALID [2022-02-20 23:58:40,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {6271#true} assume !(dll_create_~len#1 > 0); {6271#true} is VALID [2022-02-20 23:58:40,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {6271#true} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {6271#true} is VALID [2022-02-20 23:58:40,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {6271#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {6271#true} is VALID [2022-02-20 23:58:40,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {6271#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {6271#true} is VALID [2022-02-20 23:58:40,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {6271#true} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {6273#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|)} is VALID [2022-02-20 23:58:40,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {6273#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|)} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {6274#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-20 23:58:40,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {6274#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {6274#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-20 23:58:40,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {6274#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {6275#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 1)} is VALID [2022-02-20 23:58:40,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {6275#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 1)} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {6276#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:40,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {6276#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} assume !(1 == #valid[dll_remove_last_~last~0#1.base]); {6272#false} is VALID [2022-02-20 23:58:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:58:40,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:40,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132769810] [2022-02-20 23:58:40,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132769810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:40,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:40,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:58:40,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314306525] [2022-02-20 23:58:40,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:40,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:58:40,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:40,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:40,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:58:40,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:40,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:58:40,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:58:40,586 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,843 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-02-20 23:58:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:58:40,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:58:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-02-20 23:58:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-02-20 23:58:40,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-02-20 23:58:40,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:40,896 INFO L225 Difference]: With dead ends: 70 [2022-02-20 23:58:40,896 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 23:58:40,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:58:40,896 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 34 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:40,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 115 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:40,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 23:58:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-02-20 23:58:40,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:40,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,898 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,898 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,900 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-02-20 23:58:40,900 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-02-20 23:58:40,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:40,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:40,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 70 states. [2022-02-20 23:58:40,901 INFO L87 Difference]: Start difference. First operand has 69 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 70 states. [2022-02-20 23:58:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,902 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-02-20 23:58:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-02-20 23:58:40,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:40,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:40,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:40,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-02-20 23:58:40,904 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 27 [2022-02-20 23:58:40,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:40,904 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-02-20 23:58:40,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-02-20 23:58:40,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:58:40,905 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:40,905 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:40,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:58:40,905 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:40,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:40,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1962328923, now seen corresponding path program 1 times [2022-02-20 23:58:40,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:40,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483999964] [2022-02-20 23:58:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:40,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:41,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {6564#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {6564#true} is VALID [2022-02-20 23:58:41,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {6564#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {6564#true} is VALID [2022-02-20 23:58:41,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {6564#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {6564#true} is VALID [2022-02-20 23:58:41,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {6564#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6564#true} is VALID [2022-02-20 23:58:41,071 INFO L290 TraceCheckUtils]: 4: Hoare triple {6564#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {6564#true} is VALID [2022-02-20 23:58:41,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {6564#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {6564#true} is VALID [2022-02-20 23:58:41,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {6564#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {6564#true} is VALID [2022-02-20 23:58:41,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {6564#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {6564#true} is VALID [2022-02-20 23:58:41,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {6564#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {6564#true} is VALID [2022-02-20 23:58:41,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {6564#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {6566#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:41,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {6566#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6566#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:41,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {6566#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {6566#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:41,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {6566#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {6566#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:41,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {6566#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {6566#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:41,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {6566#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {6566#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:41,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {6566#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {6566#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:41,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {6566#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {6567#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:41,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {6567#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(dll_create_~len#1 > 0); {6567#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:41,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {6567#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {6568#(and (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= 12 (select |#length| |ULTIMATE.start_dll_create_#res#1.base|)))} is VALID [2022-02-20 23:58:41,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {6568#(and (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= 12 (select |#length| |ULTIMATE.start_dll_create_#res#1.base|)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {6569#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 12))} is VALID [2022-02-20 23:58:41,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {6569#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 12))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {6570#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} is VALID [2022-02-20 23:58:41,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {6570#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {6571#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 0))} is VALID [2022-02-20 23:58:41,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {6571#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 0))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {6570#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} is VALID [2022-02-20 23:58:41,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {6570#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {6570#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} is VALID [2022-02-20 23:58:41,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {6570#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {6572#(and (<= 0 |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset|) (= (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 12) (<= |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 0))} is VALID [2022-02-20 23:58:41,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {6572#(and (<= 0 |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset|) (= (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 12) (<= |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 0))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {6573#(and (<= 0 |ULTIMATE.start_dll_remove_last_~last~0#1.offset|) (= (+ (- 12) (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)) 0) (<= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0))} is VALID [2022-02-20 23:58:41,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {6573#(and (<= 0 |ULTIMATE.start_dll_remove_last_~last~0#1.offset|) (= (+ (- 12) (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)) 0) (<= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0))} assume !(4 + (4 + dll_remove_last_~last~0#1.offset) <= #length[dll_remove_last_~last~0#1.base] && 0 <= 4 + dll_remove_last_~last~0#1.offset); {6565#false} is VALID [2022-02-20 23:58:41,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:41,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:41,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483999964] [2022-02-20 23:58:41,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483999964] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:41,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:41,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:58:41,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773416868] [2022-02-20 23:58:41,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:41,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:58:41,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:41,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:41,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:41,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:58:41,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:41,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:58:41,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:58:41,104 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:41,938 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-02-20 23:58:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:58:41,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:58:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2022-02-20 23:58:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2022-02-20 23:58:41,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 113 transitions. [2022-02-20 23:58:42,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:42,051 INFO L225 Difference]: With dead ends: 106 [2022-02-20 23:58:42,052 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 23:58:42,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:58:42,053 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 317 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:42,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 163 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:58:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 23:58:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2022-02-20 23:58:42,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:42,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,055 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,055 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:42,064 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-02-20 23:58:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-02-20 23:58:42,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:42,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:42,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 106 states. [2022-02-20 23:58:42,065 INFO L87 Difference]: Start difference. First operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 106 states. [2022-02-20 23:58:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:42,066 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-02-20 23:58:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-02-20 23:58:42,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:42,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:42,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:42,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-02-20 23:58:42,069 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 27 [2022-02-20 23:58:42,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:42,069 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-02-20 23:58:42,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-02-20 23:58:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:58:42,070 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:42,070 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:42,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:58:42,070 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:42,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:42,071 INFO L85 PathProgramCache]: Analyzing trace with hash 689295123, now seen corresponding path program 1 times [2022-02-20 23:58:42,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:42,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683673900] [2022-02-20 23:58:42,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:42,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:42,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {6987#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {6987#true} is VALID [2022-02-20 23:58:42,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {6987#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {6987#true} is VALID [2022-02-20 23:58:42,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {6987#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {6987#true} is VALID [2022-02-20 23:58:42,117 INFO L290 TraceCheckUtils]: 3: Hoare triple {6987#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6987#true} is VALID [2022-02-20 23:58:42,117 INFO L290 TraceCheckUtils]: 4: Hoare triple {6987#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {6987#true} is VALID [2022-02-20 23:58:42,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {6987#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {6987#true} is VALID [2022-02-20 23:58:42,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {6987#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {6987#true} is VALID [2022-02-20 23:58:42,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {6987#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {6987#true} is VALID [2022-02-20 23:58:42,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {6987#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {6987#true} is VALID [2022-02-20 23:58:42,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {6987#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {6987#true} is VALID [2022-02-20 23:58:42,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {6987#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6987#true} is VALID [2022-02-20 23:58:42,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {6987#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {6987#true} is VALID [2022-02-20 23:58:42,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {6987#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {6987#true} is VALID [2022-02-20 23:58:42,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {6987#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {6987#true} is VALID [2022-02-20 23:58:42,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {6987#true} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {6987#true} is VALID [2022-02-20 23:58:42,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {6987#true} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {6987#true} is VALID [2022-02-20 23:58:42,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {6987#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {6987#true} is VALID [2022-02-20 23:58:42,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {6987#true} assume !(dll_create_~len#1 > 0); {6987#true} is VALID [2022-02-20 23:58:42,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {6987#true} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {6987#true} is VALID [2022-02-20 23:58:42,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {6987#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {6987#true} is VALID [2022-02-20 23:58:42,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {6987#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {6987#true} is VALID [2022-02-20 23:58:42,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {6987#true} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {6989#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|)} is VALID [2022-02-20 23:58:42,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {6989#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|)} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {6990#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-20 23:58:42,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {6990#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} assume 0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset; {6990#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-20 23:58:42,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {6990#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} SUMMARY for call dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L605 {6991#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem8#1.base|) 1)} is VALID [2022-02-20 23:58:42,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {6991#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem8#1.base|) 1)} assume 0 == dll_remove_last_#t~mem8#1.offset; {6991#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem8#1.base|) 1)} is VALID [2022-02-20 23:58:42,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {6991#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem8#1.base|) 1)} assume dll_remove_last_#t~mem8#1.base < #StackHeapBarrier; {6991#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem8#1.base|) 1)} is VALID [2022-02-20 23:58:42,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {6991#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem8#1.base|) 1)} assume !(0 == dll_remove_last_#t~mem8#1.base || 1 == #valid[dll_remove_last_#t~mem8#1.base]); {6988#false} is VALID [2022-02-20 23:58:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:58:42,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:42,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683673900] [2022-02-20 23:58:42,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683673900] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:42,123 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:42,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:58:42,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791225962] [2022-02-20 23:58:42,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:42,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 23:58:42,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:42,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:42,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:58:42,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:42,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:58:42,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:58:42,141 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:42,333 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-02-20 23:58:42,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:58:42,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 23:58:42,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-02-20 23:58:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-02-20 23:58:42,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-02-20 23:58:42,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:42,376 INFO L225 Difference]: With dead ends: 75 [2022-02-20 23:58:42,376 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 23:58:42,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:42,377 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:42,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 113 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 23:58:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-02-20 23:58:42,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:42,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,379 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,379 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:42,380 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-02-20 23:58:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-02-20 23:58:42,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:42,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:42,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 75 states. [2022-02-20 23:58:42,381 INFO L87 Difference]: Start difference. First operand has 75 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 75 states. [2022-02-20 23:58:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:42,382 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-02-20 23:58:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-02-20 23:58:42,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:42,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:42,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:42,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-02-20 23:58:42,384 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 28 [2022-02-20 23:58:42,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:42,385 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-02-20 23:58:42,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-02-20 23:58:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:58:42,385 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:42,386 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:42,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:58:42,386 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:42,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:42,386 INFO L85 PathProgramCache]: Analyzing trace with hash -106687560, now seen corresponding path program 1 times [2022-02-20 23:58:42,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:42,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741412996] [2022-02-20 23:58:42,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:42,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:42,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {7298#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {7298#true} is VALID [2022-02-20 23:58:42,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {7298#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {7301#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:58:42,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {7301#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7301#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:58:42,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {7301#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {7301#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:58:42,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {7301#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {7301#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:58:42,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {7301#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {7301#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:58:42,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {7301#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {7301#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:58:42,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {7301#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {7301#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:58:42,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {7301#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {7302#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:58:42,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {7302#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} assume !(dll_create_~len#1 > 0); {7302#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:58:42,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {7302#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {7303#(not (= |ULTIMATE.start_dll_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:58:42,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {7303#(not (= |ULTIMATE.start_dll_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {7304#(not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} is VALID [2022-02-20 23:58:42,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {7304#(not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {7305#(not (= |ULTIMATE.start_dll_remove_last_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)))} is VALID [2022-02-20 23:58:42,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {7305#(not (= |ULTIMATE.start_dll_remove_last_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {7306#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_dll_remove_last_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))))} is VALID [2022-02-20 23:58:42,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {7306#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_dll_remove_last_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {7306#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_dll_remove_last_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))))} is VALID [2022-02-20 23:58:42,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {7306#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_dll_remove_last_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))))} assume 0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset; {7306#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_dll_remove_last_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))))} is VALID [2022-02-20 23:58:42,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {7306#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_dll_remove_last_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))))} SUMMARY for call dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L605 {7307#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_dll_remove_last_#t~mem8#1.base|)))} is VALID [2022-02-20 23:58:42,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {7307#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_dll_remove_last_#t~mem8#1.base|)))} assume 0 == dll_remove_last_#t~mem8#1.offset; {7307#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_dll_remove_last_#t~mem8#1.base|)))} is VALID [2022-02-20 23:58:42,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {7307#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_dll_remove_last_#t~mem8#1.base|)))} assume dll_remove_last_#t~mem8#1.base < #StackHeapBarrier; {7307#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_dll_remove_last_#t~mem8#1.base|)))} is VALID [2022-02-20 23:58:42,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {7307#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_dll_remove_last_#t~mem8#1.base|)))} assume 0 == dll_remove_last_#t~mem8#1.base || 1 == #valid[dll_remove_last_#t~mem8#1.base];call ULTIMATE.dealloc(dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset);havoc dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset; {7308#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1)} is VALID [2022-02-20 23:58:42,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {7308#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1)} assume !(1 == #valid[dll_remove_last_~head#1.base]); {7299#false} is VALID [2022-02-20 23:58:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:42,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:42,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741412996] [2022-02-20 23:58:42,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741412996] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:42,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439901849] [2022-02-20 23:58:42,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:42,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:42,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:42,526 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:58:42,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 23:58:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:42,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:58:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:42,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:42,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:42,905 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:42,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {7298#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {7298#true} is VALID [2022-02-20 23:58:42,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {7298#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,914 INFO L290 TraceCheckUtils]: 3: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,914 INFO L290 TraceCheckUtils]: 4: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !(dll_create_~len#1 > 0); {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:42,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {7300#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {7372#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_remove_last_~head#1.base|)} is VALID [2022-02-20 23:58:42,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {7372#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_remove_last_~head#1.base|)} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {7376#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_remove_last_~head#1.base|))} is VALID [2022-02-20 23:58:42,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {7376#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_remove_last_~head#1.base|))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {7376#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_remove_last_~head#1.base|))} is VALID [2022-02-20 23:58:42,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {7376#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_remove_last_~head#1.base|))} assume 0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset; {7376#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_remove_last_~head#1.base|))} is VALID [2022-02-20 23:58:42,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {7376#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_remove_last_~head#1.base|))} SUMMARY for call dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L605 {7376#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_remove_last_~head#1.base|))} is VALID [2022-02-20 23:58:42,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {7376#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_remove_last_~head#1.base|))} assume 0 == dll_remove_last_#t~mem8#1.offset; {7376#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_remove_last_~head#1.base|))} is VALID [2022-02-20 23:58:42,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {7376#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_remove_last_~head#1.base|))} assume dll_remove_last_#t~mem8#1.base < #StackHeapBarrier; {7392#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (< (+ |ULTIMATE.start_dll_remove_last_#t~mem8#1.base| 1) |ULTIMATE.start_dll_remove_last_~head#1.base|))} is VALID [2022-02-20 23:58:42,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {7392#(and (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1) (< (+ |ULTIMATE.start_dll_remove_last_#t~mem8#1.base| 1) |ULTIMATE.start_dll_remove_last_~head#1.base|))} assume 0 == dll_remove_last_#t~mem8#1.base || 1 == #valid[dll_remove_last_#t~mem8#1.base];call ULTIMATE.dealloc(dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset);havoc dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset; {7308#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1)} is VALID [2022-02-20 23:58:42,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {7308#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1)} assume !(1 == #valid[dll_remove_last_~head#1.base]); {7299#false} is VALID [2022-02-20 23:58:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:58:42,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:42,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439901849] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:42,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:58:42,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2022-02-20 23:58:42,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62999362] [2022-02-20 23:58:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:42,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:58:42,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:42,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:42,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:42,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:58:42,946 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:42,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:58:42,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:58:42,947 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:43,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:43,173 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-02-20 23:58:43,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:58:43,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:58:43,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-02-20 23:58:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-02-20 23:58:43,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2022-02-20 23:58:43,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:43,231 INFO L225 Difference]: With dead ends: 82 [2022-02-20 23:58:43,231 INFO L226 Difference]: Without dead ends: 82 [2022-02-20 23:58:43,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:58:43,232 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 122 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:43,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 82 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-20 23:58:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2022-02-20 23:58:43,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:43,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 74 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 73 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:43,235 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 74 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 73 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:43,235 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 74 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 73 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:43,236 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-02-20 23:58:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2022-02-20 23:58:43,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:43,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:43,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 73 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 82 states. [2022-02-20 23:58:43,237 INFO L87 Difference]: Start difference. First operand has 74 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 73 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 82 states. [2022-02-20 23:58:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:43,238 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-02-20 23:58:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2022-02-20 23:58:43,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:43,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:43,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:43,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 73 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2022-02-20 23:58:43,245 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 29 [2022-02-20 23:58:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:43,246 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2022-02-20 23:58:43,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2022-02-20 23:58:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:58:43,247 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:43,247 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:43,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:43,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:43,462 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:43,462 INFO L85 PathProgramCache]: Analyzing trace with hash 307453124, now seen corresponding path program 1 times [2022-02-20 23:58:43,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:43,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995703052] [2022-02-20 23:58:43,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:43,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:43,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {7724#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {7724#true} is VALID [2022-02-20 23:58:43,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {7724#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {7724#true} is VALID [2022-02-20 23:58:43,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {7724#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {7724#true} is VALID [2022-02-20 23:58:43,657 INFO L290 TraceCheckUtils]: 3: Hoare triple {7724#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7724#true} is VALID [2022-02-20 23:58:43,657 INFO L290 TraceCheckUtils]: 4: Hoare triple {7724#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {7724#true} is VALID [2022-02-20 23:58:43,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {7724#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {7724#true} is VALID [2022-02-20 23:58:43,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {7724#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {7724#true} is VALID [2022-02-20 23:58:43,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {7724#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {7724#true} is VALID [2022-02-20 23:58:43,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {7724#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {7724#true} is VALID [2022-02-20 23:58:43,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {7724#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {7726#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:43,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {7726#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7726#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:43,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {7726#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {7726#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:43,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {7726#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {7726#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:43,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {7726#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {7726#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:43,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {7726#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {7726#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:43,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {7726#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {7726#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:43,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {7726#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {7727#(= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)} is VALID [2022-02-20 23:58:43,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {7727#(= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)} assume !(dll_create_~len#1 > 0); {7727#(= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)} is VALID [2022-02-20 23:58:43,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {7727#(= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {7728#(= |ULTIMATE.start_dll_create_#res#1.offset| 0)} is VALID [2022-02-20 23:58:43,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {7728#(= |ULTIMATE.start_dll_create_#res#1.offset| 0)} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {7729#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)} is VALID [2022-02-20 23:58:43,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {7729#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {7730#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)} is VALID [2022-02-20 23:58:43,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {7730#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {7731#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|))} is VALID [2022-02-20 23:58:43,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {7731#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {7732#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) |ULTIMATE.start_dll_remove_last_#t~mem7#1.offset|) (= |ULTIMATE.start_dll_remove_last_#t~mem7#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))))} is VALID [2022-02-20 23:58:43,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {7732#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) |ULTIMATE.start_dll_remove_last_#t~mem7#1.offset|) (= |ULTIMATE.start_dll_remove_last_#t~mem7#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))))} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {7733#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 0)) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 0)))} is VALID [2022-02-20 23:58:43,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {7733#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 0)) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 0)))} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {7734#(or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)) 0)))} is VALID [2022-02-20 23:58:43,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {7734#(or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)) 0)))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {7735#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 0)))} is VALID [2022-02-20 23:58:43,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {7735#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 0)))} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {7736#(or (not (= |ULTIMATE.start_dll_remove_last_#t~mem11#1.base| 0)) (not (= |ULTIMATE.start_dll_remove_last_#t~mem11#1.offset| 0)))} is VALID [2022-02-20 23:58:43,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {7736#(or (not (= |ULTIMATE.start_dll_remove_last_#t~mem11#1.base| 0)) (not (= |ULTIMATE.start_dll_remove_last_#t~mem11#1.offset| 0)))} assume !(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset; {7725#false} is VALID [2022-02-20 23:58:43,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {7725#false} assume !(1 == #valid[dll_remove_last_~snd_to_last~0#1.base]); {7725#false} is VALID [2022-02-20 23:58:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:43,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:43,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995703052] [2022-02-20 23:58:43,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995703052] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:43,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:43,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 23:58:43,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990446808] [2022-02-20 23:58:43,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:43,666 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:58:43,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:43,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:43,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:43,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:58:43,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:43,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:58:43,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:58:43,688 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:44,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:44,387 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-20 23:58:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:58:44,387 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:58:44,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-02-20 23:58:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-02-20 23:58:44,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-02-20 23:58:44,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:44,451 INFO L225 Difference]: With dead ends: 77 [2022-02-20 23:58:44,451 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 23:58:44,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:58:44,452 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 224 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:44,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 183 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:58:44,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 23:58:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-02-20 23:58:44,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:44,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:44,454 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:44,455 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:44,456 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-20 23:58:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-02-20 23:58:44,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:44,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:44,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2022-02-20 23:58:44,457 INFO L87 Difference]: Start difference. First operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2022-02-20 23:58:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:44,458 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-20 23:58:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-02-20 23:58:44,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:44,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:44,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:44,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:44,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-02-20 23:58:44,460 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 29 [2022-02-20 23:58:44,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:44,460 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-02-20 23:58:44,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:44,460 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-02-20 23:58:44,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:58:44,461 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:44,461 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 23:58:44,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:58:44,461 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:44,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:44,462 INFO L85 PathProgramCache]: Analyzing trace with hash -890236208, now seen corresponding path program 1 times [2022-02-20 23:58:44,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:44,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620399162] [2022-02-20 23:58:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:44,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:44,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {8066#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {8066#true} is VALID [2022-02-20 23:58:44,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {8066#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {8066#true} is VALID [2022-02-20 23:58:44,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {8066#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {8066#true} is VALID [2022-02-20 23:58:44,718 INFO L290 TraceCheckUtils]: 3: Hoare triple {8066#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {8066#true} is VALID [2022-02-20 23:58:44,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {8066#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {8068#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:44,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {8068#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {8068#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:44,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {8068#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {8068#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:44,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {8068#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {8068#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:44,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {8068#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {8069#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:44,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {8069#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {8070#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:58:44,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {8070#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {8070#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:58:44,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {8070#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {8070#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:58:44,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {8070#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {8071#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:58:44,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {8071#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {8071#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:58:44,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {8071#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {8071#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:58:44,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {8071#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {8072#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) 1))} is VALID [2022-02-20 23:58:44,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {8072#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) 1))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {8073#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:44,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {8073#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(dll_create_~len#1 > 0); {8073#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:44,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {8073#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {8074#(and (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4)) 1))} is VALID [2022-02-20 23:58:44,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {8074#(and (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4)) 1))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {8075#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 23:58:44,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {8075#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {8076#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4)) 1))} is VALID [2022-02-20 23:58:44,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {8076#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4)) 1))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {8077#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} is VALID [2022-02-20 23:58:44,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {8077#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {8076#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4)) 1))} is VALID [2022-02-20 23:58:44,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {8076#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4)) 1))} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {8076#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4)) 1))} is VALID [2022-02-20 23:58:44,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {8076#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4)) 1))} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {8078#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 4)) 1) (= |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 0))} is VALID [2022-02-20 23:58:44,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {8078#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 4)) 1) (= |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 0))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {8079#(and (= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4) 4) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1))} is VALID [2022-02-20 23:58:44,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {8079#(and (= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4) 4) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1))} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {8079#(and (= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4) 4) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1))} is VALID [2022-02-20 23:58:44,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {8079#(and (= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4) 4) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1))} assume !!(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset; {8079#(and (= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4) 4) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1))} is VALID [2022-02-20 23:58:44,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {8079#(and (= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4) 4) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1))} SUMMARY for call dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L612 {8080#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem10#1.base|) 1)} is VALID [2022-02-20 23:58:44,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {8080#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem10#1.base|) 1)} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset;havoc dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset; {8081#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:44,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {8081#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} assume !(1 == #valid[dll_remove_last_~last~0#1.base]); {8067#false} is VALID [2022-02-20 23:58:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:44,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:44,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620399162] [2022-02-20 23:58:44,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620399162] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:44,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799355951] [2022-02-20 23:58:44,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:44,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:44,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:44,737 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:58:44,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 23:58:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:44,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjunts are in the unsatisfiable core [2022-02-20 23:58:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:44,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:44,930 INFO L390 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 [2022-02-20 23:58:45,020 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:58:45,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:58:45,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2022-02-20 23:58:45,123 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-20 23:58:45,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-02-20 23:58:45,172 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:58:45,172 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-02-20 23:58:45,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 49 treesize of output 37 [2022-02-20 23:58:45,698 INFO L356 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-02-20 23:58:45,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2022-02-20 23:58:45,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {8066#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {8066#true} is VALID [2022-02-20 23:58:45,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {8066#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {8088#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} is VALID [2022-02-20 23:58:45,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {8088#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {8092#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,740 INFO L290 TraceCheckUtils]: 3: Hoare triple {8092#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {8092#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,740 INFO L290 TraceCheckUtils]: 4: Hoare triple {8092#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {8092#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {8092#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {8092#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {8092#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {8092#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {8092#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {8092#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {8092#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {8111#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {8111#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {8115#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {8115#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {8115#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {8115#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {8115#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {8115#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {8125#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {8125#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {8125#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {8125#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {8125#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {8125#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {8135#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) 1))} is VALID [2022-02-20 23:58:45,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {8135#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) 1))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {8139#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {8139#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(dll_create_~len#1 > 0); {8139#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {8139#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {8146#(and (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4))) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {8146#(and (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4))) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {8150#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {8150#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {8154#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1))} is VALID [2022-02-20 23:58:45,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {8154#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {8154#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1))} is VALID [2022-02-20 23:58:45,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {8154#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {8154#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1))} is VALID [2022-02-20 23:58:45,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {8154#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1))} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {8154#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1))} is VALID [2022-02-20 23:58:45,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {8154#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1))} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {8167#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|)))} is VALID [2022-02-20 23:58:45,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {8167#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|)))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {8171#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} is VALID [2022-02-20 23:58:45,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {8171#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {8171#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} is VALID [2022-02-20 23:58:45,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {8171#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} assume !!(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset; {8171#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} is VALID [2022-02-20 23:58:45,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {8171#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} SUMMARY for call dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L612 {8080#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem10#1.base|) 1)} is VALID [2022-02-20 23:58:45,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {8080#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem10#1.base|) 1)} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset;havoc dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset; {8081#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:45,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {8081#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} assume !(1 == #valid[dll_remove_last_~last~0#1.base]); {8067#false} is VALID [2022-02-20 23:58:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:45,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:45,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 28 treesize of output 20 [2022-02-20 23:58:46,191 INFO L356 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2022-02-20 23:58:46,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-02-20 23:58:46,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2022-02-20 23:58:46,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1197 Int) (v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1197)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-02-20 23:58:46,440 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-02-20 23:58:46,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 76 treesize of output 51 [2022-02-20 23:58:46,485 INFO L356 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2022-02-20 23:58:46,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 124 [2022-02-20 23:58:46,496 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:58:46,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 104 [2022-02-20 23:58:46,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {8081#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} assume !(1 == #valid[dll_remove_last_~last~0#1.base]); {8067#false} is VALID [2022-02-20 23:58:46,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {8080#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem10#1.base|) 1)} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset;havoc dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset; {8081#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-20 23:58:46,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {8193#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1)} SUMMARY for call dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L612 {8080#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem10#1.base|) 1)} is VALID [2022-02-20 23:58:46,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {8193#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1)} assume !!(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset; {8193#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:58:46,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {8193#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1)} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {8193#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:58:46,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {8203#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4))) 1)} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {8193#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:58:46,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {8207#(= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1)} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {8203#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4))) 1)} is VALID [2022-02-20 23:58:46,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {8207#(= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1)} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {8207#(= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1)} is VALID [2022-02-20 23:58:46,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {8207#(= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1)} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {8207#(= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1)} is VALID [2022-02-20 23:58:46,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {8207#(= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1)} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {8207#(= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1)} is VALID [2022-02-20 23:58:46,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {8220#(= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {8207#(= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4))) 1)} is VALID [2022-02-20 23:58:46,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {8224#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4))) 1) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {8220#(= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)} is VALID [2022-02-20 23:58:46,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {8228#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 1)))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {8224#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4))) 1) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} is VALID [2022-02-20 23:58:46,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {8228#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 1)))} assume !(dll_create_~len#1 > 0); {8228#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 1)))} is VALID [2022-02-20 23:58:46,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {8235#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {8228#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 1)))} is VALID [2022-02-20 23:58:46,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {8239#(forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {8235#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} is VALID [2022-02-20 23:58:46,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {8239#(forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {8239#(forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))} is VALID [2022-02-20 23:58:46,761 WARN L290 TraceCheckUtils]: 13: Hoare triple {8246#(forall ((v_ArrVal_1197 Int) (v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1197)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1197)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1197)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {8239#(forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))} is UNKNOWN [2022-02-20 23:58:46,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {8250#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {8246#(forall ((v_ArrVal_1197 Int) (v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1197)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1197)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1197)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))} is VALID [2022-02-20 23:58:46,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {8250#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {8250#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))} is VALID [2022-02-20 23:58:46,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {8250#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {8250#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))} is VALID [2022-02-20 23:58:46,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {8260#(not (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {8250#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))} is VALID [2022-02-20 23:58:46,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {8264#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {8260#(not (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 0))} is VALID [2022-02-20 23:58:46,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {8264#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {8264#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:58:46,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {8264#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {8264#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:58:46,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {8264#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {8264#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:58:46,764 INFO L290 TraceCheckUtils]: 4: Hoare triple {8264#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {8264#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:58:46,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {8264#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {8264#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:58:46,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {8066#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {8264#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:58:46,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {8066#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {8066#true} is VALID [2022-02-20 23:58:46,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {8066#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {8066#true} is VALID [2022-02-20 23:58:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-20 23:58:46,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799355951] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:46,767 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:46,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2022-02-20 23:58:46,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512861628] [2022-02-20 23:58:46,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:46,768 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 23:58:46,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:46,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:46,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:46,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-20 23:58:46,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:46,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-20 23:58:46,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1299, Unknown=2, NotChecked=146, Total=1560 [2022-02-20 23:58:46,862 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:47,290 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_1197 Int) (v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1197)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2022-02-20 23:58:47,293 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2022-02-20 23:58:47,297 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2022-02-20 23:58:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:49,607 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2022-02-20 23:58:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 23:58:49,608 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 23:58:49,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 155 transitions. [2022-02-20 23:58:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 155 transitions. [2022-02-20 23:58:49,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 155 transitions. [2022-02-20 23:58:49,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:49,759 INFO L225 Difference]: With dead ends: 154 [2022-02-20 23:58:49,759 INFO L226 Difference]: Without dead ends: 154 [2022-02-20 23:58:49,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=291, Invalid=2274, Unknown=5, NotChecked=510, Total=3080 [2022-02-20 23:58:49,760 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 302 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 462 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:49,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 762 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1115 Invalid, 0 Unknown, 462 Unchecked, 0.9s Time] [2022-02-20 23:58:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-02-20 23:58:49,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 94. [2022-02-20 23:58:49,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:49,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 94 states, 80 states have (on average 1.275) internal successors, (102), 93 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:49,762 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 94 states, 80 states have (on average 1.275) internal successors, (102), 93 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:49,763 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 94 states, 80 states have (on average 1.275) internal successors, (102), 93 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:49,765 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2022-02-20 23:58:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2022-02-20 23:58:49,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:49,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:49,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 80 states have (on average 1.275) internal successors, (102), 93 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 154 states. [2022-02-20 23:58:49,766 INFO L87 Difference]: Start difference. First operand has 94 states, 80 states have (on average 1.275) internal successors, (102), 93 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 154 states. [2022-02-20 23:58:49,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:49,769 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2022-02-20 23:58:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2022-02-20 23:58:49,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:49,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:49,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:49,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:49,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.275) internal successors, (102), 93 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2022-02-20 23:58:49,771 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 31 [2022-02-20 23:58:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:49,771 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2022-02-20 23:58:49,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-02-20 23:58:49,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:58:49,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:49,772 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 23:58:49,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:49,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:49,998 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:58:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:49,998 INFO L85 PathProgramCache]: Analyzing trace with hash -890236207, now seen corresponding path program 1 times [2022-02-20 23:58:49,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:49,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306385055] [2022-02-20 23:58:49,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:49,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:50,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {8877#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {8877#true} is VALID [2022-02-20 23:58:50,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {8877#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {8877#true} is VALID [2022-02-20 23:58:50,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {8877#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {8879#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:50,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {8879#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {8879#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:50,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {8879#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {8880#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:50,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {8880#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {8880#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:50,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {8880#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {8880#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:50,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {8880#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {8880#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:58:50,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {8880#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {8881#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:50,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {8881#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {8882#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:50,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {8882#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {8882#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:50,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {8882#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {8882#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:50,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {8882#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {8883#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (or (and (<= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 11) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))))} is VALID [2022-02-20 23:58:50,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {8883#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (or (and (<= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 11) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {8883#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (or (and (<= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 11) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))))} is VALID [2022-02-20 23:58:50,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {8883#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (or (and (<= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 11) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {8883#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (or (and (<= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 11) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))))} is VALID [2022-02-20 23:58:50,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {8883#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (or (and (<= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 11) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)))))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {8884#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))} is VALID [2022-02-20 23:58:50,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {8884#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {8885#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-20 23:58:50,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {8885#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} assume !(dll_create_~len#1 > 0); {8885#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-20 23:58:50,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {8885#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {8886#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))))} is VALID [2022-02-20 23:58:50,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {8886#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {8887#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-20 23:58:50,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {8887#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {8888#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} is VALID [2022-02-20 23:58:50,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {8888#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {8889#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) 4) 0))} is VALID [2022-02-20 23:58:50,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {8889#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) 4) 0))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {8888#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} is VALID [2022-02-20 23:58:50,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {8888#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {8888#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} is VALID [2022-02-20 23:58:50,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {8888#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {8890#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 4) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 4))) (= |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 0))} is VALID [2022-02-20 23:58:50,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {8890#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 4) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 4))) (= |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 0))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {8891#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:58:50,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {8891#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 0))} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {8892#(and (= |ULTIMATE.start_dll_remove_last_#t~mem11#1.offset| 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:58:50,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {8892#(and (= |ULTIMATE.start_dll_remove_last_#t~mem11#1.offset| 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 0))} assume !!(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset; {8891#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:58:50,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {8891#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 0))} SUMMARY for call dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L612 {8893#(and (<= 12 (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem10#1.base|)) (= |ULTIMATE.start_dll_remove_last_#t~mem10#1.offset| 0))} is VALID [2022-02-20 23:58:50,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {8893#(and (<= 12 (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem10#1.base|)) (= |ULTIMATE.start_dll_remove_last_#t~mem10#1.offset| 0))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset;havoc dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset; {8894#(and (<= 12 (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)) (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0))} is VALID [2022-02-20 23:58:50,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {8894#(and (<= 12 (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)) (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0))} assume !(4 + (4 + dll_remove_last_~last~0#1.offset) <= #length[dll_remove_last_~last~0#1.base] && 0 <= 4 + dll_remove_last_~last~0#1.offset); {8878#false} is VALID [2022-02-20 23:58:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:50,489 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:50,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306385055] [2022-02-20 23:58:50,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306385055] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:50,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535157576] [2022-02-20 23:58:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:50,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:50,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:50,490 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:58:50,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 23:58:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:50,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 75 conjunts are in the unsatisfiable core [2022-02-20 23:58:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:50,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:50,677 INFO L390 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 [2022-02-20 23:58:50,778 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:58:50,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:58:50,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2022-02-20 23:58:50,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2022-02-20 23:58:50,936 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-20 23:58:50,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-02-20 23:58:50,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:50,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-20 23:58:51,012 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:58:51,012 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-02-20 23:58:51,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-02-20 23:58:51,720 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-02-20 23:58:51,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 54 [2022-02-20 23:58:51,753 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-02-20 23:58:51,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2022-02-20 23:58:51,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {8877#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {8877#true} is VALID [2022-02-20 23:58:51,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {8877#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {8901#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} is VALID [2022-02-20 23:58:51,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {8901#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {8905#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:51,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {8905#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {8905#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:51,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {8905#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {8905#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:51,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {8905#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {8905#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:51,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {8905#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {8905#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:51,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {8905#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {8905#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:51,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {8905#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {8924#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:51,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {8924#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {8928#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:51,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {8928#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {8928#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:51,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {8928#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {8928#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:58:51,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {8928#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {8938#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:51,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {8938#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~head~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {8938#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:51,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {8938#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~head~0#1.offset|))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {8938#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:51,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {8938#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~head~0#1.offset|))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {8948#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))} is VALID [2022-02-20 23:58:51,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {8948#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {8952#(and (<= (+ 12 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:58:51,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {8952#(and (<= (+ 12 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 0))} assume !(dll_create_~len#1 > 0); {8952#(and (<= (+ 12 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:58:51,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {8952#(and (<= (+ 12 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {8959#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) 0) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:58:51,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {8959#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) 0) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {8963#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))} is VALID [2022-02-20 23:58:51,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {8963#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {8967#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 0) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} is VALID [2022-02-20 23:58:51,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {8967#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 0) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {8967#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 0) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} is VALID [2022-02-20 23:58:51,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {8967#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 0) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {8967#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 0) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} is VALID [2022-02-20 23:58:51,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {8967#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 0) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {8967#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 0) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} is VALID [2022-02-20 23:58:51,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {8967#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 0) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {8980#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))))) (= |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|)))} is VALID [2022-02-20 23:58:51,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {8980#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))))) (= |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|)))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {8984#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)))))))} is VALID [2022-02-20 23:58:51,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {8984#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)))))))} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {8984#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)))))))} is VALID [2022-02-20 23:58:51,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {8984#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)))))))} assume !!(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset; {8984#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)))))))} is VALID [2022-02-20 23:58:51,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {8984#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)))))))} SUMMARY for call dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L612 {8893#(and (<= 12 (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem10#1.base|)) (= |ULTIMATE.start_dll_remove_last_#t~mem10#1.offset| 0))} is VALID [2022-02-20 23:58:51,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {8893#(and (<= 12 (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem10#1.base|)) (= |ULTIMATE.start_dll_remove_last_#t~mem10#1.offset| 0))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset;havoc dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset; {8894#(and (<= 12 (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)) (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0))} is VALID [2022-02-20 23:58:51,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {8894#(and (<= 12 (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)) (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0))} assume !(4 + (4 + dll_remove_last_~last~0#1.offset) <= #length[dll_remove_last_~last~0#1.base] && 0 <= 4 + dll_remove_last_~last~0#1.offset); {8878#false} is VALID [2022-02-20 23:58:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:51,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:52,702 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:58:52,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 94 [2022-02-20 23:58:52,992 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308))) (let ((.cse0 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (let ((.cse4 (+ .cse1 4))) (let ((.cse2 (select (select .cse5 .cse0) .cse4))) (and (<= .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (= (select (select .cse3 .cse0) .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= 0 (+ .cse2 4))))))))) is different from false [2022-02-20 23:58:53,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1303 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1302 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse6 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306)) (.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308))) (let ((.cse0 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse3 (+ .cse5 4))) (let ((.cse1 (select (select .cse4 .cse0) .cse3))) (and (<= .cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (<= 0 (+ .cse1 4)) (= (select (select .cse2 .cse0) .cse3) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) is different from false [2022-02-20 23:58:53,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:58:53,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:58:53,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 245 treesize of output 190 [2022-02-20 23:58:53,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:58:53,807 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:58:53,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 115 [2022-02-20 23:58:53,907 INFO L356 Elim1Store]: treesize reduction 30, result has 67.0 percent of original size [2022-02-20 23:58:53,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 267 treesize of output 266 [2022-02-20 23:58:54,126 INFO L356 Elim1Store]: treesize reduction 156, result has 42.9 percent of original size [2022-02-20 23:58:54,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 580 treesize of output 572 [2022-02-20 23:58:54,174 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:58:54,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 472 treesize of output 454 [2022-02-20 23:58:54,208 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:58:54,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 460 treesize of output 442 [2022-02-20 23:59:01,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {9000#(and (<= 0 (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) (<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} assume !(4 + (4 + dll_remove_last_~last~0#1.offset) <= #length[dll_remove_last_~last~0#1.base] && 0 <= 4 + dll_remove_last_~last~0#1.offset); {8878#false} is VALID [2022-02-20 23:59:01,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {9004#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_#t~mem10#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem10#1.base|)) (<= 0 (+ 4 |ULTIMATE.start_dll_remove_last_#t~mem10#1.offset|)))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset;havoc dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset; {9000#(and (<= 0 (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) (<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} is VALID [2022-02-20 23:59:01,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {9008#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))))} SUMMARY for call dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L612 {9004#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_#t~mem10#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem10#1.base|)) (<= 0 (+ 4 |ULTIMATE.start_dll_remove_last_#t~mem10#1.offset|)))} is VALID [2022-02-20 23:59:01,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {9008#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))))} assume !!(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset; {9008#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))))} is VALID [2022-02-20 23:59:01,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {9008#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))))} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {9008#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))))} is VALID [2022-02-20 23:59:01,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {9018#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)) 4)))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {9008#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))))} is VALID [2022-02-20 23:59:01,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {9022#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))))} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {9018#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)) 4)))} is VALID [2022-02-20 23:59:01,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {9022#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))))} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {9022#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))))} is VALID [2022-02-20 23:59:01,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {9022#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {9022#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))))} is VALID [2022-02-20 23:59:01,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {9022#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {9022#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))))} is VALID [2022-02-20 23:59:01,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {9035#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)))))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {9022#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))))} is VALID [2022-02-20 23:59:01,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {9039#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_#res#1.offset|)) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {9035#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)))))} is VALID [2022-02-20 23:59:01,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {9043#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_~head~0#1.offset|))))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {9039#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_#res#1.offset|)) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} is VALID [2022-02-20 23:59:01,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {9043#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_~head~0#1.offset|))))} assume !(dll_create_~len#1 > 0); {9043#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_~head~0#1.offset|))))} is VALID [2022-02-20 23:59:01,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {9050#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {9043#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_~head~0#1.offset|))))} is VALID [2022-02-20 23:59:01,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {9054#(forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (or (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) (<= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (not (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_~new_head~0#1.offset|))))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {9050#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} is VALID [2022-02-20 23:59:01,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {9054#(forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (or (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) (<= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (not (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_~new_head~0#1.offset|))))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {9054#(forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (or (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) (<= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (not (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_~new_head~0#1.offset|))))} is VALID [2022-02-20 23:59:01,874 WARN L290 TraceCheckUtils]: 13: Hoare triple {9061#(forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1303 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1302 Int) (v_ArrVal_1308 (Array Int Int))) (or (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1303)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1302)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= 0 (+ (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1302)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1303)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1302)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) 4)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1303)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1303)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1302)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))) (<= (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1302)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1303)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1302)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {9054#(forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (or (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) (<= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (not (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_~new_head~0#1.offset|))))} is UNKNOWN [2022-02-20 23:59:01,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {9065#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {9061#(forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1303 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1302 Int) (v_ArrVal_1308 (Array Int Int))) (or (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1303)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1302)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= 0 (+ (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1302)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1303)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1302)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) 4)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1303)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1303)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1302)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))) (<= (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1302)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1303)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1302)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))} is VALID [2022-02-20 23:59:01,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {9065#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {9065#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:59:01,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {9065#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {9065#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:59:01,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {9075#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|) 0)) (and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|)))))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {9065#(and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:59:01,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {9079#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|) 0))))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {9075#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|) 0)) (and (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|)))))} is VALID [2022-02-20 23:59:01,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {9079#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|) 0))))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {9079#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|) 0))))} is VALID [2022-02-20 23:59:01,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {9079#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|) 0))))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {9079#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|) 0))))} is VALID [2022-02-20 23:59:01,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {9079#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|) 0))))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {9079#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|) 0))))} is VALID [2022-02-20 23:59:01,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {9079#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|) 0))))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {9079#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|) 0))))} is VALID [2022-02-20 23:59:01,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {9079#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|) 0))))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {9079#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|) 0))))} is VALID [2022-02-20 23:59:01,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {8877#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {9079#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32|) 0))))} is VALID [2022-02-20 23:59:01,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {8877#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {8877#true} is VALID [2022-02-20 23:59:01,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {8877#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {8877#true} is VALID [2022-02-20 23:59:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-20 23:59:01,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535157576] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:01,887 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:59:01,887 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 43 [2022-02-20 23:59:01,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373653011] [2022-02-20 23:59:01,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:01,888 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 23:59:01,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:01,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:01,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 87 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:01,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-02-20 23:59:01,983 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:01,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-02-20 23:59:01,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1606, Unknown=2, NotChecked=162, Total=1892 [2022-02-20 23:59:01,984 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:02,381 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse11)) (.cse8 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse11) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1303 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1302 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse7 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306)) (.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308))) (let ((.cse1 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse4 (+ .cse6 4))) (let ((.cse2 (select (select .cse5 .cse1) .cse4))) (and (<= .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (<= 0 (+ .cse2 4)) (= (select (select .cse3 .cse1) .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (not (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse8 (= .cse9 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse9) (let ((.cse10 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and .cse8 (<= 12 .cse10)) (and .cse0 (<= .cse10 11))))))) is different from false [2022-02-20 23:59:02,391 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10)) (.cse1 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse1 (= .cse2 0) (forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308))) (let ((.cse3 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse8 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (let ((.cse7 (+ .cse4 4))) (let ((.cse5 (select (select .cse8 .cse3) .cse7))) (and (<= .cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (= (select (select .cse6 .cse3) .cse7) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= 0 (+ .cse5 4))))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse2) (let ((.cse9 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and .cse1 (<= 12 .cse9)) (and .cse0 (<= .cse9 11))))))) is different from false [2022-02-20 23:59:02,400 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10)) (.cse1 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (= .cse2 0) (forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308))) (let ((.cse3 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse8 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (let ((.cse7 (+ .cse4 4))) (let ((.cse5 (select (select .cse8 .cse3) .cse7))) (and (<= .cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (= (select (select .cse6 .cse3) .cse7) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= 0 (+ .cse5 4))))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse2) (let ((.cse9 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and .cse1 (<= 12 .cse9)) (and .cse0 (<= .cse9 11))))))) is different from false [2022-02-20 23:59:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:05,955 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2022-02-20 23:59:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-20 23:59:05,956 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 23:59:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 228 transitions. [2022-02-20 23:59:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 228 transitions. [2022-02-20 23:59:05,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 228 transitions. [2022-02-20 23:59:06,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:06,160 INFO L225 Difference]: With dead ends: 220 [2022-02-20 23:59:06,160 INFO L226 Difference]: Without dead ends: 220 [2022-02-20 23:59:06,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=336, Invalid=3101, Unknown=5, NotChecked=590, Total=4032 [2022-02-20 23:59:06,162 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 460 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 711 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:06,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [460 Valid, 1190 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1174 Invalid, 0 Unknown, 711 Unchecked, 1.0s Time] [2022-02-20 23:59:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-02-20 23:59:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 94. [2022-02-20 23:59:06,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:06,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand has 94 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:06,165 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand has 94 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:06,165 INFO L87 Difference]: Start difference. First operand 220 states. Second operand has 94 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:06,168 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2022-02-20 23:59:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2022-02-20 23:59:06,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:06,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:06,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 220 states. [2022-02-20 23:59:06,170 INFO L87 Difference]: Start difference. First operand has 94 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 220 states. [2022-02-20 23:59:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:06,173 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2022-02-20 23:59:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2022-02-20 23:59:06,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:06,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:06,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:06,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-02-20 23:59:06,176 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 31 [2022-02-20 23:59:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:06,176 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-02-20 23:59:06,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-02-20 23:59:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:59:06,177 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:06,177 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2022-02-20 23:59:06,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:06,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-02-20 23:59:06,379 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:59:06,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:06,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1649773349, now seen corresponding path program 1 times [2022-02-20 23:59:06,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:06,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100481038] [2022-02-20 23:59:06,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:06,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:06,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {9897#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {9897#true} is VALID [2022-02-20 23:59:06,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {9897#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {9897#true} is VALID [2022-02-20 23:59:06,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {9897#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {9897#true} is VALID [2022-02-20 23:59:06,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {9897#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {9897#true} is VALID [2022-02-20 23:59:06,450 INFO L290 TraceCheckUtils]: 4: Hoare triple {9897#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {9897#true} is VALID [2022-02-20 23:59:06,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {9897#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {9897#true} is VALID [2022-02-20 23:59:06,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {9897#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {9897#true} is VALID [2022-02-20 23:59:06,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {9897#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {9897#true} is VALID [2022-02-20 23:59:06,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {9897#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {9897#true} is VALID [2022-02-20 23:59:06,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {9897#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {9897#true} is VALID [2022-02-20 23:59:06,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {9897#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {9897#true} is VALID [2022-02-20 23:59:06,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {9897#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {9897#true} is VALID [2022-02-20 23:59:06,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {9897#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {9897#true} is VALID [2022-02-20 23:59:06,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {9897#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {9897#true} is VALID [2022-02-20 23:59:06,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {9897#true} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {9897#true} is VALID [2022-02-20 23:59:06,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {9897#true} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {9897#true} is VALID [2022-02-20 23:59:06,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {9897#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {9897#true} is VALID [2022-02-20 23:59:06,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {9897#true} assume !(dll_create_~len#1 > 0); {9897#true} is VALID [2022-02-20 23:59:06,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {9897#true} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {9897#true} is VALID [2022-02-20 23:59:06,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {9897#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {9897#true} is VALID [2022-02-20 23:59:06,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {9897#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:06,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:06,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:06,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} assume 0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset; {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:06,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L605 {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:06,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} assume 0 == dll_remove_last_#t~mem8#1.offset; {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:06,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} assume dll_remove_last_#t~mem8#1.base < #StackHeapBarrier; {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:06,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} assume 0 == dll_remove_last_#t~mem8#1.base || 1 == #valid[dll_remove_last_#t~mem8#1.base];call ULTIMATE.dealloc(dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset);havoc dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset; {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:59:06,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {9899#(= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(0, 0, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L606 {9900#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:06,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {9900#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume { :end_inline_dll_remove_last } true; {9900#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:06,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {9900#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {9900#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:06,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {9900#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(main_~i~0#1 >= 0); {9900#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:06,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {9900#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(1 == #valid[main_~#s~0#1.base]); {9898#false} is VALID [2022-02-20 23:59:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:59:06,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:06,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100481038] [2022-02-20 23:59:06,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100481038] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:06,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:06,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:59:06,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648528505] [2022-02-20 23:59:06,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:06,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 23:59:06,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:06,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:06,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:06,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:59:06,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:06,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:59:06,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:59:06,480 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:06,581 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-02-20 23:59:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:59:06,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 23:59:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 23:59:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 23:59:06,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 23:59:06,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:06,636 INFO L225 Difference]: With dead ends: 99 [2022-02-20 23:59:06,636 INFO L226 Difference]: Without dead ends: 99 [2022-02-20 23:59:06,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:59:06,637 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 74 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:06,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 41 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-20 23:59:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-02-20 23:59:06,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:06,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 99 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 98 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:06,639 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 99 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 98 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:06,639 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 99 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 98 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:06,640 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-02-20 23:59:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2022-02-20 23:59:06,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:06,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:06,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 98 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 99 states. [2022-02-20 23:59:06,641 INFO L87 Difference]: Start difference. First operand has 99 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 98 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 99 states. [2022-02-20 23:59:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:06,642 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-02-20 23:59:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2022-02-20 23:59:06,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:06,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:06,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:06,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 98 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2022-02-20 23:59:06,646 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 33 [2022-02-20 23:59:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:06,647 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2022-02-20 23:59:06,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2022-02-20 23:59:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:59:06,648 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:06,648 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 23:59:06,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 23:59:06,648 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:59:06,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:06,648 INFO L85 PathProgramCache]: Analyzing trace with hash -818501958, now seen corresponding path program 1 times [2022-02-20 23:59:06,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:06,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377033865] [2022-02-20 23:59:06,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:06,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:06,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {10301#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {10301#true} is VALID [2022-02-20 23:59:06,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {10301#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {10301#true} is VALID [2022-02-20 23:59:06,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {10301#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {10301#true} is VALID [2022-02-20 23:59:06,723 INFO L290 TraceCheckUtils]: 3: Hoare triple {10301#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {10301#true} is VALID [2022-02-20 23:59:06,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {10301#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {10301#true} is VALID [2022-02-20 23:59:06,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {10301#true} is VALID [2022-02-20 23:59:06,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {10301#true} is VALID [2022-02-20 23:59:06,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {10301#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {10301#true} is VALID [2022-02-20 23:59:06,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {10301#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {10301#true} is VALID [2022-02-20 23:59:06,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {10301#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {10301#true} is VALID [2022-02-20 23:59:06,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {10301#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {10301#true} is VALID [2022-02-20 23:59:06,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {10301#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {10301#true} is VALID [2022-02-20 23:59:06,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {10301#true} is VALID [2022-02-20 23:59:06,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {10301#true} is VALID [2022-02-20 23:59:06,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {10301#true} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {10301#true} is VALID [2022-02-20 23:59:06,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {10301#true} is VALID [2022-02-20 23:59:06,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {10301#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {10301#true} is VALID [2022-02-20 23:59:06,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {10301#true} assume !(dll_create_~len#1 > 0); {10301#true} is VALID [2022-02-20 23:59:06,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {10301#true} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {10301#true} is VALID [2022-02-20 23:59:06,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {10301#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {10301#true} is VALID [2022-02-20 23:59:06,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {10301#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {10301#true} is VALID [2022-02-20 23:59:06,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {10301#true} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {10303#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|)} is VALID [2022-02-20 23:59:06,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {10303#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|)} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {10304#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-20 23:59:06,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {10304#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {10304#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-20 23:59:06,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {10304#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {10305#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 1)} is VALID [2022-02-20 23:59:06,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {10305#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 1)} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {10306#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:06,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {10306#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {10306#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:06,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {10306#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} assume !!(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset; {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:06,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} SUMMARY for call dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L612 {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:06,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset;havoc dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset; {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:06,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:06,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} assume !(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset; {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:06,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} assume !(1 == #valid[dll_remove_last_~snd_to_last~0#1.base]); {10302#false} is VALID [2022-02-20 23:59:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:59:06,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:06,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377033865] [2022-02-20 23:59:06,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377033865] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:06,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59770999] [2022-02-20 23:59:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:06,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:06,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:06,740 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:06,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 23:59:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:06,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:59:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:06,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:06,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2022-02-20 23:59:07,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {10301#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {10301#true} is VALID [2022-02-20 23:59:07,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {10301#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {10301#true} is VALID [2022-02-20 23:59:07,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {10301#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {10301#true} is VALID [2022-02-20 23:59:07,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {10301#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {10301#true} is VALID [2022-02-20 23:59:07,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {10301#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {10301#true} is VALID [2022-02-20 23:59:07,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {10301#true} is VALID [2022-02-20 23:59:07,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {10301#true} is VALID [2022-02-20 23:59:07,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {10301#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {10301#true} is VALID [2022-02-20 23:59:07,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {10301#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {10301#true} is VALID [2022-02-20 23:59:07,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {10301#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {10301#true} is VALID [2022-02-20 23:59:07,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {10301#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {10301#true} is VALID [2022-02-20 23:59:07,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {10301#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {10301#true} is VALID [2022-02-20 23:59:07,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {10301#true} is VALID [2022-02-20 23:59:07,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {10301#true} is VALID [2022-02-20 23:59:07,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {10301#true} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {10301#true} is VALID [2022-02-20 23:59:07,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {10301#true} is VALID [2022-02-20 23:59:07,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {10301#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {10301#true} is VALID [2022-02-20 23:59:07,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {10301#true} assume !(dll_create_~len#1 > 0); {10301#true} is VALID [2022-02-20 23:59:07,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {10301#true} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {10301#true} is VALID [2022-02-20 23:59:07,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {10301#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {10301#true} is VALID [2022-02-20 23:59:07,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {10301#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {10301#true} is VALID [2022-02-20 23:59:07,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {10301#true} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {10303#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|)} is VALID [2022-02-20 23:59:07,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {10303#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|)} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {10304#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-20 23:59:07,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {10304#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {10304#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-20 23:59:07,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {10304#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {10305#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 1)} is VALID [2022-02-20 23:59:07,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {10305#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 1)} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {10306#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:07,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {10306#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {10306#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:07,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {10306#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} assume !!(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset; {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:07,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} SUMMARY for call dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L612 {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:07,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset;havoc dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset; {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:07,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:07,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} assume !(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset; {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:07,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} assume !(1 == #valid[dll_remove_last_~snd_to_last~0#1.base]); {10302#false} is VALID [2022-02-20 23:59:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:59:07,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:07,073 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-02-20 23:59:07,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-02-20 23:59:07,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} assume !(1 == #valid[dll_remove_last_~snd_to_last~0#1.base]); {10302#false} is VALID [2022-02-20 23:59:07,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} assume !(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset; {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:07,115 INFO L290 TraceCheckUtils]: 30: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:07,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset;havoc dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset; {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:07,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} SUMMARY for call dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L612 {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:07,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {10306#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} assume !!(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset; {10307#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-20 23:59:07,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {10306#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {10306#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:07,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {10305#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 1)} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {10306#(= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:07,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {10304#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {10305#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 1)} is VALID [2022-02-20 23:59:07,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {10304#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {10304#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-20 23:59:07,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {10303#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|)} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {10304#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-20 23:59:07,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {10301#true} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {10303#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|)} is VALID [2022-02-20 23:59:07,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {10301#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {10301#true} is VALID [2022-02-20 23:59:07,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {10301#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {10301#true} is VALID [2022-02-20 23:59:07,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {10301#true} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {10301#true} is VALID [2022-02-20 23:59:07,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {10301#true} assume !(dll_create_~len#1 > 0); {10301#true} is VALID [2022-02-20 23:59:07,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {10301#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {10301#true} is VALID [2022-02-20 23:59:07,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {10301#true} is VALID [2022-02-20 23:59:07,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {10301#true} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {10301#true} is VALID [2022-02-20 23:59:07,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {10301#true} is VALID [2022-02-20 23:59:07,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {10301#true} is VALID [2022-02-20 23:59:07,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {10301#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {10301#true} is VALID [2022-02-20 23:59:07,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {10301#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {10301#true} is VALID [2022-02-20 23:59:07,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {10301#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {10301#true} is VALID [2022-02-20 23:59:07,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {10301#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {10301#true} is VALID [2022-02-20 23:59:07,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {10301#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {10301#true} is VALID [2022-02-20 23:59:07,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {10301#true} is VALID [2022-02-20 23:59:07,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {10301#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {10301#true} is VALID [2022-02-20 23:59:07,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {10301#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {10301#true} is VALID [2022-02-20 23:59:07,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {10301#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {10301#true} is VALID [2022-02-20 23:59:07,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {10301#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {10301#true} is VALID [2022-02-20 23:59:07,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {10301#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {10301#true} is VALID [2022-02-20 23:59:07,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {10301#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {10301#true} is VALID [2022-02-20 23:59:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:59:07,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59770999] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:07,123 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:59:07,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2022-02-20 23:59:07,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549728741] [2022-02-20 23:59:07,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:07,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 23:59:07,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:07,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:07,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:07,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:59:07,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:07,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:59:07,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:59:07,148 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:07,426 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-02-20 23:59:07,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:59:07,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 23:59:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-02-20 23:59:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-02-20 23:59:07,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 57 transitions. [2022-02-20 23:59:07,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:07,467 INFO L225 Difference]: With dead ends: 99 [2022-02-20 23:59:07,467 INFO L226 Difference]: Without dead ends: 99 [2022-02-20 23:59:07,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:59:07,468 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 35 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:07,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 130 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:59:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-20 23:59:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2022-02-20 23:59:07,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:07,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 98 states, 86 states have (on average 1.255813953488372) internal successors, (108), 97 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:07,470 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 98 states, 86 states have (on average 1.255813953488372) internal successors, (108), 97 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:07,470 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 98 states, 86 states have (on average 1.255813953488372) internal successors, (108), 97 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:07,471 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-02-20 23:59:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-02-20 23:59:07,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:07,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:07,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 86 states have (on average 1.255813953488372) internal successors, (108), 97 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 99 states. [2022-02-20 23:59:07,471 INFO L87 Difference]: Start difference. First operand has 98 states, 86 states have (on average 1.255813953488372) internal successors, (108), 97 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 99 states. [2022-02-20 23:59:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:07,472 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-02-20 23:59:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-02-20 23:59:07,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:07,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:07,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:07,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 86 states have (on average 1.255813953488372) internal successors, (108), 97 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2022-02-20 23:59:07,474 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 33 [2022-02-20 23:59:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:07,475 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2022-02-20 23:59:07,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2022-02-20 23:59:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:59:07,475 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:07,476 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 23:59:07,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:07,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-02-20 23:59:07,699 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:59:07,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:07,700 INFO L85 PathProgramCache]: Analyzing trace with hash -818501957, now seen corresponding path program 1 times [2022-02-20 23:59:07,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:07,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825797150] [2022-02-20 23:59:07,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:07,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:07,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {10909#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {10909#true} is VALID [2022-02-20 23:59:07,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {10909#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {10909#true} is VALID [2022-02-20 23:59:07,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {10909#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {10909#true} is VALID [2022-02-20 23:59:07,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {10909#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {10909#true} is VALID [2022-02-20 23:59:07,875 INFO L290 TraceCheckUtils]: 4: Hoare triple {10909#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {10909#true} is VALID [2022-02-20 23:59:07,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {10909#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {10909#true} is VALID [2022-02-20 23:59:07,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {10909#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {10909#true} is VALID [2022-02-20 23:59:07,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {10909#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {10909#true} is VALID [2022-02-20 23:59:07,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {10909#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {10909#true} is VALID [2022-02-20 23:59:07,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {10909#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {10911#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:59:07,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {10911#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {10911#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:59:07,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {10911#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {10911#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:59:07,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {10911#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {10911#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:59:07,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {10911#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {10911#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:59:07,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {10911#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {10911#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:59:07,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {10911#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {10911#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} is VALID [2022-02-20 23:59:07,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {10911#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {10912#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:59:07,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {10912#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(dll_create_~len#1 > 0); {10912#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:59:07,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {10912#(and (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {10913#(and (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= 12 (select |#length| |ULTIMATE.start_dll_create_#res#1.base|)))} is VALID [2022-02-20 23:59:07,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {10913#(and (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= 12 (select |#length| |ULTIMATE.start_dll_create_#res#1.base|)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {10914#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 12))} is VALID [2022-02-20 23:59:07,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {10914#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 12))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {10915#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} is VALID [2022-02-20 23:59:07,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {10915#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {10916#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 0))} is VALID [2022-02-20 23:59:07,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {10916#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 0))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {10915#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} is VALID [2022-02-20 23:59:07,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {10915#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {10915#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} is VALID [2022-02-20 23:59:07,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {10915#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {10917#(and (<= 0 |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset|) (= (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 12) (<= |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 0))} is VALID [2022-02-20 23:59:07,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {10917#(and (<= 0 |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset|) (= (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 12) (<= |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 0))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {10918#(and (<= 0 |ULTIMATE.start_dll_remove_last_~last~0#1.offset|) (= 12 (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)) (<= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0))} is VALID [2022-02-20 23:59:07,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {10918#(and (<= 0 |ULTIMATE.start_dll_remove_last_~last~0#1.offset|) (= 12 (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)) (<= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0))} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {10918#(and (<= 0 |ULTIMATE.start_dll_remove_last_~last~0#1.offset|) (= 12 (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)) (<= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0))} is VALID [2022-02-20 23:59:07,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {10918#(and (<= 0 |ULTIMATE.start_dll_remove_last_~last~0#1.offset|) (= 12 (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)) (<= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0))} assume !!(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset; {10919#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) 0) (<= 0 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (<= |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 0))} is VALID [2022-02-20 23:59:07,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {10919#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) 0) (<= 0 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (<= |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 0))} SUMMARY for call dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L612 {10919#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) 0) (<= 0 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (<= |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 0))} is VALID [2022-02-20 23:59:07,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {10919#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) 0) (<= 0 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (<= |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 0))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset;havoc dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset; {10919#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) 0) (<= 0 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (<= |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 0))} is VALID [2022-02-20 23:59:07,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {10919#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) 0) (<= 0 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (<= |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 0))} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {10919#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) 0) (<= 0 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (<= |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 0))} is VALID [2022-02-20 23:59:07,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {10919#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) 0) (<= 0 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (<= |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 0))} assume !(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset; {10919#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) 0) (<= 0 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (<= |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 0))} is VALID [2022-02-20 23:59:07,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {10919#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) 0) (<= 0 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (<= |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 0))} assume !(4 + (4 + dll_remove_last_~snd_to_last~0#1.offset) <= #length[dll_remove_last_~snd_to_last~0#1.base] && 0 <= 4 + dll_remove_last_~snd_to_last~0#1.offset); {10910#false} is VALID [2022-02-20 23:59:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:07,895 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:07,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825797150] [2022-02-20 23:59:07,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825797150] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:07,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092860853] [2022-02-20 23:59:07,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:07,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:07,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:07,896 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:07,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-20 23:59:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:08,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:59:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:08,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:08,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 15 [2022-02-20 23:59:08,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2022-02-20 23:59:08,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {10909#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {10909#true} is VALID [2022-02-20 23:59:08,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {10909#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {10909#true} is VALID [2022-02-20 23:59:08,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {10909#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {10909#true} is VALID [2022-02-20 23:59:08,367 INFO L290 TraceCheckUtils]: 3: Hoare triple {10909#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {10909#true} is VALID [2022-02-20 23:59:08,367 INFO L290 TraceCheckUtils]: 4: Hoare triple {10909#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {10909#true} is VALID [2022-02-20 23:59:08,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {10909#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {10909#true} is VALID [2022-02-20 23:59:08,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {10909#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {10909#true} is VALID [2022-02-20 23:59:08,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {10909#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {10909#true} is VALID [2022-02-20 23:59:08,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {10909#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {10909#true} is VALID [2022-02-20 23:59:08,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {10909#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {10909#true} is VALID [2022-02-20 23:59:08,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {10909#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {10909#true} is VALID [2022-02-20 23:59:08,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {10909#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {10909#true} is VALID [2022-02-20 23:59:08,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {10909#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {10909#true} is VALID [2022-02-20 23:59:08,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {10909#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {10909#true} is VALID [2022-02-20 23:59:08,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {10909#true} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {10909#true} is VALID [2022-02-20 23:59:08,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {10909#true} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {10909#true} is VALID [2022-02-20 23:59:08,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {10909#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {10909#true} is VALID [2022-02-20 23:59:08,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {10909#true} assume !(dll_create_~len#1 > 0); {10909#true} is VALID [2022-02-20 23:59:08,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {10909#true} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {10909#true} is VALID [2022-02-20 23:59:08,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {10909#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {10909#true} is VALID [2022-02-20 23:59:08,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {10909#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {10909#true} is VALID [2022-02-20 23:59:08,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {10909#true} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {10986#(and (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|))} is VALID [2022-02-20 23:59:08,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {10986#(and (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {10990#(<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)))} is VALID [2022-02-20 23:59:08,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {10990#(<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)))} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {10990#(<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)))} is VALID [2022-02-20 23:59:08,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {10990#(<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)))} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {10997#(<= (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|))} is VALID [2022-02-20 23:59:08,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {10997#(<= (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {11001#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|))} is VALID [2022-02-20 23:59:08,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {11001#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|))} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {11005#(and (<= 0 (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) (<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} is VALID [2022-02-20 23:59:08,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {11005#(and (<= 0 (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) (<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} assume !!(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset; {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-20 23:59:08,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} SUMMARY for call dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L612 {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-20 23:59:08,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset;havoc dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset; {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-20 23:59:08,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-20 23:59:08,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} assume !(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset; {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-20 23:59:08,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} assume !(4 + (4 + dll_remove_last_~snd_to_last~0#1.offset) <= #length[dll_remove_last_~snd_to_last~0#1.base] && 0 <= 4 + dll_remove_last_~snd_to_last~0#1.offset); {10910#false} is VALID [2022-02-20 23:59:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:59:08,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:08,560 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:08,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-02-20 23:59:08,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} assume !(4 + (4 + dll_remove_last_~snd_to_last~0#1.offset) <= #length[dll_remove_last_~snd_to_last~0#1.base] && 0 <= 4 + dll_remove_last_~snd_to_last~0#1.offset); {10910#false} is VALID [2022-02-20 23:59:08,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} assume !(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset; {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-20 23:59:08,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-20 23:59:08,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset;havoc dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset; {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-20 23:59:08,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} SUMMARY for call dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L612 {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-20 23:59:08,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {11005#(and (<= 0 (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) (<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} assume !!(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset; {11009#(and (<= (+ 8 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-20 23:59:08,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {11043#(or (not (<= 0 (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) (<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {11005#(and (<= 0 (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) (<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} is VALID [2022-02-20 23:59:08,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {11047#(or (<= (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|)) (< (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4) 0))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {11043#(or (not (<= 0 (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) (<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} is VALID [2022-02-20 23:59:08,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {11051#(or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4) 0) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))))} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {11047#(or (<= (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|)) (< (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4) 0))} is VALID [2022-02-20 23:59:08,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {11051#(or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4) 0) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))))} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {11051#(or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4) 0) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))))} is VALID [2022-02-20 23:59:08,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {11058#(or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4) 0) (and (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|)))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {11051#(or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4) 0) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|))))} is VALID [2022-02-20 23:59:08,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {10909#true} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {11058#(or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4) 0) (and (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|)))} is VALID [2022-02-20 23:59:08,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {10909#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {10909#true} is VALID [2022-02-20 23:59:08,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {10909#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {10909#true} is VALID [2022-02-20 23:59:08,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {10909#true} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {10909#true} is VALID [2022-02-20 23:59:08,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {10909#true} assume !(dll_create_~len#1 > 0); {10909#true} is VALID [2022-02-20 23:59:08,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {10909#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {10909#true} is VALID [2022-02-20 23:59:08,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {10909#true} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {10909#true} is VALID [2022-02-20 23:59:08,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {10909#true} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {10909#true} is VALID [2022-02-20 23:59:08,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {10909#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {10909#true} is VALID [2022-02-20 23:59:08,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {10909#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {10909#true} is VALID [2022-02-20 23:59:08,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {10909#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {10909#true} is VALID [2022-02-20 23:59:08,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {10909#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {10909#true} is VALID [2022-02-20 23:59:08,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {10909#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {10909#true} is VALID [2022-02-20 23:59:08,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {10909#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {10909#true} is VALID [2022-02-20 23:59:08,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {10909#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {10909#true} is VALID [2022-02-20 23:59:08,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {10909#true} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {10909#true} is VALID [2022-02-20 23:59:08,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {10909#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {10909#true} is VALID [2022-02-20 23:59:08,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {10909#true} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {10909#true} is VALID [2022-02-20 23:59:08,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {10909#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {10909#true} is VALID [2022-02-20 23:59:08,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {10909#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {10909#true} is VALID [2022-02-20 23:59:08,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {10909#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {10909#true} is VALID [2022-02-20 23:59:08,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {10909#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {10909#true} is VALID [2022-02-20 23:59:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:59:08,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092860853] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:08,678 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:59:08,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2022-02-20 23:59:08,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362955560] [2022-02-20 23:59:08,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:08,679 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 23:59:08,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:08,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:08,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:08,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 23:59:08,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:08,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 23:59:08,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:59:08,725 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:10,325 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2022-02-20 23:59:10,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-20 23:59:10,325 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 23:59:10,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 118 transitions. [2022-02-20 23:59:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 118 transitions. [2022-02-20 23:59:10,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 118 transitions. [2022-02-20 23:59:10,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:10,456 INFO L225 Difference]: With dead ends: 135 [2022-02-20 23:59:10,456 INFO L226 Difference]: Without dead ends: 135 [2022-02-20 23:59:10,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=383, Invalid=1423, Unknown=0, NotChecked=0, Total=1806 [2022-02-20 23:59:10,457 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 381 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:10,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 249 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:59:10,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-02-20 23:59:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2022-02-20 23:59:10,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:10,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 97 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:10,459 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 97 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:10,460 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 97 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:10,461 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2022-02-20 23:59:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2022-02-20 23:59:10,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:10,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:10,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 135 states. [2022-02-20 23:59:10,462 INFO L87 Difference]: Start difference. First operand has 97 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 135 states. [2022-02-20 23:59:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:10,464 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2022-02-20 23:59:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2022-02-20 23:59:10,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:10,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:10,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:10,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-02-20 23:59:10,466 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 33 [2022-02-20 23:59:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:10,466 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-02-20 23:59:10,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-02-20 23:59:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:59:10,467 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:10,467 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 23:59:10,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:10,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-02-20 23:59:10,668 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:59:10,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash 396633763, now seen corresponding path program 1 times [2022-02-20 23:59:10,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:10,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831167815] [2022-02-20 23:59:10,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:10,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:11,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {11672#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {11674#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:59:11,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {11674#(= (select |#valid| 0) 0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {11674#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:59:11,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {11674#(= (select |#valid| 0) 0)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {11675#(and (= (select |#valid| 0) 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:11,195 INFO L290 TraceCheckUtils]: 3: Hoare triple {11675#(and (= (select |#valid| 0) 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {11675#(and (= (select |#valid| 0) 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:11,195 INFO L290 TraceCheckUtils]: 4: Hoare triple {11675#(and (= (select |#valid| 0) 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {11676#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#valid| 0) 0))} is VALID [2022-02-20 23:59:11,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {11676#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#valid| 0) 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {11676#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#valid| 0) 0))} is VALID [2022-02-20 23:59:11,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {11676#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#valid| 0) 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {11676#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#valid| 0) 0))} is VALID [2022-02-20 23:59:11,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {11676#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#valid| 0) 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {11676#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#valid| 0) 0))} is VALID [2022-02-20 23:59:11,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {11676#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |#valid| 0) 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {11677#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| 0) 0))} is VALID [2022-02-20 23:59:11,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {11677#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| 0) 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {11678#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (or (= (select |#valid| 0) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:11,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {11678#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (or (= (select |#valid| 0) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {11678#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (or (= (select |#valid| 0) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:11,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {11678#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (or (= (select |#valid| 0) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {11678#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (or (= (select |#valid| 0) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:11,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {11678#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (or (= (select |#valid| 0) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {11679#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (or (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0))) (or (= (select |#valid| 0) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:11,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {11679#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (or (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0))) (or (= (select |#valid| 0) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {11679#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (or (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0))) (or (= (select |#valid| 0) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:11,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {11679#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (or (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0))) (or (= (select |#valid| 0) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {11679#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (or (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0))) (or (= (select |#valid| 0) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:11,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {11679#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (or (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0))) (or (= (select |#valid| 0) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {11680#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (or (= (select |#valid| 0) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:11,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {11680#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (or (= (select |#valid| 0) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {11681#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (or (= (select |#valid| 0) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))))} is VALID [2022-02-20 23:59:11,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {11681#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (or (= (select |#valid| 0) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))))} assume !(dll_create_~len#1 > 0); {11681#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (or (= (select |#valid| 0) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))))} is VALID [2022-02-20 23:59:11,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {11681#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (or (= (select |#valid| 0) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {11682#(and (not (= |ULTIMATE.start_dll_create_#res#1.base| 0)) (or (= (select |#valid| 0) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4) 0))))} is VALID [2022-02-20 23:59:11,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {11682#(and (not (= |ULTIMATE.start_dll_create_#res#1.base| 0)) (or (= (select |#valid| 0) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4) 0))))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {11683#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (or (= (select |#valid| 0) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} is VALID [2022-02-20 23:59:11,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {11683#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (or (= (select |#valid| 0) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {11684#(and (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (or (= (select |#valid| 0) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 0))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)))} is VALID [2022-02-20 23:59:11,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {11684#(and (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (or (= (select |#valid| 0) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 0))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {11685#(and (or (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 0)) (or (not (= |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 0)) (and (or (= (select |#valid| 0) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 4)) 0))) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)))))} is VALID [2022-02-20 23:59:11,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {11685#(and (or (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 0)) (or (not (= |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 0)) (and (or (= (select |#valid| 0) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 4)) 0))) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)))))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {11686#(or (and (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (or (= (select |#valid| 0) 1) (not (= |ULTIMATE.start_dll_remove_last_#t~mem7#1.base| 0))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)))} is VALID [2022-02-20 23:59:11,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {11686#(or (and (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (or (= (select |#valid| 0) 1) (not (= |ULTIMATE.start_dll_remove_last_#t~mem7#1.base| 0))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)))} assume 0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset; {11687#(or (and (= (select |#valid| 0) 1) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)))} is VALID [2022-02-20 23:59:11,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {11687#(or (and (= (select |#valid| 0) 1) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)))} SUMMARY for call dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L605 {11688#(or (not (= |ULTIMATE.start_dll_remove_last_#t~mem8#1.offset| 0)) (and (= (select |#valid| 0) 1) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_remove_last_#t~mem8#1.base| 0))))} is VALID [2022-02-20 23:59:11,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {11688#(or (not (= |ULTIMATE.start_dll_remove_last_#t~mem8#1.offset| 0)) (and (= (select |#valid| 0) 1) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_remove_last_#t~mem8#1.base| 0))))} assume 0 == dll_remove_last_#t~mem8#1.offset; {11689#(and (= (select |#valid| 0) 1) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_remove_last_#t~mem8#1.base| 0)))} is VALID [2022-02-20 23:59:11,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {11689#(and (= (select |#valid| 0) 1) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_remove_last_#t~mem8#1.base| 0)))} assume dll_remove_last_#t~mem8#1.base < #StackHeapBarrier; {11689#(and (= (select |#valid| 0) 1) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_remove_last_#t~mem8#1.base| 0)))} is VALID [2022-02-20 23:59:11,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {11689#(and (= (select |#valid| 0) 1) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_remove_last_#t~mem8#1.base| 0)))} assume 0 == dll_remove_last_#t~mem8#1.base || 1 == #valid[dll_remove_last_#t~mem8#1.base];call ULTIMATE.dealloc(dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset);havoc dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset; {11690#(and (= (select |#valid| 0) 1) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 23:59:11,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {11690#(and (= (select |#valid| 0) 1) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L606 {11691#(and (= (select |#valid| 0) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 23:59:11,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {11691#(and (= (select |#valid| 0) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} assume { :end_inline_dll_remove_last } true; {11691#(and (= (select |#valid| 0) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 23:59:11,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {11691#(and (= (select |#valid| 0) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {11691#(and (= (select |#valid| 0) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 23:59:11,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {11691#(and (= (select |#valid| 0) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {11692#(and (= (select |#valid| 0) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} is VALID [2022-02-20 23:59:11,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {11692#(and (= (select |#valid| 0) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {11693#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:59:11,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {11693#(= (select |#valid| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) 1)} assume !(1 == #valid[dll_remove_last_#t~mem6#1.base]); {11673#false} is VALID [2022-02-20 23:59:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:11,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:11,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831167815] [2022-02-20 23:59:11,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831167815] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:11,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347822667] [2022-02-20 23:59:11,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:11,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:11,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:11,213 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:11,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-20 23:59:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:11,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-20 23:59:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:11,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:11,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2022-02-20 23:59:11,488 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:59:11,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:59:11,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:59:11,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-02-20 23:59:11,673 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:59:11,673 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-02-20 23:59:11,959 INFO L356 Elim1Store]: treesize reduction 6, result has 83.8 percent of original size [2022-02-20 23:59:11,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 48 [2022-02-20 23:59:12,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 16 treesize of output 8 [2022-02-20 23:59:12,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {11672#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {11672#true} is VALID [2022-02-20 23:59:12,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {11672#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {11700#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} is VALID [2022-02-20 23:59:12,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {11700#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {11704#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:12,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {11704#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {11704#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:12,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {11704#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {11704#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:12,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {11704#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {11704#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:12,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {11704#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {11704#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:12,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {11704#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {11704#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} is VALID [2022-02-20 23:59:12,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {11704#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {11723#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:12,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {11723#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {11727#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:12,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {11727#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {11727#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:12,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {11727#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {11727#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:12,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {11727#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {11737#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:12,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {11737#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {11741#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))} is VALID [2022-02-20 23:59:12,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {11741#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {11741#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))} is VALID [2022-02-20 23:59:12,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {11741#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {11748#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:12,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {11748#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {11752#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:12,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {11752#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(dll_create_~len#1 > 0); {11752#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:12,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {11752#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {11759#(and (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:12,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {11759#(and (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {11763#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0)))} is VALID [2022-02-20 23:59:12,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {11763#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0)))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {11767#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4))) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 0)))} is VALID [2022-02-20 23:59:12,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {11767#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4))) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 0)))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {11771#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4))) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 0)))} is VALID [2022-02-20 23:59:12,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {11771#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4))) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 0)))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {11775#(and (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)) (not (= |ULTIMATE.start_dll_remove_last_#t~mem7#1.base| 0))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} is VALID [2022-02-20 23:59:12,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {11775#(and (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)) (not (= |ULTIMATE.start_dll_remove_last_#t~mem7#1.base| 0))) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} assume 0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset; {11779#(and (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)))} is VALID [2022-02-20 23:59:12,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {11779#(and (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)))} SUMMARY for call dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L605 {11783#(not (= |ULTIMATE.start_dll_remove_last_#t~mem8#1.offset| 0))} is VALID [2022-02-20 23:59:12,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {11783#(not (= |ULTIMATE.start_dll_remove_last_#t~mem8#1.offset| 0))} assume 0 == dll_remove_last_#t~mem8#1.offset; {11673#false} is VALID [2022-02-20 23:59:12,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {11673#false} assume dll_remove_last_#t~mem8#1.base < #StackHeapBarrier; {11673#false} is VALID [2022-02-20 23:59:12,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {11673#false} assume 0 == dll_remove_last_#t~mem8#1.base || 1 == #valid[dll_remove_last_#t~mem8#1.base];call ULTIMATE.dealloc(dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset);havoc dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset; {11673#false} is VALID [2022-02-20 23:59:12,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {11673#false} SUMMARY for call write~$Pointer$(0, 0, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L606 {11673#false} is VALID [2022-02-20 23:59:12,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {11673#false} assume { :end_inline_dll_remove_last } true; {11673#false} is VALID [2022-02-20 23:59:12,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {11673#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {11673#false} is VALID [2022-02-20 23:59:12,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {11673#false} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {11673#false} is VALID [2022-02-20 23:59:12,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {11673#false} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {11673#false} is VALID [2022-02-20 23:59:12,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {11673#false} assume !(1 == #valid[dll_remove_last_#t~mem6#1.base]); {11673#false} is VALID [2022-02-20 23:59:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:12,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:12,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 27 treesize of output 19 [2022-02-20 23:59:12,498 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) 4) 0)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2022-02-20 23:59:12,574 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1669 Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1669)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= (select (select .cse1 .cse0) 4) 0)))))) is different from false [2022-02-20 23:59:12,638 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-02-20 23:59:12,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 75 treesize of output 50 [2022-02-20 23:59:12,677 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:12,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 158 [2022-02-20 23:59:12,698 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:12,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 105 [2022-02-20 23:59:13,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {11673#false} assume !(1 == #valid[dll_remove_last_#t~mem6#1.base]); {11673#false} is VALID [2022-02-20 23:59:13,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {11673#false} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {11673#false} is VALID [2022-02-20 23:59:13,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {11673#false} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {11673#false} is VALID [2022-02-20 23:59:13,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {11673#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {11673#false} is VALID [2022-02-20 23:59:13,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {11673#false} assume { :end_inline_dll_remove_last } true; {11673#false} is VALID [2022-02-20 23:59:13,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {11673#false} SUMMARY for call write~$Pointer$(0, 0, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L606 {11673#false} is VALID [2022-02-20 23:59:13,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {11673#false} assume 0 == dll_remove_last_#t~mem8#1.base || 1 == #valid[dll_remove_last_#t~mem8#1.base];call ULTIMATE.dealloc(dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset);havoc dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset; {11673#false} is VALID [2022-02-20 23:59:13,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {11673#false} assume dll_remove_last_#t~mem8#1.base < #StackHeapBarrier; {11673#false} is VALID [2022-02-20 23:59:13,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {11783#(not (= |ULTIMATE.start_dll_remove_last_#t~mem8#1.offset| 0))} assume 0 == dll_remove_last_#t~mem8#1.offset; {11673#false} is VALID [2022-02-20 23:59:13,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {11838#(not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} SUMMARY for call dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L605 {11783#(not (= |ULTIMATE.start_dll_remove_last_#t~mem8#1.offset| 0))} is VALID [2022-02-20 23:59:13,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {11842#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)) (not (= |ULTIMATE.start_dll_remove_last_#t~mem7#1.base| 0)))} assume 0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset; {11838#(not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0))} is VALID [2022-02-20 23:59:13,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {11846#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 4)) 0)))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {11842#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)) (not (= |ULTIMATE.start_dll_remove_last_#t~mem7#1.base| 0)))} is VALID [2022-02-20 23:59:13,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {11850#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 0))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {11846#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (+ |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset| 4)) 0)))} is VALID [2022-02-20 23:59:13,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {11854#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {11850#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 0))} is VALID [2022-02-20 23:59:13,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {11858#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {11854#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-20 23:59:13,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {11862#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {11858#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} is VALID [2022-02-20 23:59:13,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {11862#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} assume !(dll_create_~len#1 > 0); {11862#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} is VALID [2022-02-20 23:59:13,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {11869#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {11862#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} is VALID [2022-02-20 23:59:13,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {11873#(forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= 0 (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {11869#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} is VALID [2022-02-20 23:59:13,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {11873#(forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= 0 (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {11873#(forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= 0 (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} is VALID [2022-02-20 23:59:13,947 WARN L290 TraceCheckUtils]: 13: Hoare triple {11880#(forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1669 Int)) (or (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1669)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1669)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1669)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {11873#(forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= 0 (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} is UNKNOWN [2022-02-20 23:59:13,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {11884#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {11880#(forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1669 Int)) (or (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1669)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1669)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1669)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} is VALID [2022-02-20 23:59:13,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {11884#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {11884#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)))} is VALID [2022-02-20 23:59:13,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {11884#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {11884#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)))} is VALID [2022-02-20 23:59:13,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {11894#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 0)) (and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|)))))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {11884#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)))} is VALID [2022-02-20 23:59:13,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {11898#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 0))))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {11894#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 0)) (and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|)))))} is VALID [2022-02-20 23:59:13,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {11898#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 0))))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {11898#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 0))))} is VALID [2022-02-20 23:59:13,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {11898#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 0))))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {11898#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 0))))} is VALID [2022-02-20 23:59:13,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {11898#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 0))))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {11898#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 0))))} is VALID [2022-02-20 23:59:13,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {11898#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 0))))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {11898#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 0))))} is VALID [2022-02-20 23:59:13,954 INFO L290 TraceCheckUtils]: 3: Hoare triple {11898#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 0))))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {11898#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 0))))} is VALID [2022-02-20 23:59:13,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {11672#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {11898#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (or (and (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 0))))} is VALID [2022-02-20 23:59:13,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {11672#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {11672#true} is VALID [2022-02-20 23:59:13,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {11672#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {11672#true} is VALID [2022-02-20 23:59:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-20 23:59:13,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347822667] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:13,955 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:59:13,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 16] total 50 [2022-02-20 23:59:13,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639769100] [2022-02-20 23:59:13,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:13,956 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-20 23:59:13,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:13,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:14,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:14,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-02-20 23:59:14,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:14,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-02-20 23:59:14,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2115, Unknown=2, NotChecked=186, Total=2450 [2022-02-20 23:59:14,032 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:14,671 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (not .cse5)) (.cse0 (select |c_#valid| 0)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse2 (= .cse0 1)) (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1669 Int)) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1669)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse3 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (not (= (select (select .cse4 .cse3) 4) 0)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse5 (not (= .cse1 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-02-20 23:59:14,674 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (not .cse5)) (.cse0 (select |c_#valid| 0)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse1 (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse3 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse2 .cse3) 4) 0)) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse1 (= .cse0 1)) (= (select .cse4 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse5 (not (= (select .cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))))) is different from false [2022-02-20 23:59:14,676 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (not .cse4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse1 .cse2) 4) 0)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse0 (= (select |c_#valid| 0) 1)) (= (select .cse3 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse4 (not (= (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))))) is different from false [2022-02-20 23:59:16,381 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (not .cse4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse1 (= (select |c_#valid| 0) 1)) (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1669 Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1669)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (not (= (select (select .cse3 .cse2) 4) 0)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse4 (not (= .cse0 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-02-20 23:59:16,472 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (not .cse4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse0 (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse1 .cse2) 4) 0)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse0 (= (select |c_#valid| 0) 1)) (= (select .cse3 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse4 (not (= (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))))) is different from false [2022-02-20 23:59:17,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:17,760 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2022-02-20 23:59:17,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-20 23:59:17,760 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-20 23:59:17,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:17,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 116 transitions. [2022-02-20 23:59:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 116 transitions. [2022-02-20 23:59:17,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 116 transitions. [2022-02-20 23:59:17,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:17,859 INFO L225 Difference]: With dead ends: 125 [2022-02-20 23:59:17,859 INFO L226 Difference]: Without dead ends: 123 [2022-02-20 23:59:17,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=441, Invalid=4002, Unknown=7, NotChecked=952, Total=5402 [2022-02-20 23:59:17,860 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 280 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 412 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:17,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 1191 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1403 Invalid, 0 Unknown, 412 Unchecked, 1.1s Time] [2022-02-20 23:59:17,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-02-20 23:59:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 97. [2022-02-20 23:59:17,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:17,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 97 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:17,863 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 97 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:17,863 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 97 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:17,864 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-02-20 23:59:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-02-20 23:59:17,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:17,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:17,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 123 states. [2022-02-20 23:59:17,865 INFO L87 Difference]: Start difference. First operand has 97 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 123 states. [2022-02-20 23:59:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:17,866 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-02-20 23:59:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-02-20 23:59:17,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:17,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:17,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:17,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-02-20 23:59:17,868 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 34 [2022-02-20 23:59:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:17,869 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-02-20 23:59:17,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-02-20 23:59:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:59:17,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:17,870 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2022-02-20 23:59:17,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:18,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-02-20 23:59:18,070 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:59:18,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash -601364006, now seen corresponding path program 1 times [2022-02-20 23:59:18,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:18,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106396096] [2022-02-20 23:59:18,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:18,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:18,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {12438#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {12438#true} is VALID [2022-02-20 23:59:18,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {12438#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {12438#true} is VALID [2022-02-20 23:59:18,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {12438#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {12440#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:18,358 INFO L290 TraceCheckUtils]: 3: Hoare triple {12440#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {12440#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:18,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {12440#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {12441#(and (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 23:59:18,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {12441#(and (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {12441#(and (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 23:59:18,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {12441#(and (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {12441#(and (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 23:59:18,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {12441#(and (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {12441#(and (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 23:59:18,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {12441#(and (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {12442#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:18,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {12442#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {12443#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:18,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {12443#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {12443#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:18,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {12443#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {12443#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:18,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {12443#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {12444#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:18,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {12444#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {12444#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:18,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {12444#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |#StackHeapBarrier|))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {12444#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:18,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {12444#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {12445#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:18,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {12445#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |#StackHeapBarrier|))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {12446#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:59:18,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {12446#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(dll_create_~len#1 > 0); {12446#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:59:18,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {12446#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {12447#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_create_#res#1.offset| 0))} is VALID [2022-02-20 23:59:18,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {12447#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_create_#res#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {12448#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:18,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {12448#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 1) |#StackHeapBarrier|))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {12449#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:18,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {12449#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 1) |#StackHeapBarrier|))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {12450#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) 4) 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:18,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {12450#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) 4) 1) |#StackHeapBarrier|))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {12449#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:18,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {12449#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 1) |#StackHeapBarrier|))} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {12449#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:18,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {12449#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 0) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) 4) 1) |#StackHeapBarrier|))} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {12451#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 0))} is VALID [2022-02-20 23:59:18,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {12451#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 0))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {12452#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:18,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {12452#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {12452#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:18,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {12452#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} assume !!(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset; {12452#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:18,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {12452#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} SUMMARY for call dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L612 {12453#(<= (+ |ULTIMATE.start_dll_remove_last_#t~mem10#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:18,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {12453#(<= (+ |ULTIMATE.start_dll_remove_last_#t~mem10#1.base| 1) |#StackHeapBarrier|)} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset;havoc dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset; {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:18,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:18,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} assume !(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset; {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:18,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(0, 0, dll_remove_last_~snd_to_last~0#1.base, 4 + dll_remove_last_~snd_to_last~0#1.offset, 4); srcloc: L610-4 {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:18,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == dll_remove_last_~last~0#1.offset; {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:18,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} assume !(dll_remove_last_~last~0#1.base < #StackHeapBarrier); {12439#false} is VALID [2022-02-20 23:59:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:18,376 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:18,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106396096] [2022-02-20 23:59:18,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106396096] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:18,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677089380] [2022-02-20 23:59:18,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:18,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:18,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:18,380 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:18,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-20 23:59:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:18,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 56 conjunts are in the unsatisfiable core [2022-02-20 23:59:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:18,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:18,601 INFO L390 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 [2022-02-20 23:59:18,716 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:59:18,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:59:18,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2022-02-20 23:59:18,820 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-20 23:59:18,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-02-20 23:59:18,854 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:59:18,854 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-02-20 23:59:19,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 47 treesize of output 35 [2022-02-20 23:59:19,344 INFO L356 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-02-20 23:59:19,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2022-02-20 23:59:19,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {12438#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {12438#true} is VALID [2022-02-20 23:59:19,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {12438#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {12461#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} is VALID [2022-02-20 23:59:19,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {12461#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {12465#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {12465#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {12465#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {12465#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {12465#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {12465#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {12465#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {12465#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {12465#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {12465#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {12465#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {12465#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {12484#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {12484#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {12488#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {12488#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {12488#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {12488#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {12488#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {12488#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L592 {12498#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {12498#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); srcloc: L593 {12498#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {12498#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {12498#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {12498#(and (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L596 {12508#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {12508#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {12512#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:19,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {12512#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |#StackHeapBarrier|))} assume !(dll_create_~len#1 > 0); {12512#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |#StackHeapBarrier|))} is VALID [2022-02-20 23:59:19,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {12512#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |#StackHeapBarrier|))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {12519#(and (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)))) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {12519#(and (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)))) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {12523#(and (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:19,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {12523#(and (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_last } true;dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset, dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset, dll_remove_last_#t~mem8#1.base, dll_remove_last_#t~mem8#1.offset, dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset, dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset, dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset, dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset, dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset, dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset;dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset := dll_remove_last_#in~head#1.base, dll_remove_last_#in~head#1.offset; {12527#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} is VALID [2022-02-20 23:59:19,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {12527#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} SUMMARY for call dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L604 {12531#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} is VALID [2022-02-20 23:59:19,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {12531#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) |ULTIMATE.start_dll_remove_last_#t~mem6#1.base|) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} SUMMARY for call dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset := read~$Pointer$(dll_remove_last_#t~mem6#1.base, 4 + dll_remove_last_#t~mem6#1.offset, 4); srcloc: L604-1 {12527#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} is VALID [2022-02-20 23:59:19,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {12527#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} assume !(0 == dll_remove_last_#t~mem7#1.base && 0 == dll_remove_last_#t~mem7#1.offset);havoc dll_remove_last_#t~mem6#1.base, dll_remove_last_#t~mem6#1.offset;havoc dll_remove_last_#t~mem7#1.base, dll_remove_last_#t~mem7#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := 0, 0; {12527#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} is VALID [2022-02-20 23:59:19,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {12527#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)))) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_last_~head#1.base|) |ULTIMATE.start_dll_remove_last_~head#1.offset|) 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0))} SUMMARY for call dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset := read~$Pointer$(dll_remove_last_~head#1.base, dll_remove_last_~head#1.offset, 4); srcloc: L609 {12541#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|)))} is VALID [2022-02-20 23:59:19,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {12541#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_#t~mem9#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_#t~mem9#1.base|)))} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset;havoc dll_remove_last_#t~mem9#1.base, dll_remove_last_#t~mem9#1.offset; {12545#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} is VALID [2022-02-20 23:59:19,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {12545#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {12545#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} is VALID [2022-02-20 23:59:19,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {12545#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} assume !!(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset;dll_remove_last_~snd_to_last~0#1.base, dll_remove_last_~snd_to_last~0#1.offset := dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset; {12545#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} is VALID [2022-02-20 23:59:19,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {12545#(exists ((|ULTIMATE.start_dll_remove_last_~head#1.base| Int)) (and (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_remove_last_~last~0#1.base|)))} SUMMARY for call dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L612 {12453#(<= (+ |ULTIMATE.start_dll_remove_last_#t~mem10#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:19,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {12453#(<= (+ |ULTIMATE.start_dll_remove_last_#t~mem10#1.base| 1) |#StackHeapBarrier|)} dll_remove_last_~last~0#1.base, dll_remove_last_~last~0#1.offset := dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset;havoc dll_remove_last_#t~mem10#1.base, dll_remove_last_#t~mem10#1.offset; {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:19,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset := read~$Pointer$(dll_remove_last_~last~0#1.base, 4 + dll_remove_last_~last~0#1.offset, 4); srcloc: L610-3 {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:19,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} assume !(dll_remove_last_#t~mem11#1.base != 0 || dll_remove_last_#t~mem11#1.offset != 0);havoc dll_remove_last_#t~mem11#1.base, dll_remove_last_#t~mem11#1.offset; {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:19,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(0, 0, dll_remove_last_~snd_to_last~0#1.base, 4 + dll_remove_last_~snd_to_last~0#1.offset, 4); srcloc: L610-4 {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:19,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == dll_remove_last_~last~0#1.offset; {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:59:19,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {12454#(<= (+ |ULTIMATE.start_dll_remove_last_~last~0#1.base| 1) |#StackHeapBarrier|)} assume !(dll_remove_last_~last~0#1.base < #StackHeapBarrier); {12439#false} is VALID [2022-02-20 23:59:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:19,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:19,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 28 treesize of output 20 [2022-02-20 23:59:19,823 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1785 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |c_#StackHeapBarrier|))))) is different from false [2022-02-20 23:59:19,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1785 (Array Int Int)) (v_ArrVal_1784 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1784)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |c_#StackHeapBarrier|))))) is different from false [2022-02-20 23:59:19,993 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-02-20 23:59:19,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 78 treesize of output 53 [2022-02-20 23:59:20,065 INFO L356 Elim1Store]: treesize reduction 23, result has 67.1 percent of original size [2022-02-20 23:59:20,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 143 [2022-02-20 23:59:20,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:20,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 110