./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_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_update_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 cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:58:31,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:58:31,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:58:31,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:58:31,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:58:31,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:58:31,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:58:31,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:58:31,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:58:31,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:58:31,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:58:31,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:58:31,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:58:31,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:58:31,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:58:31,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:58:31,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:58:31,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:58:31,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:58:31,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:58:31,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:58:31,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:58:31,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:58:31,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:58:31,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:58:31,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:58:31,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:58:31,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:58:31,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:58:31,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:58:31,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:58:31,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:58:31,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:58:31,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:58:31,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:58:31,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:58:31,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:58:31,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:58:31,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:58:31,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:58:31,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:58:31,759 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:31,783 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:58:31,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:58:31,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:58:31,784 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:58:31,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:58:31,785 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:58:31,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:58:31,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:58:31,786 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:58:31,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:58:31,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:58:31,787 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:58:31,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:58:31,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:58:31,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:58:31,788 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:58:31,788 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:58:31,788 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:58:31,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:58:31,789 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:58:31,789 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:58:31,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:58:31,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:58:31,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:58:31,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:58:31,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:58:31,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:58:31,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:58:31,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:58:31,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:58:31,791 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 -> cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 [2022-02-20 23:58:31,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:58:32,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:58:32,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:58:32,022 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:58:32,022 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:58:32,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2022-02-20 23:58:32,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c516dd4ab/e32828938a05490089c51640e6e8b65b/FLAG2606ead64 [2022-02-20 23:58:32,486 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:58:32,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2022-02-20 23:58:32,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c516dd4ab/e32828938a05490089c51640e6e8b65b/FLAG2606ead64 [2022-02-20 23:58:32,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c516dd4ab/e32828938a05490089c51640e6e8b65b [2022-02-20 23:58:32,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:58:32,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:58:32,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:58:32,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:58:32,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:58:32,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:58:32" (1/1) ... [2022-02-20 23:58:32,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:32, skipping insertion in model container [2022-02-20 23:58:32,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:58:32" (1/1) ... [2022-02-20 23:58:32,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:58:32,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:58:32,830 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_update_all_reverse.i[24473,24486] [2022-02-20 23:58:32,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:58:32,837 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:58:32,862 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_update_all_reverse.i[24473,24486] [2022-02-20 23:58:32,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:58:32,888 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:58:32,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:32 WrapperNode [2022-02-20 23:58:32,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:58:32,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:58:32,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:58:32,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:58:32,897 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:32" (1/1) ... [2022-02-20 23:58:32,907 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:32" (1/1) ... [2022-02-20 23:58:32,925 INFO L137 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2022-02-20 23:58:32,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:58:32,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:58:32,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:58:32,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:58:32,932 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:32" (1/1) ... [2022-02-20 23:58:32,932 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:32" (1/1) ... [2022-02-20 23:58:32,934 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:32" (1/1) ... [2022-02-20 23:58:32,935 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:32" (1/1) ... [2022-02-20 23:58:32,942 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:32" (1/1) ... [2022-02-20 23:58:32,953 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:32" (1/1) ... [2022-02-20 23:58:32,955 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:32" (1/1) ... [2022-02-20 23:58:32,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:58:32,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:58:32,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:58:32,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:58:32,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:32" (1/1) ... [2022-02-20 23:58:32,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:58:32,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:32,987 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:32,992 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:33,014 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-02-20 23:58:33,014 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-02-20 23:58:33,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:58:33,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:58:33,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:58:33,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:58:33,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:58:33,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:58:33,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:58:33,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:58:33,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:58:33,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:58:33,125 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:58:33,126 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:58:33,157 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-02-20 23:58:33,426 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:58:33,431 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:58:33,433 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 23:58:33,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:58:33 BoogieIcfgContainer [2022-02-20 23:58:33,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:58:33,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:58:33,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:58:33,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:58:33,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:58:32" (1/3) ... [2022-02-20 23:58:33,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e870f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:58:33, skipping insertion in model container [2022-02-20 23:58:33,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:58:32" (2/3) ... [2022-02-20 23:58:33,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e870f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:58:33, skipping insertion in model container [2022-02-20 23:58:33,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:58:33" (3/3) ... [2022-02-20 23:58:33,443 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2022-02-20 23:58:33,447 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:58:33,448 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-02-20 23:58:33,475 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:58:33,479 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:33,480 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-02-20 23:58:33,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 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:33,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:58:33,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:33,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:58:33,497 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:33,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:33,501 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-02-20 23:58:33,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:33,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559739448] [2022-02-20 23:58:33,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:33,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:33,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {70#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); {70#true} is VALID [2022-02-20 23:58:33,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {70#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {70#true} is VALID [2022-02-20 23:58:33,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {70#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; {72#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {72#(= (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); {72#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:33,658 INFO L290 TraceCheckUtils]: 4: Hoare triple {72#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} assume !(1 == #valid[dll_create_~new_head~0#1.base]); {71#false} is VALID [2022-02-20 23:58:33,659 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:33,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:33,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559739448] [2022-02-20 23:58:33,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559739448] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:33,661 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:33,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:58:33,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757696] [2022-02-20 23:58:33,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:33,666 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:33,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:33,670 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:33,677 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:33,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:33,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:33,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:33,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:33,698 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 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:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:33,895 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-02-20 23:58:33,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:33,895 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:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:33,896 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:33,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 23:58:33,912 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:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 23:58:33,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2022-02-20 23:58:34,033 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:34,044 INFO L225 Difference]: With dead ends: 111 [2022-02-20 23:58:34,044 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 23:58:34,046 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:34,048 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:34,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 23:58:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-02-20 23:58:34,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:34,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 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,082 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 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,083 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 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,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,091 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2022-02-20 23:58:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-02-20 23:58:34,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:34,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:34,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 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 104 states. [2022-02-20 23:58:34,094 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 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 104 states. [2022-02-20 23:58:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,106 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2022-02-20 23:58:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-02-20 23:58:34,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:34,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:34,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:34,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 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,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-02-20 23:58:34,114 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2022-02-20 23:58:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:34,114 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-02-20 23:58:34,114 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:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-02-20 23:58:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:58:34,115 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:34,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:58:34,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:58:34,116 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:34,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:34,119 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-02-20 23:58:34,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:34,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417681579] [2022-02-20 23:58:34,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:34,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:34,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {453#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); {453#true} is VALID [2022-02-20 23:58:34,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {453#true} is VALID [2022-02-20 23:58:34,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#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; {455#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:58:34,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {455#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 12 (select |#length| |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); {455#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:58:34,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {455#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} 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); {454#false} is VALID [2022-02-20 23:58:34,172 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:34,172 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:34,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417681579] [2022-02-20 23:58:34,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417681579] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:34,173 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:34,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:58:34,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555618579] [2022-02-20 23:58:34,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:34,174 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:34,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:34,175 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:34,180 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:34,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:34,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:34,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:34,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:34,182 INFO L87 Difference]: Start difference. First operand 59 states and 65 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:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,324 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-02-20 23:58:34,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:34,324 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:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:34,325 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:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-02-20 23:58:34,326 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:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-02-20 23:58:34,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2022-02-20 23:58:34,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:34,414 INFO L225 Difference]: With dead ends: 101 [2022-02-20 23:58:34,414 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 23:58:34,414 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:34,415 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:34,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 23:58:34,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2022-02-20 23:58:34,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:34,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 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,428 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 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,428 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 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,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,430 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-02-20 23:58:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2022-02-20 23:58:34,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:34,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:34,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 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 101 states. [2022-02-20 23:58:34,437 INFO L87 Difference]: Start difference. First operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 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 101 states. [2022-02-20 23:58:34,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,440 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-02-20 23:58:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2022-02-20 23:58:34,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:34,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:34,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:34,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:34,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 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,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-02-20 23:58:34,442 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2022-02-20 23:58:34,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:34,442 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-02-20 23:58:34,442 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:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-02-20 23:58:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:58:34,443 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:34,443 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:34,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:58:34,443 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:34,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2022-02-20 23:58:34,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:34,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486899139] [2022-02-20 23:58:34,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:34,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:34,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {817#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); {817#true} is VALID [2022-02-20 23:58:34,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {817#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {819#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:34,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {819#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !(dll_create_~len#1 > 0); {818#false} is VALID [2022-02-20 23:58:34,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {818#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {818#false} is VALID [2022-02-20 23:58:34,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {818#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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {818#false} is VALID [2022-02-20 23:58:34,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {818#false} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {818#false} is VALID [2022-02-20 23:58:34,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {818#false} assume !!(dll_update_at_~index#1 > 0); {818#false} is VALID [2022-02-20 23:58:34,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {818#false} assume !(1 == #valid[dll_update_at_~head#1.base]); {818#false} is VALID [2022-02-20 23:58:34,479 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:34,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:34,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486899139] [2022-02-20 23:58:34,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486899139] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:34,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:34,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:58:34,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623093049] [2022-02-20 23:58:34,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:34,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:58:34,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:34,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:34,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:34,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:34,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:34,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:34,487 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,539 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-02-20 23:58:34,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:34,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:58:34,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-20 23:58:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-20 23:58:34,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-02-20 23:58:34,598 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:34,599 INFO L225 Difference]: With dead ends: 66 [2022-02-20 23:58:34,599 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 23:58:34,599 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:34,600 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 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:34,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 118 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:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 23:58:34,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2022-02-20 23:58:34,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:34,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 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,603 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 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,603 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 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,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,604 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-02-20 23:58:34,605 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-02-20 23:58:34,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:34,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:34,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 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:34,605 INFO L87 Difference]: Start difference. First operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 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:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,607 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-02-20 23:58:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-02-20 23:58:34,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:34,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:34,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:34,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 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,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-02-20 23:58:34,609 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2022-02-20 23:58:34,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:34,609 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-02-20 23:58:34,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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,609 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-02-20 23:58:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:58:34,610 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:34,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:34,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:58:34,610 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:34,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:34,611 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-02-20 23:58:34,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:34,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426160709] [2022-02-20 23:58:34,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:34,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:34,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {1077#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); {1077#true} is VALID [2022-02-20 23:58:34,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {1077#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {1079#(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:34,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {1079#(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; {1079#(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:34,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {1079#(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); {1079#(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:34,664 INFO L290 TraceCheckUtils]: 4: Hoare triple {1079#(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 {1079#(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:34,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {1079#(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 {1079#(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:34,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {1079#(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 {1079#(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:34,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#(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; {1078#false} is VALID [2022-02-20 23:58:34,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {1078#false} assume !(1 == #valid[dll_create_~head~0#1.base]); {1078#false} is VALID [2022-02-20 23:58:34,666 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:34,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:34,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426160709] [2022-02-20 23:58:34,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426160709] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:34,667 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:34,667 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:58:34,667 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722973851] [2022-02-20 23:58:34,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:34,668 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:34,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:34,669 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:34,675 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:34,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:34,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:34,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:34,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:34,676 INFO L87 Difference]: Start difference. First operand 57 states and 63 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:34,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,740 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-02-20 23:58:34,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:34,741 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:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:34,741 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:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-02-20 23:58:34,742 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:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-02-20 23:58:34,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-02-20 23:58:34,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:34,784 INFO L225 Difference]: With dead ends: 63 [2022-02-20 23:58:34,785 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 23:58:34,785 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:34,786 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 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:34,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 113 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:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 23:58:34,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-02-20 23:58:34,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:34,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 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,789 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 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,789 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 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,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,790 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-02-20 23:58:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-02-20 23:58:34,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:34,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:34,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 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 63 states. [2022-02-20 23:58:34,791 INFO L87 Difference]: Start difference. First operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 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 63 states. [2022-02-20 23:58:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,792 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-02-20 23:58:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-02-20 23:58:34,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:34,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:34,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:34,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 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,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-02-20 23:58:34,794 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2022-02-20 23:58:34,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:34,794 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-02-20 23:58:34,795 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:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-02-20 23:58:34,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:58:34,795 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:34,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:34,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:58:34,796 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:34,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:34,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2022-02-20 23:58:34,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:34,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197961139] [2022-02-20 23:58:34,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:34,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:34,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {1333#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); {1333#true} is VALID [2022-02-20 23:58:34,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {1333#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {1335#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:34,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {1335#(= (+ (- 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; {1335#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:34,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {1335#(= (+ (- 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); {1335#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:34,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {1335#(= (+ (- 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 {1335#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:34,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {1335#(= (+ (- 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 {1335#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:34,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {1335#(= (+ (- 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 {1335#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:34,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {1335#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {1335#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:34,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {1335#(= (+ (- 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; {1336#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:34,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {1336#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {1334#false} is VALID [2022-02-20 23:58:34,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {1334#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {1334#false} is VALID [2022-02-20 23:58:34,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {1334#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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {1334#false} is VALID [2022-02-20 23:58:34,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {1334#false} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {1334#false} is VALID [2022-02-20 23:58:34,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {1334#false} assume !!(dll_update_at_~index#1 > 0); {1334#false} is VALID [2022-02-20 23:58:34,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {1334#false} assume !(1 == #valid[dll_update_at_~head#1.base]); {1334#false} is VALID [2022-02-20 23:58:34,864 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:34,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:34,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197961139] [2022-02-20 23:58:34,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197961139] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:34,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454261516] [2022-02-20 23:58:34,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:34,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:34,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:34,869 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:34,883 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:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:34,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:58:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:34,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:35,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {1333#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); {1333#true} is VALID [2022-02-20 23:58:35,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {1333#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#(<= 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; {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {1343#(<= 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 {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#(<= 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 {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {1343#(<= 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 {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {1343#(<= 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; {1336#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {1336#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {1334#false} is VALID [2022-02-20 23:58:35,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {1334#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {1334#false} is VALID [2022-02-20 23:58:35,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {1334#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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {1334#false} is VALID [2022-02-20 23:58:35,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {1334#false} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {1334#false} is VALID [2022-02-20 23:58:35,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {1334#false} assume !!(dll_update_at_~index#1 > 0); {1334#false} is VALID [2022-02-20 23:58:35,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {1334#false} assume !(1 == #valid[dll_update_at_~head#1.base]); {1334#false} is VALID [2022-02-20 23:58:35,118 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:35,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:35,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {1334#false} assume !(1 == #valid[dll_update_at_~head#1.base]); {1334#false} is VALID [2022-02-20 23:58:35,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {1334#false} assume !!(dll_update_at_~index#1 > 0); {1334#false} is VALID [2022-02-20 23:58:35,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {1334#false} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {1334#false} is VALID [2022-02-20 23:58:35,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {1334#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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {1334#false} is VALID [2022-02-20 23:58:35,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {1334#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {1334#false} is VALID [2022-02-20 23:58:35,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {1336#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {1334#false} is VALID [2022-02-20 23:58:35,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {1343#(<= 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; {1336#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {1343#(<= 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 {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#(<= 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 {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,218 INFO L290 TraceCheckUtils]: 4: Hoare triple {1343#(<= 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 {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#(<= 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; {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {1333#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {1343#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:35,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {1333#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); {1333#true} is VALID [2022-02-20 23:58:35,220 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:35,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454261516] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:35,220 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:35,220 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-02-20 23:58:35,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513259207] [2022-02-20 23:58:35,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:35,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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 15 [2022-02-20 23:58:35,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:35,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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:35,237 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:35,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:58:35,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:35,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:58:35,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:58:35,238 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:35,315 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-02-20 23:58:35,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:58:35,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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 15 [2022-02-20 23:58:35,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-02-20 23:58:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-02-20 23:58:35,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-02-20 23:58:35,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:35,363 INFO L225 Difference]: With dead ends: 64 [2022-02-20 23:58:35,363 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 23:58:35,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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:35,364 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 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:35,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 167 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:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 23:58:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-20 23:58:35,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:35,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 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:35,367 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 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:35,367 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 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:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:35,368 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-02-20 23:58:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-02-20 23:58:35,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:35,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:35,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 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 64 states. [2022-02-20 23:58:35,369 INFO L87 Difference]: Start difference. First operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 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 64 states. [2022-02-20 23:58:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:35,370 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-02-20 23:58:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-02-20 23:58:35,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:35,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:35,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:35,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 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:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-02-20 23:58:35,372 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2022-02-20 23:58:35,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:35,373 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-02-20 23:58:35,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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:35,373 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-02-20 23:58:35,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:58:35,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:35,373 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:35,393 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:35,587 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:35,587 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:35,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:35,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-02-20 23:58:35,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:35,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008251512] [2022-02-20 23:58:35,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:35,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:35,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {1680#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); {1680#true} is VALID [2022-02-20 23:58:35,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {1680#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {1680#true} is VALID [2022-02-20 23:58:35,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {1680#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; {1682#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {1682#(= (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); {1682#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {1682#(= (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 {1682#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {1682#(= (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 {1682#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {1682#(= (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 {1682#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {1682#(= (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); {1682#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {1682#(= (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; {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {1683#(= (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; {1684#(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:35,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {1684#(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); {1684#(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:35,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {1684#(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 {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {1683#(= (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 {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {1683#(= (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 {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {1683#(= (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; {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !(1 == #valid[dll_create_~head~0#1.base]); {1681#false} is VALID [2022-02-20 23:58:35,724 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:35,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:35,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008251512] [2022-02-20 23:58:35,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008251512] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:35,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789384157] [2022-02-20 23:58:35,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:35,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:35,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:35,727 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:35,728 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:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:35,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:58:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:35,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:35,842 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,905 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:58:35,906 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:35,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {1680#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); {1680#true} is VALID [2022-02-20 23:58:35,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {1680#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {1680#true} is VALID [2022-02-20 23:58:35,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {1680#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; {1682#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {1682#(= (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); {1682#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {1682#(= (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 {1682#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {1682#(= (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 {1682#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {1682#(= (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 {1682#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {1682#(= (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); {1682#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {1682#(= (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; {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {1683#(= (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; {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {1683#(= (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); {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {1683#(= (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 {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {1683#(= (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 {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {1683#(= (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 {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {1683#(= (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; {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:35,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !(1 == #valid[dll_create_~head~0#1.base]); {1681#false} is VALID [2022-02-20 23:58:35,947 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:35,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:36,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !(1 == #valid[dll_create_~head~0#1.base]); {1681#false} is VALID [2022-02-20 23:58:36,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {1683#(= (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; {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:36,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {1683#(= (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 {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:36,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {1683#(= (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 {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:36,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {1683#(= (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 {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:36,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {1683#(= (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); {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:36,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {1751#(forall ((v_ArrVal_146 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_146) |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; {1683#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:36,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {1755#(forall ((v_ArrVal_146 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_146) |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; {1751#(forall ((v_ArrVal_146 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_146) |ULTIMATE.start_dll_create_~head~0#1.base|) 1)))} is VALID [2022-02-20 23:58:36,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {1755#(forall ((v_ArrVal_146 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_146) |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); {1755#(forall ((v_ArrVal_146 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_146) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} is VALID [2022-02-20 23:58:36,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {1755#(forall ((v_ArrVal_146 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_146) |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 {1755#(forall ((v_ArrVal_146 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_146) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} is VALID [2022-02-20 23:58:36,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {1755#(forall ((v_ArrVal_146 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_146) |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 {1755#(forall ((v_ArrVal_146 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_146) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} is VALID [2022-02-20 23:58:36,365 INFO L290 TraceCheckUtils]: 4: Hoare triple {1755#(forall ((v_ArrVal_146 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_146) |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 {1755#(forall ((v_ArrVal_146 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_146) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} is VALID [2022-02-20 23:58:36,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {1755#(forall ((v_ArrVal_146 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_146) |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); {1755#(forall ((v_ArrVal_146 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_146) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} is VALID [2022-02-20 23:58:36,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {1680#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; {1755#(forall ((v_ArrVal_146 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_146) |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)))} is VALID [2022-02-20 23:58:36,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {1680#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {1680#true} is VALID [2022-02-20 23:58:36,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {1680#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); {1680#true} is VALID [2022-02-20 23:58:36,372 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:36,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789384157] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:36,373 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:36,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-02-20 23:58:36,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997723931] [2022-02-20 23:58:36,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:36,374 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 16 [2022-02-20 23:58:36,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:36,374 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:58:36,411 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:36,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:58:36,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:36,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:58:36,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:36,412 INFO L87 Difference]: Start difference. First operand 64 states and 70 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:58:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:36,551 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-02-20 23:58:36,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:58:36,551 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 16 [2022-02-20 23:58:36,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:36,551 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:58:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-02-20 23:58:36,552 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:58:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-02-20 23:58:36,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-02-20 23:58:36,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:36,606 INFO L225 Difference]: With dead ends: 77 [2022-02-20 23:58:36,606 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 23:58:36,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 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:36,606 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 160 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:36,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 75 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2022-02-20 23:58:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 23:58:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-02-20 23:58:36,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:36,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 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:36,609 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 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:36,609 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 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:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:36,610 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-02-20 23:58:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-02-20 23:58:36,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:36,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:36,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 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 77 states. [2022-02-20 23:58:36,611 INFO L87 Difference]: Start difference. First operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 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 77 states. [2022-02-20 23:58:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:36,612 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-02-20 23:58:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-02-20 23:58:36,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:36,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:36,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:36,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 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:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-02-20 23:58:36,614 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2022-02-20 23:58:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:36,614 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-02-20 23:58:36,614 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:58:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-02-20 23:58:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:58:36,615 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:36,615 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:36,632 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:36,825 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:36,825 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:36,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-02-20 23:58:36,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:36,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694029055] [2022-02-20 23:58:36,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:36,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:36,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {2076#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); {2076#true} is VALID [2022-02-20 23:58:36,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {2076#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {2076#true} is VALID [2022-02-20 23:58:36,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {2076#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; {2078#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:36,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {2078#(= |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); {2078#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:36,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {2078#(= |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 {2079#(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:36,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {2079#(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 {2079#(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:36,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {2079#(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 {2080#(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:36,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {2080#(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); {2080#(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:36,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {2080#(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; {2081#(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:36,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {2081#(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; {2082#(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:36,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {2082#(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); {2082#(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:36,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {2082#(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 {2082#(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:36,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {2082#(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 {2082#(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:36,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {2082#(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 {2082#(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:36,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {2082#(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; {2082#(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:36,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {2082#(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); {2077#false} is VALID [2022-02-20 23:58:36,950 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:36,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:36,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694029055] [2022-02-20 23:58:36,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694029055] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:36,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084708281] [2022-02-20 23:58:36,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:36,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:36,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:36,964 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:36,965 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:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:37,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:58:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:37,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:37,085 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:37,090 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:37,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:37,186 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:37,196 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:58:37,197 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:37,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {2076#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); {2076#true} is VALID [2022-02-20 23:58:37,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {2076#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {2076#true} is VALID [2022-02-20 23:58:37,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {2076#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; {2080#(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:37,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {2080#(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 !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {2080#(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:37,246 INFO L290 TraceCheckUtils]: 4: Hoare triple {2080#(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|)))} 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 {2080#(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:37,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {2080#(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|)))} 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 {2080#(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:37,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {2080#(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|)))} 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 {2080#(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:37,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {2080#(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); {2080#(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:37,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {2080#(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; {2081#(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:37,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {2081#(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; {2082#(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:37,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {2082#(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); {2082#(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:37,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {2082#(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 {2082#(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:37,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {2082#(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 {2082#(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:37,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {2082#(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 {2082#(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:37,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {2082#(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; {2082#(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:37,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {2082#(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); {2077#false} is VALID [2022-02-20 23:58:37,252 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:37,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:37,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {2131#(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); {2077#false} is VALID [2022-02-20 23:58:37,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {2131#(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; {2131#(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:37,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {2131#(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 {2131#(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:37,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {2131#(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 {2131#(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:37,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {2131#(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 {2131#(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:37,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {2131#(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); {2131#(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:37,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {2150#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0)) (and (forall ((v_ArrVal_229 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_229) |ULTIMATE.start_dll_create_~head~0#1.base|))) (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)))))} 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; {2131#(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:37,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {2154#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_229 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_229) |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; {2150#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_20|) 0)) (and (forall ((v_ArrVal_229 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_229) |ULTIMATE.start_dll_create_~head~0#1.base|))) (<= 0 (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 8)))))} is VALID [2022-02-20 23:58:37,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {2154#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_229 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_229) |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); {2154#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_229 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_229) |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:37,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {2154#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_229 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_229) |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))))} 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 {2154#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_229 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_229) |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:37,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {2154#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_229 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_229) |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))))} 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 {2154#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_229 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_229) |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:37,805 INFO L290 TraceCheckUtils]: 4: Hoare triple {2154#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_229 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_229) |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))))} 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 {2154#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_229 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_229) |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:37,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {2154#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_229 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_229) |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 !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {2154#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_229 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_229) |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:37,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {2076#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; {2154#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_20| Int)) (or (and (forall ((v_ArrVal_229 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_229) |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:37,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {2076#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {2076#true} is VALID [2022-02-20 23:58:37,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {2076#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); {2076#true} is VALID [2022-02-20 23:58:37,807 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:37,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084708281] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:37,807 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:37,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-02-20 23:58:37,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061857127] [2022-02-20 23:58:37,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:37,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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:37,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:37,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:37,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:58:37,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:37,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:58:37,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:58:37,839 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:38,115 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-02-20 23:58:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:58:38,115 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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:38,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-02-20 23:58:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-02-20 23:58:38,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-02-20 23:58:38,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:38,181 INFO L225 Difference]: With dead ends: 76 [2022-02-20 23:58:38,181 INFO L226 Difference]: Without dead ends: 76 [2022-02-20 23:58:38,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:58:38,182 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 353 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:38,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 59 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-02-20 23:58:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-20 23:58:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-02-20 23:58:38,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:38,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 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,185 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 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,186 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 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,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:38,188 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-02-20 23:58:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-02-20 23:58:38,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:38,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:38,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 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 76 states. [2022-02-20 23:58:38,188 INFO L87 Difference]: Start difference. First operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 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 76 states. [2022-02-20 23:58:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:38,191 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-02-20 23:58:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-02-20 23:58:38,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:38,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:38,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:38,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 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,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-02-20 23:58:38,193 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2022-02-20 23:58:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:38,193 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-02-20 23:58:38,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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,193 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-02-20 23:58:38,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:58:38,194 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:38,194 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:38,215 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:38,411 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:38,413 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:38,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:38,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2022-02-20 23:58:38,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:38,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495475129] [2022-02-20 23:58:38,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:38,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:38,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {2474#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); {2474#true} is VALID [2022-02-20 23:58:38,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {2474#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {2474#true} is VALID [2022-02-20 23:58:38,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {2474#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; {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {2476#(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); {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {2476#(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 {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {2476#(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 {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {2476#(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 {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {2476#(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); {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {2476#(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; {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {2477#(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; {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {2477#(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); {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {2477#(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 {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {2477#(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 {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {2477#(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 {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {2477#(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); {2475#false} is VALID [2022-02-20 23:58:38,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {2475#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; {2475#false} is VALID [2022-02-20 23:58:38,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {2475#false} assume !(dll_create_~len#1 > 0); {2475#false} is VALID [2022-02-20 23:58:38,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {2475#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {2475#false} is VALID [2022-02-20 23:58:38,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {2475#false} is VALID [2022-02-20 23:58:38,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#false} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {2475#false} is VALID [2022-02-20 23:58:38,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#false} assume !!(dll_update_at_~index#1 > 0); {2475#false} is VALID [2022-02-20 23:58:38,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {2475#false} assume !(1 == #valid[dll_update_at_~head#1.base]); {2475#false} is VALID [2022-02-20 23:58:38,465 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:38,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:38,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495475129] [2022-02-20 23:58:38,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495475129] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:38,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882306684] [2022-02-20 23:58:38,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:58:38,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:38,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:38,466 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:38,468 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:38,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:58:38,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:58:38,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:58:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:38,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:38,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {2474#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); {2474#true} is VALID [2022-02-20 23:58:38,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {2474#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {2474#true} is VALID [2022-02-20 23:58:38,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {2474#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; {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {2476#(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); {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {2476#(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 {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {2476#(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 {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {2476#(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 {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {2476#(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); {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {2476#(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; {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {2477#(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; {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {2477#(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); {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {2477#(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 {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {2477#(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 {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {2477#(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 {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {2477#(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); {2475#false} is VALID [2022-02-20 23:58:38,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {2475#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; {2475#false} is VALID [2022-02-20 23:58:38,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {2475#false} assume !(dll_create_~len#1 > 0); {2475#false} is VALID [2022-02-20 23:58:38,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {2475#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {2475#false} is VALID [2022-02-20 23:58:38,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {2475#false} is VALID [2022-02-20 23:58:38,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#false} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {2475#false} is VALID [2022-02-20 23:58:38,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#false} assume !!(dll_update_at_~index#1 > 0); {2475#false} is VALID [2022-02-20 23:58:38,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {2475#false} assume !(1 == #valid[dll_update_at_~head#1.base]); {2475#false} is VALID [2022-02-20 23:58:38,599 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:38,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:38,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {2475#false} assume !(1 == #valid[dll_update_at_~head#1.base]); {2475#false} is VALID [2022-02-20 23:58:38,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#false} assume !!(dll_update_at_~index#1 > 0); {2475#false} is VALID [2022-02-20 23:58:38,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#false} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {2475#false} is VALID [2022-02-20 23:58:38,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {2475#false} is VALID [2022-02-20 23:58:38,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {2475#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {2475#false} is VALID [2022-02-20 23:58:38,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {2475#false} assume !(dll_create_~len#1 > 0); {2475#false} is VALID [2022-02-20 23:58:38,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {2475#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; {2475#false} is VALID [2022-02-20 23:58:38,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {2477#(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); {2475#false} is VALID [2022-02-20 23:58:38,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {2477#(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 {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {2477#(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 {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {2477#(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 {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {2477#(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); {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {2477#(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; {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {2476#(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; {2477#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {2476#(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); {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {2476#(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 {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {2476#(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 {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {2476#(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 {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {2476#(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); {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {2474#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; {2476#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:38,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {2474#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {2474#true} is VALID [2022-02-20 23:58:38,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {2474#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); {2474#true} is VALID [2022-02-20 23:58:38,647 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:38,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882306684] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:38,647 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:38,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-02-20 23:58:38,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829649708] [2022-02-20 23:58:38,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:38,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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 22 [2022-02-20 23:58:38,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:38,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:38,661 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:38,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:58:38,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:38,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:58:38,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:58:38,662 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:38,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:38,747 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-02-20 23:58:38,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:58:38,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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 22 [2022-02-20 23:58:38,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:38,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-02-20 23:58:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-02-20 23:58:38,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-02-20 23:58:38,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:38,797 INFO L225 Difference]: With dead ends: 62 [2022-02-20 23:58:38,797 INFO L226 Difference]: Without dead ends: 62 [2022-02-20 23:58:38,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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:38,798 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 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:38,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 56 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:38,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-20 23:58:38,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-02-20 23:58:38,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:38,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 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,800 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 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,800 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 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,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:38,801 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-02-20 23:58:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-02-20 23:58:38,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:38,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:38,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 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 62 states. [2022-02-20 23:58:38,801 INFO L87 Difference]: Start difference. First operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 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 62 states. [2022-02-20 23:58:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:38,802 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-02-20 23:58:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-02-20 23:58:38,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:38,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:38,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:38,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 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,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-02-20 23:58:38,804 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 22 [2022-02-20 23:58:38,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:38,804 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-02-20 23:58:38,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-02-20 23:58:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:58:38,805 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:38,805 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,824 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:39,015 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:39,016 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:39,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:39,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022382, now seen corresponding path program 1 times [2022-02-20 23:58:39,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:39,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151867983] [2022-02-20 23:58:39,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:39,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:39,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {2856#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); {2856#true} is VALID [2022-02-20 23:58:39,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {2856#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {2856#true} is VALID [2022-02-20 23:58:39,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {2856#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; {2856#true} is VALID [2022-02-20 23:58:39,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {2856#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {2856#true} is VALID [2022-02-20 23:58:39,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {2856#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 {2856#true} is VALID [2022-02-20 23:58:39,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {2856#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 {2856#true} is VALID [2022-02-20 23:58:39,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {2856#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 {2856#true} is VALID [2022-02-20 23:58:39,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {2856#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {2856#true} is VALID [2022-02-20 23:58:39,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {2856#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; {2856#true} is VALID [2022-02-20 23:58:39,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {2856#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; {2856#true} is VALID [2022-02-20 23:58:39,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {2856#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {2856#true} is VALID [2022-02-20 23:58:39,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {2856#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 {2858#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:39,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {2858#(= (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 {2858#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:39,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {2858#(= (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 {2858#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:39,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {2858#(= (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; {2858#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:39,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {2858#(= (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 {2858#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:39,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {2858#(= (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; {2859#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:39,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {2859#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !(dll_create_~len#1 > 0); {2859#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:39,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {2859#(= (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; {2860#(= (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:39,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {2860#(= (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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {2861#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:58:39,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {2861#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {2862#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} is VALID [2022-02-20 23:58:39,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {2862#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} assume !!(dll_update_at_~index#1 > 0); {2862#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} is VALID [2022-02-20 23:58:39,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {2862#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} assume !(1 == #valid[dll_update_at_~head#1.base]); {2857#false} is VALID [2022-02-20 23:58:39,077 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:39,078 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:39,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151867983] [2022-02-20 23:58:39,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151867983] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:39,078 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:39,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:58:39,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592394016] [2022-02-20 23:58:39,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:39,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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:39,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:39,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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:39,104 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:39,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:58:39,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:39,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:58:39,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:39,105 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:39,431 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-02-20 23:58:39,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:58:39,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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:39,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2022-02-20 23:58:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2022-02-20 23:58:39,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 123 transitions. [2022-02-20 23:58:39,524 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:39,525 INFO L225 Difference]: With dead ends: 113 [2022-02-20 23:58:39,525 INFO L226 Difference]: Without dead ends: 113 [2022-02-20 23:58:39,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:58:39,526 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 259 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:39,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-02-20 23:58:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 65. [2022-02-20 23:58:39,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:39,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 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,530 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 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,530 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 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,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:39,532 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-02-20 23:58:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2022-02-20 23:58:39,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:39,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:39,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 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:39,533 INFO L87 Difference]: Start difference. First operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 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:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:39,545 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-02-20 23:58:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2022-02-20 23:58:39,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:39,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:39,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:39,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 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,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-02-20 23:58:39,547 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 23 [2022-02-20 23:58:39,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:39,547 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-02-20 23:58:39,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-02-20 23:58:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:58:39,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:39,548 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:39,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:58:39,548 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:39,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:39,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022381, now seen corresponding path program 1 times [2022-02-20 23:58:39,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:39,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898199009] [2022-02-20 23:58:39,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:39,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:39,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {3278#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); {3278#true} is VALID [2022-02-20 23:58:39,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {3278#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {3278#true} is VALID [2022-02-20 23:58:39,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {3278#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; {3278#true} is VALID [2022-02-20 23:58:39,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {3278#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3278#true} is VALID [2022-02-20 23:58:39,650 INFO L290 TraceCheckUtils]: 4: Hoare triple {3278#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 {3278#true} is VALID [2022-02-20 23:58:39,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {3278#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 {3278#true} is VALID [2022-02-20 23:58:39,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {3278#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 {3278#true} is VALID [2022-02-20 23:58:39,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {3278#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3278#true} is VALID [2022-02-20 23:58:39,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {3278#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; {3278#true} is VALID [2022-02-20 23:58:39,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {3278#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; {3280#(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:39,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {3280#(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); {3280#(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:39,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {3280#(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 {3280#(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:39,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {3280#(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 {3280#(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:39,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {3280#(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 {3280#(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:39,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {3280#(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; {3280#(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:39,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {3280#(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 {3280#(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:39,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {3280#(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; {3281#(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:39,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {3281#(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); {3281#(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:39,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {3281#(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; {3282#(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:39,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {3282#(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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {3283#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:39,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {3283#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {3284#(and (= (+ (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|) (- 12)) 0) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0))} is VALID [2022-02-20 23:58:39,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {3284#(and (= (+ (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|) (- 12)) 0) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0))} assume !!(dll_update_at_~index#1 > 0); {3284#(and (= (+ (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|) (- 12)) 0) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0))} is VALID [2022-02-20 23:58:39,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {3284#(and (= (+ (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|) (- 12)) 0) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0))} assume !(4 + (4 + dll_update_at_~head#1.offset) <= #length[dll_update_at_~head#1.base] && 0 <= 4 + dll_update_at_~head#1.offset); {3279#false} is VALID [2022-02-20 23:58:39,658 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,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:39,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898199009] [2022-02-20 23:58:39,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898199009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:39,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:39,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:58:39,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417068566] [2022-02-20 23:58:39,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:39,659 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 23 [2022-02-20 23:58:39,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:39,659 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:39,690 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:39,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:58:39,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:39,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:58:39,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:39,691 INFO L87 Difference]: Start difference. First operand 65 states and 73 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:40,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,055 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-02-20 23:58:40,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:58:40,055 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 23 [2022-02-20 23:58:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:40,055 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:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-02-20 23:58:40,056 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:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-02-20 23:58:40,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 110 transitions. [2022-02-20 23:58:40,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:40,153 INFO L225 Difference]: With dead ends: 100 [2022-02-20 23:58:40,153 INFO L226 Difference]: Without dead ends: 100 [2022-02-20 23:58:40,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:58:40,154 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:40,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-20 23:58:40,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2022-02-20 23:58:40,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:40,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 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:40,156 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 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:40,156 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 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:40,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,157 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-02-20 23:58:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2022-02-20 23:58:40,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:40,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:40,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 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 100 states. [2022-02-20 23:58:40,158 INFO L87 Difference]: Start difference. First operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 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 100 states. [2022-02-20 23:58:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,159 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-02-20 23:58:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2022-02-20 23:58:40,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:40,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:40,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:40,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 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:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-02-20 23:58:40,160 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 23 [2022-02-20 23:58:40,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:40,160 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-02-20 23:58:40,160 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:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-02-20 23:58:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:58:40,161 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:40,161 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:40,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:58:40,161 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2022-02-20 23:58:40,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:40,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230084594] [2022-02-20 23:58:40,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:40,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:40,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {3661#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); {3661#true} is VALID [2022-02-20 23:58:40,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {3661#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {3661#true} is VALID [2022-02-20 23:58:40,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {3661#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; {3661#true} is VALID [2022-02-20 23:58:40,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {3661#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3661#true} is VALID [2022-02-20 23:58:40,239 INFO L290 TraceCheckUtils]: 4: Hoare triple {3661#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 {3661#true} is VALID [2022-02-20 23:58:40,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {3661#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 {3661#true} is VALID [2022-02-20 23:58:40,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {3661#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 {3661#true} is VALID [2022-02-20 23:58:40,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {3661#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3661#true} is VALID [2022-02-20 23:58:40,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {3661#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; {3661#true} is VALID [2022-02-20 23:58:40,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {3661#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; {3661#true} is VALID [2022-02-20 23:58:40,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {3661#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {3661#true} is VALID [2022-02-20 23:58:40,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {3661#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 {3663#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:40,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {3663#(= (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 {3663#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:40,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {3663#(= (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 {3663#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:40,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {3663#(= (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; {3663#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:40,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {3663#(= (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 {3663#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:40,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {3663#(= (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; {3664#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:40,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {3664#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !(dll_create_~len#1 > 0); {3664#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:40,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {3664#(= (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; {3665#(= (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:40,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {3665#(= (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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {3666#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:58:40,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {3666#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !(main_~i~0#1 >= 0); {3666#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:58:40,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {3666#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} main_~i~0#1 := main_~len~0#1 - 1; {3666#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:58:40,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {3666#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !!(main_~i~0#1 <= 0);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_get_data_at } true;dll_get_data_at_#in~head#1.base, dll_get_data_at_#in~head#1.offset, dll_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_get_data_at_#res#1;havoc dll_get_data_at_#t~mem7#1.base, dll_get_data_at_#t~mem7#1.offset, dll_get_data_at_#t~post8#1, dll_get_data_at_#t~mem9#1, dll_get_data_at_~head#1.base, dll_get_data_at_~head#1.offset, dll_get_data_at_~index#1;dll_get_data_at_~head#1.base, dll_get_data_at_~head#1.offset := dll_get_data_at_#in~head#1.base, dll_get_data_at_#in~head#1.offset;dll_get_data_at_~index#1 := dll_get_data_at_#in~index#1; {3667#(= 1 (select |#valid| |ULTIMATE.start_dll_get_data_at_~head#1.base|))} is VALID [2022-02-20 23:58:40,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {3667#(= 1 (select |#valid| |ULTIMATE.start_dll_get_data_at_~head#1.base|))} assume !(dll_get_data_at_~index#1 > 0); {3667#(= 1 (select |#valid| |ULTIMATE.start_dll_get_data_at_~head#1.base|))} is VALID [2022-02-20 23:58:40,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {3667#(= 1 (select |#valid| |ULTIMATE.start_dll_get_data_at_~head#1.base|))} assume !(1 == #valid[dll_get_data_at_~head#1.base]); {3662#false} is VALID [2022-02-20 23:58:40,245 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:40,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:40,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230084594] [2022-02-20 23:58:40,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230084594] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:40,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:40,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:58:40,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551553739] [2022-02-20 23:58:40,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:40,247 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 25 [2022-02-20 23:58:40,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:40,247 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:40,260 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:40,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:58:40,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:40,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:58:40,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:40,261 INFO L87 Difference]: Start difference. First operand 65 states and 71 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:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,552 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-02-20 23:58:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:58:40,552 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 25 [2022-02-20 23:58:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:40,552 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:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-02-20 23:58:40,553 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:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-02-20 23:58:40,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 105 transitions. [2022-02-20 23:58:40,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:40,635 INFO L225 Difference]: With dead ends: 100 [2022-02-20 23:58:40,635 INFO L226 Difference]: Without dead ends: 100 [2022-02-20 23:58:40,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:58:40,636 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 243 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:40,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 106 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-20 23:58:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 68. [2022-02-20 23:58:40,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:40,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 68 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 67 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:40,646 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 68 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 67 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:40,647 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 68 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 67 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:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,648 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-02-20 23:58:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-02-20 23:58:40,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:40,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:40,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 67 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 100 states. [2022-02-20 23:58:40,649 INFO L87 Difference]: Start difference. First operand has 68 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 67 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 100 states. [2022-02-20 23:58:40,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,650 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-02-20 23:58:40,650 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-02-20 23:58:40,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:40,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:40,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:40,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 67 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:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-02-20 23:58:40,652 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 25 [2022-02-20 23:58:40,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:40,652 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-02-20 23:58:40,652 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:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-02-20 23:58:40,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:58:40,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:40,653 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:40,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:58:40,653 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:40,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:40,653 INFO L85 PathProgramCache]: Analyzing trace with hash -244809886, now seen corresponding path program 1 times [2022-02-20 23:58:40,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:40,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774487736] [2022-02-20 23:58:40,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:40,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:40,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {4047#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); {4047#true} is VALID [2022-02-20 23:58:40,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {4047#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {4049#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:40,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {4049#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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; {4049#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:40,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {4049#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4049#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:40,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {4049#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {4049#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:40,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {4049#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {4049#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:40,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {4049#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {4049#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:40,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {4049#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {4049#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:40,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {4049#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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; {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {4050#(<= 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; {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {4050#(<= 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 {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {4050#(<= 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 {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {4050#(<= 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 {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {4050#(<= 2 |ULTIMATE.start_main_~len~0#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 {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {4050#(<= 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; {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {4050#(<= 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; {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {4050#(<= 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {4051#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:40,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {4051#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {4048#false} is VALID [2022-02-20 23:58:40,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {4048#false} main_~i~0#1 := main_~len~0#1 - 1; {4048#false} is VALID [2022-02-20 23:58:40,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {4048#false} assume !!(main_~i~0#1 <= 0);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_get_data_at } true;dll_get_data_at_#in~head#1.base, dll_get_data_at_#in~head#1.offset, dll_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_get_data_at_#res#1;havoc dll_get_data_at_#t~mem7#1.base, dll_get_data_at_#t~mem7#1.offset, dll_get_data_at_#t~post8#1, dll_get_data_at_#t~mem9#1, dll_get_data_at_~head#1.base, dll_get_data_at_~head#1.offset, dll_get_data_at_~index#1;dll_get_data_at_~head#1.base, dll_get_data_at_~head#1.offset := dll_get_data_at_#in~head#1.base, dll_get_data_at_#in~head#1.offset;dll_get_data_at_~index#1 := dll_get_data_at_#in~index#1; {4048#false} is VALID [2022-02-20 23:58:40,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {4048#false} assume !(dll_get_data_at_~index#1 > 0); {4048#false} is VALID [2022-02-20 23:58:40,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {4048#false} assume !(4 + dll_get_data_at_~head#1.offset <= #length[dll_get_data_at_~head#1.base] && 0 <= dll_get_data_at_~head#1.offset); {4048#false} is VALID [2022-02-20 23:58:40,723 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:40,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:40,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774487736] [2022-02-20 23:58:40,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774487736] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:40,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779178579] [2022-02-20 23:58:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:40,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:40,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:40,725 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:40,727 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:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:40,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:58:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:40,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:40,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {4047#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); {4047#true} is VALID [2022-02-20 23:58:40,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {4047#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {4050#(<= 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; {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,893 INFO L290 TraceCheckUtils]: 4: Hoare triple {4050#(<= 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 {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {4050#(<= 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 {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {4050#(<= 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 {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {4050#(<= 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; {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {4050#(<= 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; {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {4050#(<= 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 {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {4050#(<= 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 {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {4050#(<= 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 {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {4050#(<= 2 |ULTIMATE.start_main_~len~0#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 {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {4050#(<= 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; {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {4050#(<= 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; {4050#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:40,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {4050#(<= 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {4051#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:40,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {4051#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {4048#false} is VALID [2022-02-20 23:58:40,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {4048#false} main_~i~0#1 := main_~len~0#1 - 1; {4048#false} is VALID [2022-02-20 23:58:40,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {4048#false} assume !!(main_~i~0#1 <= 0);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_get_data_at } true;dll_get_data_at_#in~head#1.base, dll_get_data_at_#in~head#1.offset, dll_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_get_data_at_#res#1;havoc dll_get_data_at_#t~mem7#1.base, dll_get_data_at_#t~mem7#1.offset, dll_get_data_at_#t~post8#1, dll_get_data_at_#t~mem9#1, dll_get_data_at_~head#1.base, dll_get_data_at_~head#1.offset, dll_get_data_at_~index#1;dll_get_data_at_~head#1.base, dll_get_data_at_~head#1.offset := dll_get_data_at_#in~head#1.base, dll_get_data_at_#in~head#1.offset;dll_get_data_at_~index#1 := dll_get_data_at_#in~index#1; {4048#false} is VALID [2022-02-20 23:58:40,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {4048#false} assume !(dll_get_data_at_~index#1 > 0); {4048#false} is VALID [2022-02-20 23:58:40,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {4048#false} assume !(4 + dll_get_data_at_~head#1.offset <= #length[dll_get_data_at_~head#1.base] && 0 <= dll_get_data_at_~head#1.offset); {4048#false} is VALID [2022-02-20 23:58:40,899 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,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:40,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779178579] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:40,899 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:58:40,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-20 23:58:40,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502157710] [2022-02-20 23:58:40,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:40,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 25 [2022-02-20 23:58:40,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:40,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:40,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:58:40,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:40,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:58:40,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:58:40,915 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:40,971 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-02-20 23:58:40,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:58:40,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 25 [2022-02-20 23:58:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-02-20 23:58:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-02-20 23:58:40,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-02-20 23:58:41,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:41,021 INFO L225 Difference]: With dead ends: 65 [2022-02-20 23:58:41,021 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 23:58:41,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:58:41,021 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:41,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 62 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 23:58:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2022-02-20 23:58:41,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:41,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 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,023 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 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,023 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 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,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:41,024 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-02-20 23:58:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-02-20 23:58:41,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:41,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:41,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 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 65 states. [2022-02-20 23:58:41,025 INFO L87 Difference]: Start difference. First operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 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 65 states. [2022-02-20 23:58:41,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:41,026 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-02-20 23:58:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-02-20 23:58:41,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:41,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:41,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:41,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 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,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-02-20 23:58:41,027 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 25 [2022-02-20 23:58:41,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:41,027 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-02-20 23:58:41,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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,028 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-02-20 23:58:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:58:41,028 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:41,028 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:41,049 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:41,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 23:58:41,239 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:41,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:41,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689078, now seen corresponding path program 1 times [2022-02-20 23:58:41,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:41,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690083390] [2022-02-20 23:58:41,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:41,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:41,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {4375#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); {4375#true} is VALID [2022-02-20 23:58:41,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {4375#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {4377#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:41,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {4377#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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; {4377#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:41,295 INFO L290 TraceCheckUtils]: 3: Hoare triple {4377#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4377#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:41,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {4377#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {4377#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:41,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {4377#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {4377#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:41,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {4377#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {4377#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:41,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {4377#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {4377#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:41,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {4377#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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; {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(dll_create_~len#1 > 0); {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {4379#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:41,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {4379#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {4380#(<= |ULTIMATE.start_dll_update_at_~index#1| 1)} is VALID [2022-02-20 23:58:41,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {4380#(<= |ULTIMATE.start_dll_update_at_~index#1| 1)} assume !!(dll_update_at_~index#1 > 0); {4380#(<= |ULTIMATE.start_dll_update_at_~index#1| 1)} is VALID [2022-02-20 23:58:41,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {4380#(<= |ULTIMATE.start_dll_update_at_~index#1| 1)} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {4380#(<= |ULTIMATE.start_dll_update_at_~index#1| 1)} is VALID [2022-02-20 23:58:41,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {4380#(<= |ULTIMATE.start_dll_update_at_~index#1| 1)} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {4381#(<= |ULTIMATE.start_dll_update_at_~index#1| 0)} is VALID [2022-02-20 23:58:41,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {4381#(<= |ULTIMATE.start_dll_update_at_~index#1| 0)} assume !!(dll_update_at_~index#1 > 0); {4376#false} is VALID [2022-02-20 23:58:41,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {4376#false} assume !(1 == #valid[dll_update_at_~head#1.base]); {4376#false} is VALID [2022-02-20 23:58:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:41,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:41,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690083390] [2022-02-20 23:58:41,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690083390] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:41,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172743550] [2022-02-20 23:58:41,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:41,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:41,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:41,315 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:41,315 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:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:41,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:58:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:41,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:41,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {4375#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); {4375#true} is VALID [2022-02-20 23:58:41,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {4375#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,525 INFO L290 TraceCheckUtils]: 4: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(dll_create_~len#1 > 0); {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:41,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {4378#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {4379#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:41,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {4379#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {4380#(<= |ULTIMATE.start_dll_update_at_~index#1| 1)} is VALID [2022-02-20 23:58:41,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {4380#(<= |ULTIMATE.start_dll_update_at_~index#1| 1)} assume !!(dll_update_at_~index#1 > 0); {4380#(<= |ULTIMATE.start_dll_update_at_~index#1| 1)} is VALID [2022-02-20 23:58:41,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {4380#(<= |ULTIMATE.start_dll_update_at_~index#1| 1)} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {4380#(<= |ULTIMATE.start_dll_update_at_~index#1| 1)} is VALID [2022-02-20 23:58:41,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {4380#(<= |ULTIMATE.start_dll_update_at_~index#1| 1)} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {4381#(<= |ULTIMATE.start_dll_update_at_~index#1| 0)} is VALID [2022-02-20 23:58:41,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {4381#(<= |ULTIMATE.start_dll_update_at_~index#1| 0)} assume !!(dll_update_at_~index#1 > 0); {4376#false} is VALID [2022-02-20 23:58:41,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {4376#false} assume !(1 == #valid[dll_update_at_~head#1.base]); {4376#false} is VALID [2022-02-20 23:58:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:58:41,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:41,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172743550] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:41,532 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:58:41,532 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-02-20 23:58:41,532 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852100475] [2022-02-20 23:58:41,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:41,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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:41,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:41,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:41,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:58:41,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:41,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:58:41,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:41,547 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:41,636 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-02-20 23:58:41,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:58:41,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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:41,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-02-20 23:58:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-02-20 23:58:41,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-02-20 23:58:41,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:41,681 INFO L225 Difference]: With dead ends: 49 [2022-02-20 23:58:41,681 INFO L226 Difference]: Without dead ends: 49 [2022-02-20 23:58:41,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:58:41,682 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 72 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:41,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 73 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:41,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-20 23:58:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-02-20 23:58:41,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:41,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 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,683 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 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,683 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 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,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:41,684 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-02-20 23:58:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-02-20 23:58:41,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:41,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:41,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 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 49 states. [2022-02-20 23:58:41,684 INFO L87 Difference]: Start difference. First operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 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 49 states. [2022-02-20 23:58:41,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:41,685 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-02-20 23:58:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-02-20 23:58:41,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:41,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:41,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:41,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 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,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-02-20 23:58:41,687 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 26 [2022-02-20 23:58:41,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:41,688 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-02-20 23:58:41,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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,688 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-02-20 23:58:41,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:58:41,688 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:41,688 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:41,705 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:41,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:41,891 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:41,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689023, now seen corresponding path program 1 times [2022-02-20 23:58:41,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:41,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014797398] [2022-02-20 23:58:41,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:41,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:42,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {4661#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); {4661#true} is VALID [2022-02-20 23:58:42,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {4661#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {4661#true} is VALID [2022-02-20 23:58:42,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {4661#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; {4663#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:42,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {4663#(= |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); {4663#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:42,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {4663#(= |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 {4664#(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:42,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {4664#(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 {4664#(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:42,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {4664#(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 {4664#(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:42,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {4664#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (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); {4664#(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:42,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {4664#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (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; {4665#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {4665#(= (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; {4666#(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:42,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {4666#(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); {4666#(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:42,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {4666#(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 {4666#(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:42,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {4666#(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 {4667#(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:42,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {4667#(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 {4667#(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:42,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {4667#(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; {4667#(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:42,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {4667#(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 {4668#(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:42,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {4668#(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; {4669#(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:42,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {4669#(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); {4669#(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:42,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {4669#(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; {4670#(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:42,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {4670#(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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {4671#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:42,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {4671#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {4672#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0))} is VALID [2022-02-20 23:58:42,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {4672#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0))} assume !!(dll_update_at_~index#1 > 0); {4672#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0))} is VALID [2022-02-20 23:58:42,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {4672#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0))} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {4673#(= (select |#valid| |ULTIMATE.start_dll_update_at_#t~mem10#1.base|) 1)} is VALID [2022-02-20 23:58:42,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {4673#(= (select |#valid| |ULTIMATE.start_dll_update_at_#t~mem10#1.base|) 1)} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {4674#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} is VALID [2022-02-20 23:58:42,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {4674#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} assume !(dll_update_at_~index#1 > 0); {4674#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} is VALID [2022-02-20 23:58:42,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {4674#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} assume !(1 == #valid[dll_update_at_~head#1.base]); {4662#false} is VALID [2022-02-20 23:58:42,101 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:42,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:42,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014797398] [2022-02-20 23:58:42,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014797398] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:42,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120968525] [2022-02-20 23:58:42,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:42,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:42,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:42,103 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:42,106 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:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:42,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 43 conjunts are in the unsatisfiable core [2022-02-20 23:58:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:42,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:42,220 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:42,248 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:58:42,249 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:42,268 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:42,300 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-20 23:58:42,301 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:42,333 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:58:42,334 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:42,473 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 31 treesize of output 13 [2022-02-20 23:58:42,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {4661#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); {4661#true} is VALID [2022-02-20 23:58:42,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {4661#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {4661#true} is VALID [2022-02-20 23:58:42,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {4661#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; {4684#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {4684#(= (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); {4684#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {4684#(= (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 {4684#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {4684#(= (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 {4684#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {4684#(= (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 {4684#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {4684#(= (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); {4684#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {4684#(= (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; {4665#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:42,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {4665#(= (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; {4706#(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:42,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {4706#(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); {4706#(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:42,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {4706#(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 {4706#(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:42,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {4706#(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 {4716#(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|)))} is VALID [2022-02-20 23:58:42,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {4716#(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|)))} 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 {4716#(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|)))} is VALID [2022-02-20 23:58:42,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {4716#(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|)))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {4716#(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|)))} is VALID [2022-02-20 23:58:42,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {4716#(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|)))} 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 {4726#(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 |#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:42,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {4726#(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 |#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; {4730#(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))} is VALID [2022-02-20 23:58:42,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {4730#(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))} assume !(dll_create_~len#1 > 0); {4730#(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))} is VALID [2022-02-20 23:58:42,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {4730#(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))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {4737#(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))} is VALID [2022-02-20 23:58:42,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {4737#(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))} 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {4741#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))} is VALID [2022-02-20 23:58:42,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {4741#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {4745#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_dll_update_at_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1))} is VALID [2022-02-20 23:58:42,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {4745#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_dll_update_at_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1))} assume !!(dll_update_at_~index#1 > 0); {4745#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_dll_update_at_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1))} is VALID [2022-02-20 23:58:42,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {4745#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_dll_update_at_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1))} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {4673#(= (select |#valid| |ULTIMATE.start_dll_update_at_#t~mem10#1.base|) 1)} is VALID [2022-02-20 23:58:42,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {4673#(= (select |#valid| |ULTIMATE.start_dll_update_at_#t~mem10#1.base|) 1)} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {4674#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} is VALID [2022-02-20 23:58:42,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {4674#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} assume !(dll_update_at_~index#1 > 0); {4674#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} is VALID [2022-02-20 23:58:42,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {4674#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} assume !(1 == #valid[dll_update_at_~head#1.base]); {4662#false} is VALID [2022-02-20 23:58:42,500 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:42,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:42,633 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-02-20 23:58:42,633 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 21 treesize of output 20 [2022-02-20 23:58:42,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |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|)) is different from false [2022-02-20 23:58:42,668 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 Int) (v_ArrVal_730 (Array Int Int))) (= (select (select (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_728)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |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|)) is different from false [2022-02-20 23:58:42,717 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-02-20 23:58:42,718 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 27 treesize of output 33 [2022-02-20 23:58:42,725 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 36 treesize of output 24 [2022-02-20 23:58:42,731 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 7 treesize of output 3 [2022-02-20 23:58:42,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {4674#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} assume !(1 == #valid[dll_update_at_~head#1.base]); {4662#false} is VALID [2022-02-20 23:58:42,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {4674#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} assume !(dll_update_at_~index#1 > 0); {4674#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} is VALID [2022-02-20 23:58:42,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {4673#(= (select |#valid| |ULTIMATE.start_dll_update_at_#t~mem10#1.base|) 1)} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {4674#(= (select |#valid| |ULTIMATE.start_dll_update_at_~head#1.base|) 1)} is VALID [2022-02-20 23:58:42,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {4770#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1)} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {4673#(= (select |#valid| |ULTIMATE.start_dll_update_at_#t~mem10#1.base|) 1)} is VALID [2022-02-20 23:58:42,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {4770#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1)} assume !!(dll_update_at_~index#1 > 0); {4770#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1)} is VALID [2022-02-20 23:58:42,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {4777#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {4770#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1)} is VALID [2022-02-20 23:58:42,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {4781#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {4777#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))))} is VALID [2022-02-20 23:58:42,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {4785#(= (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)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {4781#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4))) 1)} is VALID [2022-02-20 23:58:42,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {4785#(= (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)} assume !(dll_create_~len#1 > 0); {4785#(= (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)} is VALID [2022-02-20 23:58:42,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {4792#(= (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; {4785#(= (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)} is VALID [2022-02-20 23:58:42,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {4796#(forall ((v_ArrVal_730 (Array Int Int))) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |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 {4792#(= (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:42,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {4796#(forall ((v_ArrVal_730 (Array Int Int))) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |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; {4796#(forall ((v_ArrVal_730 (Array Int Int))) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |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:42,792 WARN L290 TraceCheckUtils]: 13: Hoare triple {4803#(forall ((v_ArrVal_728 Int) (v_ArrVal_730 (Array Int Int))) (= |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_728)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |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 {4796#(forall ((v_ArrVal_730 (Array Int Int))) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))} is UNKNOWN [2022-02-20 23:58:42,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {4706#(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 {4803#(forall ((v_ArrVal_728 Int) (v_ArrVal_730 (Array Int Int))) (= |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_728)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |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:42,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {4706#(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 {4706#(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:42,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {4706#(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); {4706#(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:42,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {4816#(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; {4706#(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:42,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {4820#(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; {4816#(not (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 0))} is VALID [2022-02-20 23:58:42,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {4820#(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); {4820#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:58:42,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {4820#(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 {4820#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:58:42,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {4820#(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 {4820#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:58:42,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {4820#(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 {4820#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:58:42,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {4820#(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); {4820#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:58:42,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {4661#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; {4820#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:58:42,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {4661#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {4661#true} is VALID [2022-02-20 23:58:42,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {4661#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); {4661#true} is VALID [2022-02-20 23:58:42,797 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:42,797 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120968525] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:42,797 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:42,797 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2022-02-20 23:58:42,797 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447504635] [2022-02-20 23:58:42,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:42,798 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 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:42,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:42,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 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,854 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:42,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-20 23:58:42,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:42,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-20 23:58:42,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=736, Unknown=2, NotChecked=110, Total=930 [2022-02-20 23:58:42,855 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 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,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:44,831 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-02-20 23:58:44,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 23:58:44,831 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 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:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:44,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 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,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 133 transitions. [2022-02-20 23:58:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 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,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 133 transitions. [2022-02-20 23:58:44,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 133 transitions. [2022-02-20 23:58:44,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 132 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:44,954 INFO L225 Difference]: With dead ends: 129 [2022-02-20 23:58:44,954 INFO L226 Difference]: Without dead ends: 129 [2022-02-20 23:58:44,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=317, Invalid=1757, Unknown=4, NotChecked=178, Total=2256 [2022-02-20 23:58:44,955 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 519 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:44,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [519 Valid, 544 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 589 Invalid, 0 Unknown, 219 Unchecked, 0.5s Time] [2022-02-20 23:58:44,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-20 23:58:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 69. [2022-02-20 23:58:44,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:44,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 69 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 68 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:44,958 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 69 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 68 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:44,958 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 69 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 68 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:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:44,960 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-02-20 23:58:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2022-02-20 23:58:44,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:44,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:44,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 68 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 129 states. [2022-02-20 23:58:44,960 INFO L87 Difference]: Start difference. First operand has 69 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 68 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 129 states. [2022-02-20 23:58:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:44,962 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-02-20 23:58:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2022-02-20 23:58:44,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:44,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:44,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:44,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 68 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:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-02-20 23:58:44,964 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 26 [2022-02-20 23:58:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:44,964 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-02-20 23:58:44,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 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,964 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-02-20 23:58:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:58:44,964 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:44,965 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:44,981 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:45,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:45,165 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:45,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689024, now seen corresponding path program 1 times [2022-02-20 23:58:45,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:45,166 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841889788] [2022-02-20 23:58:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:45,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:45,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {5335#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); {5335#true} is VALID [2022-02-20 23:58:45,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {5335#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {5335#true} is VALID [2022-02-20 23:58:45,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {5335#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; {5337#(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:45,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {5337#(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); {5337#(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:45,407 INFO L290 TraceCheckUtils]: 4: Hoare triple {5337#(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 {5338#(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:45,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {5338#(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 {5338#(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:45,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {5338#(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 {5338#(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:45,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {5338#(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); {5338#(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:45,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {5338#(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; {5339#(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:45,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {5339#(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; {5340#(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 |#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:45,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {5340#(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 |#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); {5340#(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 |#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:45,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {5340#(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 |#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 {5340#(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 |#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:45,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {5340#(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 |#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 {5341#(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) (= |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|)) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12))} is VALID [2022-02-20 23:58:45,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {5341#(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) (= |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|)) (= (select |#length| |ULTIMATE.start_dll_create_~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 {5341#(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) (= |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|)) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12))} is VALID [2022-02-20 23:58:45,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {5341#(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) (= |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|)) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {5341#(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) (= |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|)) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 12))} is VALID [2022-02-20 23:58:45,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {5341#(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) (= |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|)) (= (select |#length| |ULTIMATE.start_dll_create_~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 {5342#(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:45,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {5342#(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; {5343#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 12) (= |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:45,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {5343#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 12) (= |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); {5343#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 12) (= |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:45,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {5343#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 12) (= |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; {5344#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) (= |ULTIMATE.start_dll_create_#res#1.offset| 0))} is VALID [2022-02-20 23:58:45,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {5344#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) (= |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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {5345#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 12) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:45,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {5345#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 12) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {5346#(and (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) 0))} is VALID [2022-02-20 23:58:45,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {5346#(and (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) 0))} assume !!(dll_update_at_~index#1 > 0); {5346#(and (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) 0))} is VALID [2022-02-20 23:58:45,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {5346#(and (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) 0))} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {5347#(and (= |ULTIMATE.start_dll_update_at_#t~mem10#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_update_at_#t~mem10#1.base|) 12))} is VALID [2022-02-20 23:58:45,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {5347#(and (= |ULTIMATE.start_dll_update_at_#t~mem10#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_update_at_#t~mem10#1.base|) 12))} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {5348#(and (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|) 12))} is VALID [2022-02-20 23:58:45,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {5348#(and (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|) 12))} assume !(dll_update_at_~index#1 > 0); {5348#(and (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|) 12))} is VALID [2022-02-20 23:58:45,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {5348#(and (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|) 12))} assume !(4 + dll_update_at_~head#1.offset <= #length[dll_update_at_~head#1.base] && 0 <= dll_update_at_~head#1.offset); {5336#false} is VALID [2022-02-20 23:58:45,419 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,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:45,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841889788] [2022-02-20 23:58:45,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841889788] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:45,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583039694] [2022-02-20 23:58:45,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:45,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:45,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:45,420 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:45,422 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:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:45,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-20 23:58:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:45,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:45,538 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,630 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:58:45,630 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,672 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,679 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,745 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-20 23:58:45,746 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,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:45,758 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:45,804 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:58:45,805 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:45,826 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:46,095 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 39 treesize of output 21 [2022-02-20 23:58:46,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 32 treesize of output 14 [2022-02-20 23:58:46,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {5335#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); {5335#true} is VALID [2022-02-20 23:58:46,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {5335#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {5335#true} is VALID [2022-02-20 23:58:46,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {5335#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; {5358#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|))} is VALID [2022-02-20 23:58:46,189 INFO L290 TraceCheckUtils]: 3: Hoare triple {5358#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {5358#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|))} is VALID [2022-02-20 23:58:46,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {5358#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_create_~new_head~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 {5358#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|))} is VALID [2022-02-20 23:58:46,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {5358#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_create_~new_head~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 {5358#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|))} is VALID [2022-02-20 23:58:46,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {5358#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_create_~new_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 {5358#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|))} is VALID [2022-02-20 23:58:46,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {5358#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {5358#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|))} is VALID [2022-02-20 23:58:46,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {5358#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_create_~new_head~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; {5377#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:46,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {5377#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|))} 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; {5381#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:46,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {5381#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {5381#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:46,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {5381#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_create_~head~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 {5381#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:46,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {5381#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_create_~head~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 {5391#(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|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (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:46,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {5391#(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|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (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 {5391#(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|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (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:46,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {5391#(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|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (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; {5391#(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|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (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:46,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {5391#(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|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (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 {5401#(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|)) (<= 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))) (<= (+ (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:46,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {5401#(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|)) (<= 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))) (<= (+ (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; {5405#(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)))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))))} is VALID [2022-02-20 23:58:46,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {5405#(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)))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))))} assume !(dll_create_~len#1 > 0); {5405#(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)))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))))} is VALID [2022-02-20 23:58:46,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {5405#(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)))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {5412#(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$.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)))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4))))} is VALID [2022-02-20 23:58:46,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {5412#(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$.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)))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {5416#(and (<= 0 (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$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ 12 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))} is VALID [2022-02-20 23:58:46,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {5416#(and (<= 0 (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$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ 12 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {5420#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_dll_update_at_~head#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)))))} is VALID [2022-02-20 23:58:46,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {5420#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_dll_update_at_~head#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)))))} assume !!(dll_update_at_~index#1 > 0); {5420#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_dll_update_at_~head#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)))))} is VALID [2022-02-20 23:58:46,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {5420#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_dll_update_at_~head#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)))))} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {5427#(and (<= (+ |ULTIMATE.start_dll_update_at_#t~mem10#1.offset| 12) (select |#length| |ULTIMATE.start_dll_update_at_#t~mem10#1.base|)) (<= 0 |ULTIMATE.start_dll_update_at_#t~mem10#1.offset|))} is VALID [2022-02-20 23:58:46,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {5427#(and (<= (+ |ULTIMATE.start_dll_update_at_#t~mem10#1.offset| 12) (select |#length| |ULTIMATE.start_dll_update_at_#t~mem10#1.base|)) (<= 0 |ULTIMATE.start_dll_update_at_#t~mem10#1.offset|))} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {5431#(and (<= 0 |ULTIMATE.start_dll_update_at_~head#1.offset|) (<= (+ 12 |ULTIMATE.start_dll_update_at_~head#1.offset|) (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|)))} is VALID [2022-02-20 23:58:46,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {5431#(and (<= 0 |ULTIMATE.start_dll_update_at_~head#1.offset|) (<= (+ 12 |ULTIMATE.start_dll_update_at_~head#1.offset|) (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|)))} assume !(dll_update_at_~index#1 > 0); {5431#(and (<= 0 |ULTIMATE.start_dll_update_at_~head#1.offset|) (<= (+ 12 |ULTIMATE.start_dll_update_at_~head#1.offset|) (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|)))} is VALID [2022-02-20 23:58:46,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {5431#(and (<= 0 |ULTIMATE.start_dll_update_at_~head#1.offset|) (<= (+ 12 |ULTIMATE.start_dll_update_at_~head#1.offset|) (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|)))} assume !(4 + dll_update_at_~head#1.offset <= #length[dll_update_at_~head#1.base] && 0 <= dll_update_at_~head#1.offset); {5336#false} is VALID [2022-02-20 23:58:46,202 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:46,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:46,546 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:58:46,546 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 46 treesize of output 50 [2022-02-20 23:58:46,625 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_832 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |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_834 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |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.offset| 8)))) is different from false [2022-02-20 23:58:46,719 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array Int Int)) (v_ArrVal_831 Int)) (<= (select (select (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|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_831)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |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.offset| 8))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int))) (= (select (select (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_830)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |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_834 (Array Int Int)) (v_ArrVal_831 Int)) (<= 0 (select (select (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|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_831)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2022-02-20 23:58:46,796 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-02-20 23:58:46,796 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 27 treesize of output 33 [2022-02-20 23:58:46,805 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 36 treesize of output 24 [2022-02-20 23:58:46,809 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 11 treesize of output 7 [2022-02-20 23:58:46,829 INFO L356 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2022-02-20 23:58:46,829 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 29 treesize of output 1 [2022-02-20 23:58:46,843 INFO L356 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2022-02-20 23:58:46,843 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 27 treesize of output 1 [2022-02-20 23:58:47,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {5438#(and (<= (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|)) (<= 0 |ULTIMATE.start_dll_update_at_~head#1.offset|))} assume !(4 + dll_update_at_~head#1.offset <= #length[dll_update_at_~head#1.base] && 0 <= dll_update_at_~head#1.offset); {5336#false} is VALID [2022-02-20 23:58:47,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {5438#(and (<= (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|)) (<= 0 |ULTIMATE.start_dll_update_at_~head#1.offset|))} assume !(dll_update_at_~index#1 > 0); {5438#(and (<= (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|)) (<= 0 |ULTIMATE.start_dll_update_at_~head#1.offset|))} is VALID [2022-02-20 23:58:47,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {5445#(and (<= (+ |ULTIMATE.start_dll_update_at_#t~mem10#1.offset| 4) (select |#length| |ULTIMATE.start_dll_update_at_#t~mem10#1.base|)) (<= 0 |ULTIMATE.start_dll_update_at_#t~mem10#1.offset|))} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {5438#(and (<= (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_update_at_~head#1.base|)) (<= 0 |ULTIMATE.start_dll_update_at_~head#1.offset|))} is VALID [2022-02-20 23:58:47,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {5449#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)))))} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {5445#(and (<= (+ |ULTIMATE.start_dll_update_at_#t~mem10#1.offset| 4) (select |#length| |ULTIMATE.start_dll_update_at_#t~mem10#1.base|)) (<= 0 |ULTIMATE.start_dll_update_at_#t~mem10#1.offset|))} is VALID [2022-02-20 23:58:47,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {5449#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)))))} assume !!(dll_update_at_~index#1 > 0); {5449#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)))))} is VALID [2022-02-20 23:58:47,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {5456#(and (<= 0 (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| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {5449#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)))))} is VALID [2022-02-20 23:58:47,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {5460#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {5456#(and (<= 0 (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| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))} is VALID [2022-02-20 23:58:47,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {5464#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 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)))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {5460#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4))))} is VALID [2022-02-20 23:58:47,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {5464#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 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)))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))))} assume !(dll_create_~len#1 > 0); {5464#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 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)))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))))} is VALID [2022-02-20 23:58:47,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {5471#(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)) 4) (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)))) (<= 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))))} 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; {5464#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 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)))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))))} is VALID [2022-02-20 23:58:47,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {5475#(and (forall ((v_ArrVal_834 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_832 (Array Int Int))) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 (Array Int Int))) (<= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |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| 8))))} 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 {5471#(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)) 4) (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)))) (<= 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))))} is VALID [2022-02-20 23:58:47,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {5475#(and (forall ((v_ArrVal_834 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_832 (Array Int Int))) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 (Array Int Int))) (<= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |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| 8))))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {5475#(and (forall ((v_ArrVal_834 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_832 (Array Int Int))) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 (Array Int Int))) (<= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |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| 8))))} is VALID [2022-02-20 23:58:47,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {5482#(and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_831 Int)) (<= 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_831)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int))) (= |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_830)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 (Array Int Int)) (v_ArrVal_831 Int)) (<= (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_831)) |ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |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| 8))))} 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 {5475#(and (forall ((v_ArrVal_834 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_832 (Array Int Int))) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 (Array Int Int))) (<= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |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| 8))))} is VALID [2022-02-20 23:58:47,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {5381#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_create_~head~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 {5482#(and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_831 Int)) (<= 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_831)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int))) (= |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_830)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 (Array Int Int)) (v_ArrVal_831 Int)) (<= (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_831)) |ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |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| 8))))} is VALID [2022-02-20 23:58:47,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {5381#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_create_~head~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 {5381#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:47,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {5381#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {5381#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:47,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {5495#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|))))} 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; {5381#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:47,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {5499#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (and (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 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; {5495#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|)) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|))))} is VALID [2022-02-20 23:58:47,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {5499#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (and (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0))))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {5499#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (and (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0))))} is VALID [2022-02-20 23:58:47,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {5499#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (and (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 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 {5499#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (and (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0))))} is VALID [2022-02-20 23:58:47,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {5499#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (and (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 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 {5499#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (and (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0))))} is VALID [2022-02-20 23:58:47,186 INFO L290 TraceCheckUtils]: 4: Hoare triple {5499#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (and (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 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 {5499#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (and (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0))))} is VALID [2022-02-20 23:58:47,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {5499#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (and (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0))))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {5499#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (and (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0))))} is VALID [2022-02-20 23:58:47,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {5335#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; {5499#(forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (and (<= 0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0))))} is VALID [2022-02-20 23:58:47,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {5335#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {5335#true} is VALID [2022-02-20 23:58:47,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {5335#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); {5335#true} is VALID [2022-02-20 23:58:47,188 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:47,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583039694] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:47,188 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:47,188 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 35 [2022-02-20 23:58:47,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702939585] [2022-02-20 23:58:47,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:47,190 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 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) Word has length 26 [2022-02-20 23:58:47,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:47,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 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:47,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:47,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-20 23:58:47,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:47,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-20 23:58:47,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1031, Unknown=2, NotChecked=130, Total=1260 [2022-02-20 23:58:47,261 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 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:50,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:50,712 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-02-20 23:58:50,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 23:58:50,713 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 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) Word has length 26 [2022-02-20 23:58:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 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:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 126 transitions. [2022-02-20 23:58:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 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:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 126 transitions. [2022-02-20 23:58:50,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 126 transitions. [2022-02-20 23:58:50,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:50,878 INFO L225 Difference]: With dead ends: 130 [2022-02-20 23:58:50,878 INFO L226 Difference]: Without dead ends: 130 [2022-02-20 23:58:50,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=311, Invalid=2145, Unknown=2, NotChecked=194, Total=2652 [2022-02-20 23:58:50,880 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 761 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 325 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:50,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 759 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 729 Invalid, 0 Unknown, 325 Unchecked, 0.8s Time] [2022-02-20 23:58:50,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-20 23:58:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2022-02-20 23:58:50,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:50,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 77 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 76 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:50,882 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 77 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 76 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:50,882 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 77 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 76 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:50,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:50,884 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-02-20 23:58:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-02-20 23:58:50,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:50,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:50,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 76 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) Second operand 130 states. [2022-02-20 23:58:50,885 INFO L87 Difference]: Start difference. First operand has 77 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 76 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) Second operand 130 states. [2022-02-20 23:58:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:50,886 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-02-20 23:58:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-02-20 23:58:50,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:50,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:50,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:50,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 76 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:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-02-20 23:58:50,888 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 26 [2022-02-20 23:58:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:50,889 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-02-20 23:58:50,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 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:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-02-20 23:58:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:58:50,890 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:50,890 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:50,909 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:51,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-20 23:58:51,104 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:51,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:51,104 INFO L85 PathProgramCache]: Analyzing trace with hash -709592258, now seen corresponding path program 1 times [2022-02-20 23:58:51,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:51,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720805487] [2022-02-20 23:58:51,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:51,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:51,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {6024#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); {6024#true} is VALID [2022-02-20 23:58:51,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {6024#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {6024#true} is VALID [2022-02-20 23:58:51,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {6024#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; {6024#true} is VALID [2022-02-20 23:58:51,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {6024#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6024#true} is VALID [2022-02-20 23:58:51,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {6024#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 {6024#true} is VALID [2022-02-20 23:58:51,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {6024#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 {6024#true} is VALID [2022-02-20 23:58:51,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {6024#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 {6024#true} is VALID [2022-02-20 23:58:51,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {6024#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {6024#true} is VALID [2022-02-20 23:58:51,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {6024#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; {6024#true} is VALID [2022-02-20 23:58:51,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {6024#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; {6024#true} is VALID [2022-02-20 23:58:51,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {6024#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6024#true} is VALID [2022-02-20 23:58:51,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {6024#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 {6026#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {6026#(= (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 {6026#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {6026#(= (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 {6026#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {6026#(= (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; {6026#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {6026#(= (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 {6026#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {6026#(= (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; {6027#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {6027#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !(dll_create_~len#1 > 0); {6027#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {6027#(= (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; {6028#(= (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) 1)} is VALID [2022-02-20 23:58:51,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {6028#(= (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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !(dll_update_at_~index#1 > 0); {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume { :end_inline_dll_update_at } true; {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {6029#(= (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; {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !(main_~i~0#1 >= 0); {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} main_~i~0#1 := main_~len~0#1 - 1; {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !(main_~i~0#1 <= 0); {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:58:51,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {6029#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume { :begin_inline_dll_destroy } true;dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset, dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset, dll_destroy_~head#1.base, dll_destroy_~head#1.offset;dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset; {6030#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} is VALID [2022-02-20 23:58:51,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {6030#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} assume !!(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {6030#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} is VALID [2022-02-20 23:58:51,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {6030#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} assume !(1 == #valid[dll_destroy_~head#1.base]); {6025#false} is VALID [2022-02-20 23:58:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:58:51,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:51,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720805487] [2022-02-20 23:58:51,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720805487] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:51,182 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:51,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:58:51,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381876561] [2022-02-20 23:58:51,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:51,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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 31 [2022-02-20 23:58:51,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:51,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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:51,198 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:51,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:58:51,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:51,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:58:51,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:51,200 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:51,414 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-02-20 23:58:51,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:58:51,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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 31 [2022-02-20 23:58:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-02-20 23:58:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-02-20 23:58:51,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-02-20 23:58:51,469 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:51,469 INFO L225 Difference]: With dead ends: 88 [2022-02-20 23:58:51,469 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 23:58:51,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:58:51,470 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 122 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:51,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 63 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 23:58:51,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2022-02-20 23:58:51,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:51,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 78 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 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:51,472 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 78 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 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:51,472 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 78 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 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:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:51,473 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-02-20 23:58:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-02-20 23:58:51,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:51,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:51,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 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 88 states. [2022-02-20 23:58:51,475 INFO L87 Difference]: Start difference. First operand has 78 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 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 88 states. [2022-02-20 23:58:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:51,477 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-02-20 23:58:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-02-20 23:58:51,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:51,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:51,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:51,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 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:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2022-02-20 23:58:51,478 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 31 [2022-02-20 23:58:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:51,479 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2022-02-20 23:58:51,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-02-20 23:58:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:58:51,480 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:51,480 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:51,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:58:51,480 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:51,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:51,481 INFO L85 PathProgramCache]: Analyzing trace with hash -709592257, now seen corresponding path program 1 times [2022-02-20 23:58:51,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:51,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311602653] [2022-02-20 23:58:51,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:51,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:51,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {6384#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); {6384#true} is VALID [2022-02-20 23:58:51,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {6384#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {6386#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:51,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {6386#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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; {6386#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:51,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {6386#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6386#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:51,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {6386#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {6386#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:51,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {6386#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {6386#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:51,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {6386#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {6386#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:51,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {6386#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {6386#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:51,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {6386#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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; {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {6387#(<= 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; {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {6387#(<= 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 {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {6387#(<= 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 {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {6387#(<= 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 {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {6387#(<= 2 |ULTIMATE.start_main_~len~0#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 {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {6387#(<= 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; {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {6387#(<= 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; {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {6387#(<= 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {6388#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:51,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {6388#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {6388#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:51,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {6388#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(dll_update_at_~index#1 > 0); {6388#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:51,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {6388#(<= 1 |ULTIMATE.start_main_~i~0#1|)} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {6388#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:51,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {6388#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_dll_update_at } true; {6388#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:51,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {6388#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {6389#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:51,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {6389#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {6385#false} is VALID [2022-02-20 23:58:51,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {6385#false} main_~i~0#1 := main_~len~0#1 - 1; {6385#false} is VALID [2022-02-20 23:58:51,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {6385#false} assume !(main_~i~0#1 <= 0); {6385#false} is VALID [2022-02-20 23:58:51,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {6385#false} assume { :begin_inline_dll_destroy } true;dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset, dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset, dll_destroy_~head#1.base, dll_destroy_~head#1.offset;dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset; {6385#false} is VALID [2022-02-20 23:58:51,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {6385#false} assume !!(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {6385#false} is VALID [2022-02-20 23:58:51,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {6385#false} assume !(4 + (4 + dll_destroy_~head#1.offset) <= #length[dll_destroy_~head#1.base] && 0 <= 4 + dll_destroy_~head#1.offset); {6385#false} is VALID [2022-02-20 23:58:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:51,546 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:51,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311602653] [2022-02-20 23:58:51,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311602653] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:51,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034513778] [2022-02-20 23:58:51,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:51,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:51,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:51,547 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:51,549 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:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:51,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:58:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:51,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:51,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {6384#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); {6384#true} is VALID [2022-02-20 23:58:51,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {6384#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {6387#(<= 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; {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {6387#(<= 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 {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {6387#(<= 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 {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {6387#(<= 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 {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {6387#(<= 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; {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {6387#(<= 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; {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {6387#(<= 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 {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {6387#(<= 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 {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {6387#(<= 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 {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {6387#(<= 2 |ULTIMATE.start_main_~len~0#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 {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {6387#(<= 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; {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {6387#(<= 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; {6387#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:51,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {6387#(<= 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {6388#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:51,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {6388#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {6453#(<= 1 |ULTIMATE.start_dll_update_at_~index#1|)} is VALID [2022-02-20 23:58:51,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {6453#(<= 1 |ULTIMATE.start_dll_update_at_~index#1|)} assume !(dll_update_at_~index#1 > 0); {6385#false} is VALID [2022-02-20 23:58:51,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {6385#false} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {6385#false} is VALID [2022-02-20 23:58:51,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {6385#false} assume { :end_inline_dll_update_at } true; {6385#false} is VALID [2022-02-20 23:58:51,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {6385#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {6385#false} is VALID [2022-02-20 23:58:51,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {6385#false} assume !(main_~i~0#1 >= 0); {6385#false} is VALID [2022-02-20 23:58:51,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {6385#false} main_~i~0#1 := main_~len~0#1 - 1; {6385#false} is VALID [2022-02-20 23:58:51,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {6385#false} assume !(main_~i~0#1 <= 0); {6385#false} is VALID [2022-02-20 23:58:51,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {6385#false} assume { :begin_inline_dll_destroy } true;dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset, dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset, dll_destroy_~head#1.base, dll_destroy_~head#1.offset;dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset; {6385#false} is VALID [2022-02-20 23:58:51,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {6385#false} assume !!(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {6385#false} is VALID [2022-02-20 23:58:51,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {6385#false} assume !(4 + (4 + dll_destroy_~head#1.offset) <= #length[dll_destroy_~head#1.base] && 0 <= 4 + dll_destroy_~head#1.offset); {6385#false} is VALID [2022-02-20 23:58:51,772 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:58:51,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:51,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034513778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:51,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:58:51,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 23:58:51,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876375274] [2022-02-20 23:58:51,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:51,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:51,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:51,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:51,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:51,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:58:51,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:51,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:58:51,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:51,803 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:51,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:51,902 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-02-20 23:58:51,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:58:51,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:51,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-02-20 23:58:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-02-20 23:58:51,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2022-02-20 23:58:51,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:51,952 INFO L225 Difference]: With dead ends: 86 [2022-02-20 23:58:51,952 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 23:58:51,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:58:51,952 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 61 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:51,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 86 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 23:58:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2022-02-20 23:58:51,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:51,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 75 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 74 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:51,961 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 75 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 74 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:51,961 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 75 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 74 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:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:51,962 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-02-20 23:58:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2022-02-20 23:58:51,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:51,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:51,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 74 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 86 states. [2022-02-20 23:58:51,963 INFO L87 Difference]: Start difference. First operand has 75 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 74 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 86 states. [2022-02-20 23:58:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:51,963 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-02-20 23:58:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2022-02-20 23:58:51,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:51,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:51,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:51,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:51,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 74 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:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-02-20 23:58:51,965 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 31 [2022-02-20 23:58:51,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:51,965 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-02-20 23:58:51,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-02-20 23:58:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:58:51,965 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:51,965 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:51,982 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:52,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-20 23:58:52,167 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:52,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:52,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1698966507, now seen corresponding path program 2 times [2022-02-20 23:58:52,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:52,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209505887] [2022-02-20 23:58:52,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:52,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:52,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {6822#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); {6822#true} is VALID [2022-02-20 23:58:52,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {6822#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {6824#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:52,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {6824#(= (+ (- 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; {6824#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:52,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {6824#(= (+ (- 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); {6824#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:52,223 INFO L290 TraceCheckUtils]: 4: Hoare triple {6824#(= (+ (- 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 {6824#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:52,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {6824#(= (+ (- 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 {6824#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:52,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {6824#(= (+ (- 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 {6824#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:52,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {6824#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {6824#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:58:52,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {6824#(= (+ (- 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; {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 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; {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 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 {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 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 {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 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 {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 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 {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 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; {6826#(<= |ULTIMATE.start_dll_create_~len#1| 0)} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {6826#(<= |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; {6823#false} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {6823#false} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6823#false} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {6823#false} 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 {6823#false} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {6823#false} 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 {6823#false} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {6823#false} 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 {6823#false} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {6823#false} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {6823#false} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {6823#false} 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 {6823#false} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {6823#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; {6823#false} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {6823#false} assume !(dll_create_~len#1 > 0); {6823#false} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {6823#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {6823#false} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {6823#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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {6823#false} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {6823#false} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {6823#false} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {6823#false} assume !!(dll_update_at_~index#1 > 0); {6823#false} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {6823#false} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {6823#false} is VALID [2022-02-20 23:58:52,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {6823#false} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {6823#false} is VALID [2022-02-20 23:58:52,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {6823#false} assume !(dll_update_at_~index#1 > 0); {6823#false} is VALID [2022-02-20 23:58:52,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {6823#false} assume !(1 == #valid[dll_update_at_~head#1.base]); {6823#false} is VALID [2022-02-20 23:58:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:52,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:52,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209505887] [2022-02-20 23:58:52,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209505887] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:52,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996618594] [2022-02-20 23:58:52,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:58:52,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:52,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:52,229 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:52,255 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:52,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:58:52,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:58:52,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:58:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:52,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:52,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {6822#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); {6822#true} is VALID [2022-02-20 23:58:52,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {6822#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {6833#(<= |ULTIMATE.start_dll_create_~len#1| 2)} is VALID [2022-02-20 23:58:52,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {6833#(<= |ULTIMATE.start_dll_create_~len#1| 2)} 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; {6833#(<= |ULTIMATE.start_dll_create_~len#1| 2)} is VALID [2022-02-20 23:58:52,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {6833#(<= |ULTIMATE.start_dll_create_~len#1| 2)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6833#(<= |ULTIMATE.start_dll_create_~len#1| 2)} is VALID [2022-02-20 23:58:52,452 INFO L290 TraceCheckUtils]: 4: Hoare triple {6833#(<= |ULTIMATE.start_dll_create_~len#1| 2)} 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 {6833#(<= |ULTIMATE.start_dll_create_~len#1| 2)} is VALID [2022-02-20 23:58:52,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {6833#(<= |ULTIMATE.start_dll_create_~len#1| 2)} 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 {6833#(<= |ULTIMATE.start_dll_create_~len#1| 2)} is VALID [2022-02-20 23:58:52,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {6833#(<= |ULTIMATE.start_dll_create_~len#1| 2)} 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 {6833#(<= |ULTIMATE.start_dll_create_~len#1| 2)} is VALID [2022-02-20 23:58:52,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {6833#(<= |ULTIMATE.start_dll_create_~len#1| 2)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {6833#(<= |ULTIMATE.start_dll_create_~len#1| 2)} is VALID [2022-02-20 23:58:52,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {6833#(<= |ULTIMATE.start_dll_create_~len#1| 2)} 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; {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 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; {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 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 {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 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 {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 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 {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 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 {6825#(<= |ULTIMATE.start_dll_create_~len#1| 1)} is VALID [2022-02-20 23:58:52,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {6825#(<= |ULTIMATE.start_dll_create_~len#1| 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; {6826#(<= |ULTIMATE.start_dll_create_~len#1| 0)} is VALID [2022-02-20 23:58:52,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {6826#(<= |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; {6823#false} is VALID [2022-02-20 23:58:52,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {6823#false} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {6823#false} is VALID [2022-02-20 23:58:52,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {6823#false} 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 {6823#false} is VALID [2022-02-20 23:58:52,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {6823#false} 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 {6823#false} is VALID [2022-02-20 23:58:52,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {6823#false} 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 {6823#false} is VALID [2022-02-20 23:58:52,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {6823#false} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {6823#false} is VALID [2022-02-20 23:58:52,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {6823#false} 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 {6823#false} is VALID [2022-02-20 23:58:52,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {6823#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; {6823#false} is VALID [2022-02-20 23:58:52,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {6823#false} assume !(dll_create_~len#1 > 0); {6823#false} is VALID [2022-02-20 23:58:52,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {6823#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {6823#false} is VALID [2022-02-20 23:58:52,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {6823#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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {6823#false} is VALID [2022-02-20 23:58:52,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {6823#false} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {6823#false} is VALID [2022-02-20 23:58:52,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {6823#false} assume !!(dll_update_at_~index#1 > 0); {6823#false} is VALID [2022-02-20 23:58:52,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {6823#false} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {6823#false} is VALID [2022-02-20 23:58:52,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {6823#false} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {6823#false} is VALID [2022-02-20 23:58:52,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {6823#false} assume !(dll_update_at_~index#1 > 0); {6823#false} is VALID [2022-02-20 23:58:52,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {6823#false} assume !(1 == #valid[dll_update_at_~head#1.base]); {6823#false} is VALID [2022-02-20 23:58:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:52,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:52,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996618594] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:52,458 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:58:52,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-02-20 23:58:52,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619607287] [2022-02-20 23:58:52,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:52,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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:58:52,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:52,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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:52,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:52,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:58:52,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:52,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:58:52,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:58:52,481 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:52,526 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-02-20 23:58:52,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:58:52,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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:58:52,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 23:58:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 23:58:52,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-02-20 23:58:52,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:52,562 INFO L225 Difference]: With dead ends: 53 [2022-02-20 23:58:52,562 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 23:58:52,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:58:52,562 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 60 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 54 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:52,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 54 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:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 23:58:52,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-02-20 23:58:52,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:52,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 52 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:58:52,564 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 52 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:58:52,564 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 52 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:58:52,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:52,564 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-02-20 23:58:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-02-20 23:58:52,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:52,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:52,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 52 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) Second operand 53 states. [2022-02-20 23:58:52,565 INFO L87 Difference]: Start difference. First operand has 53 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 52 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) Second operand 53 states. [2022-02-20 23:58:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:52,565 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-02-20 23:58:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-02-20 23:58:52,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:52,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:52,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:52,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 52 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:58:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-02-20 23:58:52,566 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 34 [2022-02-20 23:58:52,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:52,566 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-02-20 23:58:52,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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:52,567 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-02-20 23:58:52,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:58:52,567 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:52,567 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, 1] [2022-02-20 23:58:52,599 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:58:52,779 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,SelfDestructingSolverStorable17 [2022-02-20 23:58:52,779 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:52,780 INFO L85 PathProgramCache]: Analyzing trace with hash -674776797, now seen corresponding path program 1 times [2022-02-20 23:58:52,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:52,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118887860] [2022-02-20 23:58:52,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:52,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:52,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {7141#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); {7141#true} is VALID [2022-02-20 23:58:52,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {7141#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {7143#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:52,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {7143#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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; {7143#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:52,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {7143#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7143#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:52,847 INFO L290 TraceCheckUtils]: 4: Hoare triple {7143#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {7143#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:52,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {7143#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {7143#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:52,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {7143#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {7143#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:52,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {7143#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {7143#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:52,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {7143#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:52,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {7144#(<= 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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:52,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:52,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:52,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:52,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:52,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:52,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:52,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {7144#(<= 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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:52,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:52,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {7144#(<= 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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:52,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {7144#(<= 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:52,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:52,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(dll_update_at_~index#1 > 0); {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:52,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:52,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:52,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(dll_update_at_~index#1 > 0); {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:52,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:52,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_dll_update_at } true; {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:52,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {7146#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:52,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {7146#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {7142#false} is VALID [2022-02-20 23:58:52,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {7142#false} main_~i~0#1 := main_~len~0#1 - 1; {7142#false} is VALID [2022-02-20 23:58:52,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {7142#false} assume !(main_~i~0#1 <= 0); {7142#false} is VALID [2022-02-20 23:58:52,854 INFO L290 TraceCheckUtils]: 31: Hoare triple {7142#false} assume { :begin_inline_dll_destroy } true;dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset, dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset, dll_destroy_~head#1.base, dll_destroy_~head#1.offset;dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset; {7142#false} is VALID [2022-02-20 23:58:52,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {7142#false} assume !!(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {7142#false} is VALID [2022-02-20 23:58:52,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {7142#false} assume !(4 + (4 + dll_destroy_~head#1.offset) <= #length[dll_destroy_~head#1.base] && 0 <= 4 + dll_destroy_~head#1.offset); {7142#false} is VALID [2022-02-20 23:58:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:58:52,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:52,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118887860] [2022-02-20 23:58:52,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118887860] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:52,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187047305] [2022-02-20 23:58:52,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:52,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:52,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:52,855 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:58:52,856 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:58:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:52,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:58:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:52,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:53,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {7141#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); {7141#true} is VALID [2022-02-20 23:58:53,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {7141#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {7144#(<= 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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {7144#(<= 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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {7144#(<= 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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {7144#(<= 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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {7144#(<= 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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {7144#(<= 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(dll_update_at_~index#1 > 0); {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(dll_update_at_~index#1 > 0); {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_dll_update_at } true; {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {7146#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {7146#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {7142#false} is VALID [2022-02-20 23:58:53,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {7142#false} main_~i~0#1 := main_~len~0#1 - 1; {7142#false} is VALID [2022-02-20 23:58:53,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {7142#false} assume !(main_~i~0#1 <= 0); {7142#false} is VALID [2022-02-20 23:58:53,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {7142#false} assume { :begin_inline_dll_destroy } true;dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset, dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset, dll_destroy_~head#1.base, dll_destroy_~head#1.offset;dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset; {7142#false} is VALID [2022-02-20 23:58:53,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {7142#false} assume !!(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {7142#false} is VALID [2022-02-20 23:58:53,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {7142#false} assume !(4 + (4 + dll_destroy_~head#1.offset) <= #length[dll_destroy_~head#1.base] && 0 <= 4 + dll_destroy_~head#1.offset); {7142#false} is VALID [2022-02-20 23:58:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:58:53,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:53,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {7142#false} assume !(4 + (4 + dll_destroy_~head#1.offset) <= #length[dll_destroy_~head#1.base] && 0 <= 4 + dll_destroy_~head#1.offset); {7142#false} is VALID [2022-02-20 23:58:53,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {7142#false} assume !!(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {7142#false} is VALID [2022-02-20 23:58:53,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {7142#false} assume { :begin_inline_dll_destroy } true;dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset, dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset, dll_destroy_~head#1.base, dll_destroy_~head#1.offset;dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset; {7142#false} is VALID [2022-02-20 23:58:53,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {7142#false} assume !(main_~i~0#1 <= 0); {7142#false} is VALID [2022-02-20 23:58:53,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {7142#false} main_~i~0#1 := main_~len~0#1 - 1; {7142#false} is VALID [2022-02-20 23:58:53,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {7146#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {7142#false} is VALID [2022-02-20 23:58:53,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {7146#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_dll_update_at } true; {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(dll_update_at_~index#1 > 0); {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(dll_update_at_~index#1 > 0); {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {7144#(<= 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {7145#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:58:53,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {7144#(<= 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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {7144#(<= 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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {7144#(<= 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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {7144#(<= 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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {7144#(<= 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 {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {7144#(<= 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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {7141#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {7144#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:58:53,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {7141#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); {7141#true} is VALID [2022-02-20 23:58:53,239 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:58:53,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187047305] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:53,239 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:53,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-02-20 23:58:53,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871052040] [2022-02-20 23:58:53,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:53,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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:58:53,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:53,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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:53,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:53,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:58:53,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:53,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:58:53,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:58:53,263 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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:53,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:53,351 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-02-20 23:58:53,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:58:53,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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:58:53,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-20 23:58:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-20 23:58:53,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-02-20 23:58:53,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:53,392 INFO L225 Difference]: With dead ends: 57 [2022-02-20 23:58:53,392 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 23:58:53,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:58:53,393 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 64 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:53,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 91 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:53,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 23:58:53,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-02-20 23:58:53,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:53,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 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:53,394 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 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:53,394 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 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:53,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:53,395 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-02-20 23:58:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-02-20 23:58:53,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:53,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:53,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 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 57 states. [2022-02-20 23:58:53,395 INFO L87 Difference]: Start difference. First operand has 57 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 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 57 states. [2022-02-20 23:58:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:53,396 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-02-20 23:58:53,396 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-02-20 23:58:53,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:53,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:53,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:53,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 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:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-02-20 23:58:53,403 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2022-02-20 23:58:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:53,404 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-02-20 23:58:53,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-02-20 23:58:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:58:53,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:53,404 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:53,421 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:58:53,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:53,615 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash -634882153, now seen corresponding path program 1 times [2022-02-20 23:58:53,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:53,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832021896] [2022-02-20 23:58:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:53,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {7579#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); {7579#true} is VALID [2022-02-20 23:58:53,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {7579#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {7581#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:53,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {7581#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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; {7581#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:53,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {7581#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7581#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:53,670 INFO L290 TraceCheckUtils]: 4: Hoare triple {7581#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {7581#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:53,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {7581#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {7581#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:53,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {7581#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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 {7581#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:53,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {7581#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {7581#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 23:58:53,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {7581#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |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; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(dll_create_~len#1 > 0); {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(dll_update_at_~index#1 > 0); {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(dll_update_at_~index#1 > 0); {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume { :end_inline_dll_update_at } true; {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {7584#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:58:53,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {7584#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {7585#(<= |ULTIMATE.start_dll_update_at_~index#1| 0)} is VALID [2022-02-20 23:58:53,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {7585#(<= |ULTIMATE.start_dll_update_at_~index#1| 0)} assume !!(dll_update_at_~index#1 > 0); {7580#false} is VALID [2022-02-20 23:58:53,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {7580#false} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {7580#false} is VALID [2022-02-20 23:58:53,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {7580#false} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {7580#false} is VALID [2022-02-20 23:58:53,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {7580#false} assume !(dll_update_at_~index#1 > 0); {7580#false} is VALID [2022-02-20 23:58:53,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {7580#false} assume !(1 == #valid[dll_update_at_~head#1.base]); {7580#false} is VALID [2022-02-20 23:58:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:58:53,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:53,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832021896] [2022-02-20 23:58:53,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832021896] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:53,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099250112] [2022-02-20 23:58:53,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:53,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:53,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:53,681 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:58:53,682 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:58:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:53,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:58:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:53,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:53,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {7579#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); {7579#true} is VALID [2022-02-20 23:58:53,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {7579#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(dll_create_~len#1 > 0); {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:53,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(dll_update_at_~index#1 > 0); {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(dll_update_at_~index#1 > 0); {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume { :end_inline_dll_update_at } true; {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:53,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {7584#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:58:53,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {7584#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {7585#(<= |ULTIMATE.start_dll_update_at_~index#1| 0)} is VALID [2022-02-20 23:58:53,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {7585#(<= |ULTIMATE.start_dll_update_at_~index#1| 0)} assume !!(dll_update_at_~index#1 > 0); {7580#false} is VALID [2022-02-20 23:58:53,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {7580#false} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {7580#false} is VALID [2022-02-20 23:58:53,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {7580#false} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {7580#false} is VALID [2022-02-20 23:58:53,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {7580#false} assume !(dll_update_at_~index#1 > 0); {7580#false} is VALID [2022-02-20 23:58:53,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {7580#false} assume !(1 == #valid[dll_update_at_~head#1.base]); {7580#false} is VALID [2022-02-20 23:58:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:58:53,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:54,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {7580#false} assume !(1 == #valid[dll_update_at_~head#1.base]); {7580#false} is VALID [2022-02-20 23:58:54,079 INFO L290 TraceCheckUtils]: 32: Hoare triple {7580#false} assume !(dll_update_at_~index#1 > 0); {7580#false} is VALID [2022-02-20 23:58:54,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {7580#false} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {7580#false} is VALID [2022-02-20 23:58:54,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {7580#false} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {7580#false} is VALID [2022-02-20 23:58:54,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {7585#(<= |ULTIMATE.start_dll_update_at_~index#1| 0)} assume !!(dll_update_at_~index#1 > 0); {7580#false} is VALID [2022-02-20 23:58:54,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {7584#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {7585#(<= |ULTIMATE.start_dll_update_at_~index#1| 0)} is VALID [2022-02-20 23:58:54,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {7584#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:58:54,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume { :end_inline_dll_update_at } true; {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:54,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:54,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(dll_update_at_~index#1 > 0); {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:54,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:54,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:54,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(dll_update_at_~index#1 > 0); {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:54,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:54,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {7583#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:58:54,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(dll_create_~len#1 > 0); {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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 {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} 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; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {7579#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {7582#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:58:54,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {7579#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); {7579#true} is VALID [2022-02-20 23:58:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:58:54,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099250112] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:54,090 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:58:54,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-02-20 23:58:54,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712918572] [2022-02-20 23:58:54,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:54,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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:58:54,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:54,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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:54,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:54,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:58:54,115 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:54,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:58:54,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:54,116 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:54,255 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-02-20 23:58:54,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:58:54,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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:58:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-02-20 23:58:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-02-20 23:58:54,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2022-02-20 23:58:54,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:54,293 INFO L225 Difference]: With dead ends: 52 [2022-02-20 23:58:54,293 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 23:58:54,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:58:54,294 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 62 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:54,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 106 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 23:58:54,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-02-20 23:58:54,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:54,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 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:54,295 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 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:54,295 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 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:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:54,296 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-02-20 23:58:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-02-20 23:58:54,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:54,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:54,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 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 52 states. [2022-02-20 23:58:54,296 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 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 52 states. [2022-02-20 23:58:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:54,297 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-02-20 23:58:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-02-20 23:58:54,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:54,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:54,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:54,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 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:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-02-20 23:58:54,298 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 34 [2022-02-20 23:58:54,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:54,298 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-02-20 23:58:54,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-02-20 23:58:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 23:58:54,298 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:54,298 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:54,334 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:58:54,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:54,511 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash -427165145, now seen corresponding path program 2 times [2022-02-20 23:58:54,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:54,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877020114] [2022-02-20 23:58:54,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:54,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:54,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {8000#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); {8000#true} is VALID [2022-02-20 23:58:54,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {8000#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {8000#true} is VALID [2022-02-20 23:58:54,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {8000#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; {8000#true} is VALID [2022-02-20 23:58:54,604 INFO L290 TraceCheckUtils]: 3: Hoare triple {8000#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {8000#true} is VALID [2022-02-20 23:58:54,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {8000#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 {8000#true} is VALID [2022-02-20 23:58:54,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {8000#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 {8000#true} is VALID [2022-02-20 23:58:54,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {8000#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 {8000#true} is VALID [2022-02-20 23:58:54,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {8000#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {8000#true} is VALID [2022-02-20 23:58:54,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {8000#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; {8000#true} is VALID [2022-02-20 23:58:54,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {8000#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; {8002#(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:54,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {8002#(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); {8002#(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:54,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {8002#(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 {8002#(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:54,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {8002#(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 {8002#(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:54,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {8002#(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 {8002#(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:54,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {8002#(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; {8002#(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:54,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {8002#(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 {8002#(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:54,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {8002#(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; {8003#(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:54,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {8003#(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); {8003#(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:54,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {8003#(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; {8004#(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:54,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {8004#(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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(dll_update_at_~index#1 > 0); {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(dll_update_at_~index#1 > 0); {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_dll_update_at } true; {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {8005#(and (= 12 (select |#length| |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; {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(dll_update_at_~index#1 > 0); {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_dll_update_at } true; {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {8005#(and (= 12 (select |#length| |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; {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_~i~0#1 >= 0); {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_~i~0#1 := main_~len~0#1 - 1; {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_~i~0#1 <= 0); {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:54,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {8005#(and (= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :begin_inline_dll_destroy } true;dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset, dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset, dll_destroy_~head#1.base, dll_destroy_~head#1.offset;dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset; {8006#(and (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_destroy_~head#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:58:54,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {8006#(and (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_destroy_~head#1.base|) (- 12)) 0))} assume !!(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {8006#(and (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_destroy_~head#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:58:54,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {8006#(and (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_destroy_~head#1.base|) (- 12)) 0))} assume !(4 + (4 + dll_destroy_~head#1.offset) <= #length[dll_destroy_~head#1.base] && 0 <= 4 + dll_destroy_~head#1.offset); {8001#false} is VALID [2022-02-20 23:58:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:58:54,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:54,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877020114] [2022-02-20 23:58:54,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877020114] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:54,619 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:54,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:58:54,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577280775] [2022-02-20 23:58:54,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:54,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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 39 [2022-02-20 23:58:54,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:54,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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:54,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:54,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:58:54,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:54,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:58:54,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:54,644 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:54,914 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-02-20 23:58:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:58:54,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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 39 [2022-02-20 23:58:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-02-20 23:58:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-02-20 23:58:54,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2022-02-20 23:58:54,962 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:54,962 INFO L225 Difference]: With dead ends: 60 [2022-02-20 23:58:54,962 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 23:58:54,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:58:54,963 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 147 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:54,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 36 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 23:58:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-02-20 23:58:54,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:54,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 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:54,967 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 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:54,967 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 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:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:54,968 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-02-20 23:58:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-02-20 23:58:54,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:54,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:54,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 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 60 states. [2022-02-20 23:58:54,968 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 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 60 states. [2022-02-20 23:58:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:54,969 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-02-20 23:58:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-02-20 23:58:54,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:54,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:54,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:54,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 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:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-02-20 23:58:54,970 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 39 [2022-02-20 23:58:54,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:54,970 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-02-20 23:58:54,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-02-20 23:58:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 23:58:54,971 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:54,971 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:54,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 23:58:54,972 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash -357219036, now seen corresponding path program 1 times [2022-02-20 23:58:54,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:54,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592772542] [2022-02-20 23:58:54,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:54,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:55,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {8252#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); {8252#true} is VALID [2022-02-20 23:58:55,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {8252#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {8252#true} is VALID [2022-02-20 23:58:55,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {8252#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; {8252#true} is VALID [2022-02-20 23:58:55,062 INFO L290 TraceCheckUtils]: 3: Hoare triple {8252#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {8252#true} is VALID [2022-02-20 23:58:55,062 INFO L290 TraceCheckUtils]: 4: Hoare triple {8252#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 {8252#true} is VALID [2022-02-20 23:58:55,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {8252#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 {8252#true} is VALID [2022-02-20 23:58:55,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {8252#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 {8252#true} is VALID [2022-02-20 23:58:55,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {8252#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {8252#true} is VALID [2022-02-20 23:58:55,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {8252#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; {8252#true} is VALID [2022-02-20 23:58:55,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {8252#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; {8254#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:55,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {8254#(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); {8254#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:55,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {8254#(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 {8254#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:55,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {8254#(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 {8254#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:55,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {8254#(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 {8254#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:55,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {8254#(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; {8254#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:55,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {8254#(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 {8254#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:58:55,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {8254#(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; {8255#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:55,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {8255#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !(dll_create_~len#1 > 0); {8255#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:58:55,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {8255#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {8256#(not (= |ULTIMATE.start_dll_create_#res#1.base| 0))} is VALID [2022-02-20 23:58:55,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {8256#(not (= |ULTIMATE.start_dll_create_#res#1.base| 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} assume !!(dll_update_at_~index#1 > 0); {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} assume !(dll_update_at_~index#1 > 0); {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} assume { :end_inline_dll_update_at } true; {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} assume !(dll_update_at_~index#1 > 0); {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} assume { :end_inline_dll_update_at } true; {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} assume !(main_~i~0#1 >= 0); {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} main_~i~0#1 := main_~len~0#1 - 1; {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} assume !(main_~i~0#1 <= 0); {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:58:55,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {8257#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} assume { :begin_inline_dll_destroy } true;dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset, dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset, dll_destroy_~head#1.base, dll_destroy_~head#1.offset;dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset; {8258#(not (= |ULTIMATE.start_dll_destroy_~head#1.base| 0))} is VALID [2022-02-20 23:58:55,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {8258#(not (= |ULTIMATE.start_dll_destroy_~head#1.base| 0))} assume !(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {8253#false} is VALID [2022-02-20 23:58:55,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {8253#false} assume { :end_inline_dll_destroy } true;main_#res#1 := 0; {8253#false} is VALID [2022-02-20 23:58:55,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {8253#false} assume !(#valid == main_old_#valid#1); {8253#false} is VALID [2022-02-20 23:58:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:58:55,072 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:55,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592772542] [2022-02-20 23:58:55,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592772542] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:55,073 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:55,073 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:58:55,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83138409] [2022-02-20 23:58:55,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:55,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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 40 [2022-02-20 23:58:55,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:55,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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:55,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:55,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:58:55,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:55,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:58:55,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:55,098 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:55,279 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-02-20 23:58:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:58:55,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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 40 [2022-02-20 23:58:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-02-20 23:58:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-02-20 23:58:55,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-02-20 23:58:55,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:55,322 INFO L225 Difference]: With dead ends: 57 [2022-02-20 23:58:55,322 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 23:58:55,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:58:55,324 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 134 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:55,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 58 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:55,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 23:58:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2022-02-20 23:58:55,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:55,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 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:55,326 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 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:55,326 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 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:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:55,326 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-02-20 23:58:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-02-20 23:58:55,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:55,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:55,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 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 57 states. [2022-02-20 23:58:55,327 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 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 57 states. [2022-02-20 23:58:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:55,328 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-02-20 23:58:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-02-20 23:58:55,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:55,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:55,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:55,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 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:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-02-20 23:58:55,329 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 40 [2022-02-20 23:58:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:55,329 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-02-20 23:58:55,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-02-20 23:58:55,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 23:58:55,330 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:55,330 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:55,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 23:58:55,330 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:55,333 INFO L85 PathProgramCache]: Analyzing trace with hash 311339877, now seen corresponding path program 1 times [2022-02-20 23:58:55,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:55,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353623270] [2022-02-20 23:58:55,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:55,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:55,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {8495#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); {8495#true} is VALID [2022-02-20 23:58:55,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {8495#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {8495#true} is VALID [2022-02-20 23:58:55,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {8495#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; {8495#true} is VALID [2022-02-20 23:58:55,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {8495#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {8495#true} is VALID [2022-02-20 23:58:55,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {8495#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 {8495#true} is VALID [2022-02-20 23:58:55,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {8495#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 {8495#true} is VALID [2022-02-20 23:58:55,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {8495#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 {8495#true} is VALID [2022-02-20 23:58:55,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {8495#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {8495#true} is VALID [2022-02-20 23:58:55,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {8495#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; {8495#true} is VALID [2022-02-20 23:58:55,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {8495#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; {8497#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {8497#(<= (+ |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); {8497#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {8497#(<= (+ |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 {8497#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {8497#(<= (+ |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 {8497#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {8497#(<= (+ |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 {8497#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {8497#(<= (+ |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; {8497#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {8497#(<= (+ |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 {8497#(<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {8497#(<= (+ |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; {8498#(<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {8498#(<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} assume !(dll_create_~len#1 > 0); {8498#(<= (+ |ULTIMATE.start_dll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {8498#(<= (+ |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; {8499#(<= (+ |ULTIMATE.start_dll_create_#res#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {8499#(<= (+ |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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} assume !!(dll_update_at_~index#1 > 0); {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} assume !(dll_update_at_~index#1 > 0); {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} assume { :end_inline_dll_update_at } true; {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} assume !(dll_update_at_~index#1 > 0); {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} assume { :end_inline_dll_update_at } true; {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~i~0#1 >= 0); {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} main_~i~0#1 := main_~len~0#1 - 1; {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~i~0#1 <= 0); {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {8500#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} assume { :begin_inline_dll_destroy } true;dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset, dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset, dll_destroy_~head#1.base, dll_destroy_~head#1.offset;dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset; {8501#(<= (+ |ULTIMATE.start_dll_destroy_~head#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {8501#(<= (+ |ULTIMATE.start_dll_destroy_~head#1.base| 1) |#StackHeapBarrier|)} assume !!(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {8501#(<= (+ |ULTIMATE.start_dll_destroy_~head#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {8501#(<= (+ |ULTIMATE.start_dll_destroy_~head#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset := read~$Pointer$(dll_destroy_~head#1.base, 4 + dll_destroy_~head#1.offset, 4); srcloc: L605 {8501#(<= (+ |ULTIMATE.start_dll_destroy_~head#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {8501#(<= (+ |ULTIMATE.start_dll_destroy_~head#1.base| 1) |#StackHeapBarrier|)} dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset := dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset; {8501#(<= (+ |ULTIMATE.start_dll_destroy_~head#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,429 INFO L290 TraceCheckUtils]: 40: Hoare triple {8501#(<= (+ |ULTIMATE.start_dll_destroy_~head#1.base| 1) |#StackHeapBarrier|)} assume 0 == dll_destroy_~head#1.offset; {8501#(<= (+ |ULTIMATE.start_dll_destroy_~head#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:58:55,429 INFO L290 TraceCheckUtils]: 41: Hoare triple {8501#(<= (+ |ULTIMATE.start_dll_destroy_~head#1.base| 1) |#StackHeapBarrier|)} assume !(dll_destroy_~head#1.base < #StackHeapBarrier); {8496#false} is VALID [2022-02-20 23:58:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:58:55,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:55,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353623270] [2022-02-20 23:58:55,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353623270] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:55,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:55,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:58:55,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185519600] [2022-02-20 23:58:55,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:55,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 42 [2022-02-20 23:58:55,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:55,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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:55,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:55,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:58:55,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:58:55,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:58:55,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:55,453 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:55,667 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-02-20 23:58:55,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:58:55,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 42 [2022-02-20 23:58:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:55,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-02-20 23:58:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-02-20 23:58:55,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2022-02-20 23:58:55,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:55,714 INFO L225 Difference]: With dead ends: 55 [2022-02-20 23:58:55,714 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 23:58:55,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:58:55,714 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:55,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 45 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:55,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 23:58:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-02-20 23:58:55,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:55,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 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:55,716 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 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:55,716 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 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:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:55,717 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-02-20 23:58:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-02-20 23:58:55,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:55,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:55,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 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 55 states. [2022-02-20 23:58:55,717 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 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 55 states. [2022-02-20 23:58:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:55,718 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-02-20 23:58:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-02-20 23:58:55,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:55,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:55,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:55,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 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:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-02-20 23:58:55,719 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 42 [2022-02-20 23:58:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:55,720 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-02-20 23:58:55,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-02-20 23:58:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 23:58:55,720 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:55,720 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:55,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 23:58:55,721 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:58:55,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:55,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912181, now seen corresponding path program 1 times [2022-02-20 23:58:55,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:58:55,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757413853] [2022-02-20 23:58:55,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:55,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:58:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:56,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {8733#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); {8733#true} is VALID [2022-02-20 23:58:56,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {8733#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {8733#true} is VALID [2022-02-20 23:58:56,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {8733#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; {8735#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:56,107 INFO L290 TraceCheckUtils]: 3: Hoare triple {8735#(= |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); {8735#(= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-20 23:58:56,108 INFO L290 TraceCheckUtils]: 4: Hoare triple {8735#(= |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 {8736#(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:56,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {8736#(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 {8736#(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:56,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {8736#(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 {8736#(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:56,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {8736#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (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); {8736#(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:56,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {8736#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (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; {8737#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:56,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {8737#(= (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; {8738#(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:56,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {8738#(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); {8738#(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:56,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {8738#(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 {8738#(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:56,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {8738#(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 {8739#(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:56,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {8739#(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 {8739#(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:56,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {8739#(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; {8739#(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:56,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {8739#(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 {8740#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 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|)) (= (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:56,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {8740#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 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|)) (= (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; {8741#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (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:56,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {8741#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (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); {8741#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (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:56,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {8741#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (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; {8742#(and (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) (= |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:56,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {8742#(and (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) (= |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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {8744#(and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {8744#(and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(dll_update_at_~index#1 > 0); {8744#(and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {8744#(and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {8745#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_#t~mem10#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {8745#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_#t~mem10#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {8746#(and (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {8746#(and (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(dll_update_at_~index#1 > 0); {8746#(and (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {8746#(and (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_dll_update_at } true; {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |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; {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {8747#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) 4) |ULTIMATE.start_main_~s~0#1.base|)) (not (= |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {8747#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) 4) |ULTIMATE.start_main_~s~0#1.base|)) (not (= |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(dll_update_at_~index#1 > 0); {8747#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) 4) |ULTIMATE.start_main_~s~0#1.base|)) (not (= |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {8747#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) 4) |ULTIMATE.start_main_~s~0#1.base|)) (not (= |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_dll_update_at } true; {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |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; {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_~i~0#1 >= 0); {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_~i~0#1 := main_~len~0#1 - 1; {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_~i~0#1 <= 0); {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:56,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :begin_inline_dll_destroy } true;dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset, dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset, dll_destroy_~head#1.base, dll_destroy_~head#1.offset;dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset; {8748#(and (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) (+ |ULTIMATE.start_dll_destroy_~head#1.offset| 4)) |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) (+ |ULTIMATE.start_dll_destroy_~head#1.offset| 4))) 1))} is VALID [2022-02-20 23:58:56,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {8748#(and (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) (+ |ULTIMATE.start_dll_destroy_~head#1.offset| 4)) |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) (+ |ULTIMATE.start_dll_destroy_~head#1.offset| 4))) 1))} assume !!(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {8748#(and (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) (+ |ULTIMATE.start_dll_destroy_~head#1.offset| 4)) |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) (+ |ULTIMATE.start_dll_destroy_~head#1.offset| 4))) 1))} is VALID [2022-02-20 23:58:56,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {8748#(and (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) (+ |ULTIMATE.start_dll_destroy_~head#1.offset| 4)) |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) (+ |ULTIMATE.start_dll_destroy_~head#1.offset| 4))) 1))} SUMMARY for call dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset := read~$Pointer$(dll_destroy_~head#1.base, 4 + dll_destroy_~head#1.offset, 4); srcloc: L605 {8749#(and (not (= |ULTIMATE.start_dll_destroy_#t~mem6#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)) (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_destroy_#t~mem6#1.base|) 1))} is VALID [2022-02-20 23:58:56,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {8749#(and (not (= |ULTIMATE.start_dll_destroy_#t~mem6#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)) (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_destroy_#t~mem6#1.base|) 1))} dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset := dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset; {8750#(and (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)))} is VALID [2022-02-20 23:58:56,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {8750#(and (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)))} assume 0 == dll_destroy_~head#1.offset; {8751#(and (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)))} is VALID [2022-02-20 23:58:56,127 INFO L290 TraceCheckUtils]: 41: Hoare triple {8751#(and (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)))} assume dll_destroy_~head#1.base < #StackHeapBarrier; {8751#(and (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)))} is VALID [2022-02-20 23:58:56,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {8751#(and (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)))} assume 0 == dll_destroy_~head#1.base || 1 == #valid[dll_destroy_~head#1.base];call ULTIMATE.dealloc(dll_destroy_~head#1.base, dll_destroy_~head#1.offset);dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset; {8752#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} is VALID [2022-02-20 23:58:56,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {8752#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} assume !!(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {8752#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} is VALID [2022-02-20 23:58:56,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {8752#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} assume !(1 == #valid[dll_destroy_~head#1.base]); {8734#false} is VALID [2022-02-20 23:58:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 23:58:56,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:58:56,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757413853] [2022-02-20 23:58:56,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757413853] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:56,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217395910] [2022-02-20 23:58:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:56,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:58:56,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:58:56,130 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:58:56,131 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:58:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:56,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 67 conjunts are in the unsatisfiable core [2022-02-20 23:58:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:56,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:56,308 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:56,367 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:58:56,367 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:56,389 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:56,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:56,412 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:56,441 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:58:56,441 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:56,615 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:58:56,615 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 28 treesize of output 29 [2022-02-20 23:58:56,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:56,753 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 29 treesize of output 24 [2022-02-20 23:58:56,846 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:58:56,847 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-02-20 23:58:57,053 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:57,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {8733#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); {8733#true} is VALID [2022-02-20 23:58:57,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {8733#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {8733#true} is VALID [2022-02-20 23:58:57,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {8733#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; {8762#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:57,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {8762#(= (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); {8762#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:57,070 INFO L290 TraceCheckUtils]: 4: Hoare triple {8762#(= (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 {8762#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:57,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {8762#(= (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 {8762#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:57,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {8762#(= (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 {8762#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:57,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {8762#(= (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); {8762#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:58:57,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {8762#(= (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; {8737#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:58:57,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {8737#(= (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; {8738#(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:57,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {8738#(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); {8738#(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:57,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {8738#(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 {8738#(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:57,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {8738#(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 {8739#(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:57,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {8739#(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 {8739#(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:57,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {8739#(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; {8739#(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:57,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {8739#(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 {8740#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 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|)) (= (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:57,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {8740#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 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|)) (= (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; {8741#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (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:57,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {8741#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (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); {8741#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (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:57,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {8741#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (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; {8742#(and (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) (= |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:57,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {8742#(and (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) (= |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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:57,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {8744#(and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:57,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {8744#(and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(dll_update_at_~index#1 > 0); {8744#(and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:57,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {8744#(and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4))) 1) (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {8823#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:57,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {8823#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {8827#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_dll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:57,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {8827#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_dll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(dll_update_at_~index#1 > 0); {8827#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_dll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:57,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {8827#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_dll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:57,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_dll_update_at } true; {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:57,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |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; {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:58:57,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {8843#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (<= |ULTIMATE.start_dll_update_at_~head#1.offset| 0))} is VALID [2022-02-20 23:58:57,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {8843#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (<= |ULTIMATE.start_dll_update_at_~head#1.offset| 0))} assume !(dll_update_at_~index#1 > 0); {8843#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (<= |ULTIMATE.start_dll_update_at_~head#1.offset| 0))} is VALID [2022-02-20 23:58:57,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {8843#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (<= |ULTIMATE.start_dll_update_at_~head#1.offset| 0))} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} is VALID [2022-02-20 23:58:57,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} assume { :end_inline_dll_update_at } true; {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} is VALID [2022-02-20 23:58:57,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} is VALID [2022-02-20 23:58:57,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} assume !(main_~i~0#1 >= 0); {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} is VALID [2022-02-20 23:58:57,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} main_~i~0#1 := main_~len~0#1 - 1; {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} is VALID [2022-02-20 23:58:57,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} assume !(main_~i~0#1 <= 0); {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} is VALID [2022-02-20 23:58:57,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} assume { :begin_inline_dll_destroy } true;dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset, dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset, dll_destroy_~head#1.base, dll_destroy_~head#1.offset;dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset; {8869#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4) |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4)) 1))} is VALID [2022-02-20 23:58:57,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {8869#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4) |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4)) 1))} assume !!(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {8869#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4) |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4)) 1))} is VALID [2022-02-20 23:58:57,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {8869#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4) |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4)) 1))} SUMMARY for call dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset := read~$Pointer$(dll_destroy_~head#1.base, 4 + dll_destroy_~head#1.offset, 4); srcloc: L605 {8876#(exists ((v_arrayElimCell_33 Int)) (and (or (= |ULTIMATE.start_dll_destroy_#t~mem6#1.base| v_arrayElimCell_33) (not (= (+ |ULTIMATE.start_dll_destroy_~head#1.offset| 4) 4))) (not (= v_arrayElimCell_33 |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| v_arrayElimCell_33) 1)))} is VALID [2022-02-20 23:58:57,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {8876#(exists ((v_arrayElimCell_33 Int)) (and (or (= |ULTIMATE.start_dll_destroy_#t~mem6#1.base| v_arrayElimCell_33) (not (= (+ |ULTIMATE.start_dll_destroy_~head#1.offset| 4) 4))) (not (= v_arrayElimCell_33 |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| v_arrayElimCell_33) 1)))} dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset := dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset; {8880#(exists ((v_arrayElimCell_33 Int)) (and (or (not (= (+ |ULTIMATE.start_dll_destroy_~head#1.offset| 4) 4)) (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| v_arrayElimCell_33)) (not (= v_arrayElimCell_33 |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| v_arrayElimCell_33) 1)))} is VALID [2022-02-20 23:58:57,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {8880#(exists ((v_arrayElimCell_33 Int)) (and (or (not (= (+ |ULTIMATE.start_dll_destroy_~head#1.offset| 4) 4)) (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| v_arrayElimCell_33)) (not (= v_arrayElimCell_33 |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| v_arrayElimCell_33) 1)))} assume 0 == dll_destroy_~head#1.offset; {8751#(and (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)))} is VALID [2022-02-20 23:58:57,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {8751#(and (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)))} assume dll_destroy_~head#1.base < #StackHeapBarrier; {8751#(and (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)))} is VALID [2022-02-20 23:58:57,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {8751#(and (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)))} assume 0 == dll_destroy_~head#1.base || 1 == #valid[dll_destroy_~head#1.base];call ULTIMATE.dealloc(dll_destroy_~head#1.base, dll_destroy_~head#1.offset);dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset; {8752#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} is VALID [2022-02-20 23:58:57,098 INFO L290 TraceCheckUtils]: 43: Hoare triple {8752#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} assume !!(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {8752#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} is VALID [2022-02-20 23:58:57,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {8752#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} assume !(1 == #valid[dll_destroy_~head#1.base]); {8734#false} is VALID [2022-02-20 23:58:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:57,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:59,475 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2022-02-20 23:58:59,864 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2022-02-20 23:59:00,120 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))))) is different from false [2022-02-20 23:59:00,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2022-02-20 23:59:02,513 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2022-02-20 23:59:02,636 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_#res#1.base|))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))))) is different from false [2022-02-20 23:59:02,767 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2022-02-20 23:59:03,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (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)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (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)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2022-02-20 23:59:03,089 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:03,090 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 61 treesize of output 65 [2022-02-20 23:59:03,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_prenex_6 Int) (v_ArrVal_1641 (Array Int Int)) (v_prenex_5 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_5)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_6) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2022-02-20 23:59:03,564 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1639 Int) (v_prenex_6 Int) (v_ArrVal_1641 (Array Int Int)) (v_prenex_5 (Array Int Int))) (not (= (select (store (select (let ((.cse0 (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_1639)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_5)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_6) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select (store (select (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_1639)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2022-02-20 23:59:03,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:59:03,673 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:03,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 102 [2022-02-20 23:59:03,715 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 461 treesize of output 447 [2022-02-20 23:59:03,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:59:03,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:03,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 457 treesize of output 451 [2022-02-20 23:59:03,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:59:03,824 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:03,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 473 treesize of output 457 [2022-02-20 23:59:03,881 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 354 treesize of output 346 [2022-02-20 23:59:03,932 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:03,932 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 368 treesize of output 351 [2022-02-20 23:59:03,991 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:03,991 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 350 treesize of output 343 [2022-02-20 23:59:04,031 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 352 treesize of output 348 [2022-02-20 23:59:04,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {8752#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} assume !(1 == #valid[dll_destroy_~head#1.base]); {8734#false} is VALID [2022-02-20 23:59:04,910 INFO L290 TraceCheckUtils]: 43: Hoare triple {8752#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} assume !!(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {8752#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} is VALID [2022-02-20 23:59:04,911 INFO L290 TraceCheckUtils]: 42: Hoare triple {8751#(and (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)))} assume 0 == dll_destroy_~head#1.base || 1 == #valid[dll_destroy_~head#1.base];call ULTIMATE.dealloc(dll_destroy_~head#1.base, dll_destroy_~head#1.offset);dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset; {8752#(= (select |#valid| |ULTIMATE.start_dll_destroy_~head#1.base|) 1)} is VALID [2022-02-20 23:59:04,911 INFO L290 TraceCheckUtils]: 41: Hoare triple {8751#(and (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)))} assume dll_destroy_~head#1.base < #StackHeapBarrier; {8751#(and (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)))} is VALID [2022-02-20 23:59:04,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {8908#(or (not (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0)) (and (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|))))} assume 0 == dll_destroy_~head#1.offset; {8751#(and (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)))} is VALID [2022-02-20 23:59:04,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {8912#(or (and (not (= |ULTIMATE.start_dll_destroy_#t~mem6#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_destroy_#t~mem6#1.base|) 1)) (not (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0)))} dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset := dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset; {8908#(or (not (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0)) (and (= (select |#valid| |ULTIMATE.start_dll_destroy_~temp~1#1.base|) 1) (not (= |ULTIMATE.start_dll_destroy_~temp~1#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|))))} is VALID [2022-02-20 23:59:04,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {8869#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4) |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4)) 1))} SUMMARY for call dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset := read~$Pointer$(dll_destroy_~head#1.base, 4 + dll_destroy_~head#1.offset, 4); srcloc: L605 {8912#(or (and (not (= |ULTIMATE.start_dll_destroy_#t~mem6#1.base| |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_destroy_#t~mem6#1.base|) 1)) (not (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0)))} is VALID [2022-02-20 23:59:04,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {8869#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4) |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4)) 1))} assume !!(dll_destroy_~head#1.base != 0 || dll_destroy_~head#1.offset != 0); {8869#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4) |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4)) 1))} is VALID [2022-02-20 23:59:04,914 INFO L290 TraceCheckUtils]: 36: Hoare triple {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} assume { :begin_inline_dll_destroy } true;dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc dll_destroy_#t~mem6#1.base, dll_destroy_#t~mem6#1.offset, dll_destroy_~temp~1#1.base, dll_destroy_~temp~1#1.offset, dll_destroy_~head#1.base, dll_destroy_~head#1.offset;dll_destroy_~head#1.base, dll_destroy_~head#1.offset := dll_destroy_#in~head#1.base, dll_destroy_#in~head#1.offset; {8869#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4) |ULTIMATE.start_dll_destroy_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_destroy_~head#1.base|) 4)) 1))} is VALID [2022-02-20 23:59:04,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} assume !(main_~i~0#1 <= 0); {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} is VALID [2022-02-20 23:59:04,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} main_~i~0#1 := main_~len~0#1 - 1; {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} is VALID [2022-02-20 23:59:04,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} assume !(main_~i~0#1 >= 0); {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} is VALID [2022-02-20 23:59:04,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} is VALID [2022-02-20 23:59:04,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} assume { :end_inline_dll_update_at } true; {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} is VALID [2022-02-20 23:59:04,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {8940#(and (forall ((v_ArrVal_1644 Int)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1644)) |ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_1644 Int)) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1644)) |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~s~0#1.base|))))} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {8850#(and (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1))} is VALID [2022-02-20 23:59:04,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {8940#(and (forall ((v_ArrVal_1644 Int)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1644)) |ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_1644 Int)) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1644)) |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~s~0#1.base|))))} assume !(dll_update_at_~index#1 > 0); {8940#(and (forall ((v_ArrVal_1644 Int)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1644)) |ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_1644 Int)) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1644)) |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~s~0#1.base|))))} is VALID [2022-02-20 23:59:04,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {8947#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))))))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {8940#(and (forall ((v_ArrVal_1644 Int)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1644)) |ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_1644 Int)) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) |ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1644)) |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~s~0#1.base|))))} is VALID [2022-02-20 23:59:04,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {8947#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))))))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {8947#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))))))} is VALID [2022-02-20 23:59:04,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {8947#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))))))} assume { :end_inline_dll_update_at } true; {8947#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))))))} is VALID [2022-02-20 23:59:04,937 WARN L290 TraceCheckUtils]: 25: Hoare triple {8957#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} SUMMARY for call write~int(dll_update_at_~data#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, 4); srcloc: L618-3 {8947#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))))))} is UNKNOWN [2022-02-20 23:59:04,945 WARN L290 TraceCheckUtils]: 24: Hoare triple {8957#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} assume !(dll_update_at_~index#1 > 0); {8957#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} is UNKNOWN [2022-02-20 23:59:04,960 WARN L290 TraceCheckUtils]: 23: Hoare triple {8964#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)))))} dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset;dll_update_at_#t~post11#1 := dll_update_at_~index#1;dll_update_at_~index#1 := dll_update_at_#t~post11#1 - 1;havoc dll_update_at_#t~post11#1; {8957#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} is UNKNOWN [2022-02-20 23:59:04,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {8968#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))))))} SUMMARY for call dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset := read~$Pointer$(dll_update_at_~head#1.base, 4 + dll_update_at_~head#1.offset, 4); srcloc: L619 {8964#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)))))} is VALID [2022-02-20 23:59:04,978 WARN L290 TraceCheckUtils]: 21: Hoare triple {8968#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))))))} assume !!(dll_update_at_~index#1 > 0); {8968#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))))))} is UNKNOWN [2022-02-20 23:59:04,989 WARN L290 TraceCheckUtils]: 20: Hoare triple {8975#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} assume !!(main_~i~0#1 >= 0);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_update_at } true;dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset, dll_update_at_#in~data#1, dll_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc dll_update_at_#t~mem10#1.base, dll_update_at_#t~mem10#1.offset, dll_update_at_#t~post11#1, dll_update_at_~head#1.base, dll_update_at_~head#1.offset, dll_update_at_~data#1, dll_update_at_~index#1;dll_update_at_~head#1.base, dll_update_at_~head#1.offset := dll_update_at_#in~head#1.base, dll_update_at_#in~head#1.offset;dll_update_at_~data#1 := dll_update_at_#in~data#1;dll_update_at_~index#1 := dll_update_at_#in~index#1; {8968#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|) (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))))))} is UNKNOWN [2022-02-20 23:59:04,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {8979#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= 1 (select |#valid| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4))))) (< |ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} 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;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;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; {8975#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} is VALID [2022-02-20 23:59:05,008 WARN L290 TraceCheckUtils]: 18: Hoare triple {8983#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {8979#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= 1 (select |#valid| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4))))) (< |ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} is UNKNOWN [2022-02-20 23:59:05,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {8983#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} assume !(dll_create_~len#1 > 0); {8983#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} is VALID [2022-02-20 23:59:05,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {8990#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.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)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |#memory_$Pointer$.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)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (< |ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} 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; {8983#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} is VALID [2022-02-20 23:59:05,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {8994#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_prenex_6 Int) (v_ArrVal_1641 (Array Int Int)) (v_prenex_5 (Array Int Int))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_5) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_6) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (< |ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} 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 {8990#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |#valid| (select (store (select (store |#memory_$Pointer$.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)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |#memory_$Pointer$.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)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (< |ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} is VALID [2022-02-20 23:59:05,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {8994#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_prenex_6 Int) (v_ArrVal_1641 (Array Int Int)) (v_prenex_5 (Array Int Int))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_5) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_6) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (< |ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {8994#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_prenex_6 Int) (v_ArrVal_1641 (Array Int Int)) (v_prenex_5 (Array Int Int))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_5) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_6) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (< |ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} is VALID [2022-02-20 23:59:05,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {9001#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1639 Int) (v_prenex_6 Int) (v_ArrVal_1641 (Array Int Int)) (v_prenex_5 (Array Int Int))) (not (= (select (store (select (store (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_1639)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) (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_1639)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_5) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_6) 4) |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store (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_1639)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) (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_1639)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (< |ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} 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 {8994#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_prenex_6 Int) (v_ArrVal_1641 (Array Int Int)) (v_prenex_5 (Array Int Int))) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_5) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_6) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (< |ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} is VALID [2022-02-20 23:59:05,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {8738#(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 {9001#(forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1639 Int) (v_prenex_6 Int) (v_ArrVal_1641 (Array Int Int)) (v_prenex_5 (Array Int Int))) (not (= (select (store (select (store (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_1639)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) (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_1639)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_5) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_6) 4) |ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store (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_1639)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) (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_1639)) |ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (< |ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))} is VALID [2022-02-20 23:59:05,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {8738#(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 {8738#(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:59:05,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {8738#(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); {8738#(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:59:05,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {9014#(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; {8738#(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:59:05,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {9018#(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; {9014#(not (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 0))} is VALID [2022-02-20 23:59:05,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {9018#(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); {9018#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:59:05,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {9018#(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 {9018#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:59:05,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {9018#(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 {9018#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:59:05,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {9018#(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 {9018#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:59:05,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {9018#(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); {9018#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:59:05,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {8733#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; {9018#(not (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))} is VALID [2022-02-20 23:59:05,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {8733#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_~new_data~0#1, main_#t~ret15#1, main_#t~post14#1, main_~expected~0#1, 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;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; {8733#true} is VALID [2022-02-20 23:59:05,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {8733#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); {8733#true} is VALID [2022-02-20 23:59:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-02-20 23:59:05,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217395910] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:05,084 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:59:05,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 21] total 42 [2022-02-20 23:59:05,085 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278353704] [2022-02-20 23:59:05,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:05,085 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 0 states have call successors, (0), 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 45 [2022-02-20 23:59:05,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:05,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 0 states have call successors, (0), 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,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 85 inductive. 0 not inductive. 12 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:05,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-02-20 23:59:05,319 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:05,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-02-20 23:59:05,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=960, Unknown=10, NotChecked=710, Total=1806 [2022-02-20 23:59:05,320 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 0 states have call successors, (0), 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,287 WARN L838 $PredicateComparison]: unable to prove that (let ((.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) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |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_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (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)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (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)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1))) is different from false [2022-02-20 23:59:10,296 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))))) is different from false [2022-02-20 23:59:14,353 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (not (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select |c_#valid| .cse1) 1))) is different from false