./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_update_all.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:54:22,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:54:22,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:54:22,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:54:22,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:54:22,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:54:22,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:54:22,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:54:22,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:54:22,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:54:22,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:54:22,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:54:22,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:54:22,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:54:22,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:54:22,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:54:22,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:54:22,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:54:22,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:54:22,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:54:22,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:54:22,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:54:22,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:54:22,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:54:22,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:54:22,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:54:22,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:54:22,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:54:22,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:54:22,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:54:22,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:54:22,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:54:22,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:54:22,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:54:22,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:54:22,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:54:22,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:54:22,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:54:22,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:54:22,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:54:22,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:54:22,681 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:54:22,710 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:54:22,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:54:22,711 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:54:22,712 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:54:22,712 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:54:22,713 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:54:22,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:54:22,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:54:22,713 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:54:22,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:54:22,714 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:54:22,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:54:22,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:54:22,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:54:22,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:54:22,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:54:22,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:54:22,715 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:54:22,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:54:22,716 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:54:22,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:54:22,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:54:22,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:54:22,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:54:22,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:22,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:54:22,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:54:22,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:54:22,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:54:22,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:54:22,717 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:54:22,718 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:54:22,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:54:22,718 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 ! call(reach_error())) ) 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2022-02-20 16:54:22,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:54:22,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:54:22,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:54:22,935 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:54:22,936 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:54:22,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all.i [2022-02-20 16:54:22,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f368f6f/3a6a509f1bab4aff919ed52d6c0ef8d9/FLAG440b731cf [2022-02-20 16:54:23,394 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:54:23,396 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2022-02-20 16:54:23,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f368f6f/3a6a509f1bab4aff919ed52d6c0ef8d9/FLAG440b731cf [2022-02-20 16:54:23,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f368f6f/3a6a509f1bab4aff919ed52d6c0ef8d9 [2022-02-20 16:54:23,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:54:23,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:54:23,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:23,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:54:23,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:54:23,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:23" (1/1) ... [2022-02-20 16:54:23,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248b56bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:23, skipping insertion in model container [2022-02-20 16:54:23,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:23" (1/1) ... [2022-02-20 16:54:23,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:54:23,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:54:23,726 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/dll2c_update_all.i[24538,24551] [2022-02-20 16:54:23,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:23,742 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:54:23,790 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/dll2c_update_all.i[24538,24551] [2022-02-20 16:54:23,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:23,821 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:54:23,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:23 WrapperNode [2022-02-20 16:54:23,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:23,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:23,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:54:23,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:54:23,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:23" (1/1) ... [2022-02-20 16:54:23,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:23" (1/1) ... [2022-02-20 16:54:23,872 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-02-20 16:54:23,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:23,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:54:23,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:54:23,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:54:23,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:23" (1/1) ... [2022-02-20 16:54:23,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:23" (1/1) ... [2022-02-20 16:54:23,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:23" (1/1) ... [2022-02-20 16:54:23,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:23" (1/1) ... [2022-02-20 16:54:23,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:23" (1/1) ... [2022-02-20 16:54:23,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:23" (1/1) ... [2022-02-20 16:54:23,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:23" (1/1) ... [2022-02-20 16:54:23,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:54:23,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:54:23,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:54:23,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:54:23,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:23" (1/1) ... [2022-02-20 16:54:23,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:23,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:23,941 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 16:54:23,961 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 16:54:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:54:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:54:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 16:54:23,974 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 16:54:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:54:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:54:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:54:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:54:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:54:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:54:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:54:23,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:54:24,051 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:54:24,052 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:54:24,265 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:54:24,270 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:54:24,270 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:54:24,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:24 BoogieIcfgContainer [2022-02-20 16:54:24,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:54:24,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:54:24,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:54:24,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:54:24,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:54:23" (1/3) ... [2022-02-20 16:54:24,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2008883e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:24, skipping insertion in model container [2022-02-20 16:54:24,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:23" (2/3) ... [2022-02-20 16:54:24,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2008883e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:24, skipping insertion in model container [2022-02-20 16:54:24,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:24" (3/3) ... [2022-02-20 16:54:24,277 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2022-02-20 16:54:24,280 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:54:24,281 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:54:24,314 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:54:24,318 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 16:54:24,318 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:54:24,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:54:24,346 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:24,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:24,347 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:24,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1387430191, now seen corresponding path program 1 times [2022-02-20 16:54:24,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:24,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377326864] [2022-02-20 16:54:24,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:24,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:24,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:24,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {42#true} is VALID [2022-02-20 16:54:24,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {42#true} is VALID [2022-02-20 16:54:24,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {42#true} is VALID [2022-02-20 16:54:24,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {42#true} assume true; {42#true} is VALID [2022-02-20 16:54:24,608 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {42#true} {42#true} #130#return; {42#true} is VALID [2022-02-20 16:54:24,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#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(19, 2); {42#true} is VALID [2022-02-20 16:54:24,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {42#true} is VALID [2022-02-20 16:54:24,610 INFO L272 TraceCheckUtils]: 2: Hoare triple {42#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {49#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:54:24,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {49#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {42#true} is VALID [2022-02-20 16:54:24,611 INFO L290 TraceCheckUtils]: 4: Hoare triple {42#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {42#true} is VALID [2022-02-20 16:54:24,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {42#true} is VALID [2022-02-20 16:54:24,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#true} assume true; {42#true} is VALID [2022-02-20 16:54:24,612 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {42#true} {42#true} #130#return; {42#true} is VALID [2022-02-20 16:54:24,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {42#true} is VALID [2022-02-20 16:54:24,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#true} assume !true; {43#false} is VALID [2022-02-20 16:54:24,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {43#false} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {43#false} is VALID [2022-02-20 16:54:24,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {43#false} is VALID [2022-02-20 16:54:24,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !(main_~i~0#1 < main_~len~0#1); {43#false} is VALID [2022-02-20 16:54:24,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} main_~i~0#1 := 0; {43#false} is VALID [2022-02-20 16:54:24,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {43#false} is VALID [2022-02-20 16:54:24,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} assume !(dll_circular_get_data_at_~index#1 > 0); {43#false} is VALID [2022-02-20 16:54:24,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} call dll_circular_get_data_at_#t~mem11#1 := read~int(dll_circular_get_data_at_~head#1.base, 8 + dll_circular_get_data_at_~head#1.offset, 4);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {43#false} is VALID [2022-02-20 16:54:24,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {43#false} is VALID [2022-02-20 16:54:24,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {43#false} is VALID [2022-02-20 16:54:24,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-02-20 16:54:24,615 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 16:54:24,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:24,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377326864] [2022-02-20 16:54:24,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377326864] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:24,616 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:24,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:54:24,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495359376] [2022-02-20 16:54:24,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:24,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 16:54:24,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:24,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:24,650 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 16:54:24,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:54:24,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:24,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:54:24,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:54:24,670 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:24,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:24,807 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-02-20 16:54:24,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:54:24,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 16:54:24,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-02-20 16:54:24,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-02-20 16:54:24,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2022-02-20 16:54:24,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:24,900 INFO L225 Difference]: With dead ends: 63 [2022-02-20 16:54:24,901 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:54:24,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 16:54:24,905 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:24,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:54:24,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 16:54:24,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:24,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:24,940 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:24,941 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:24,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:24,944 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:54:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:54:24,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:24,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:24,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-02-20 16:54:24,946 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-02-20 16:54:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:24,948 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:54:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:54:24,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:24,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:24,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:24,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 16:54:24,966 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2022-02-20 16:54:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:24,967 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 16:54:24,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:54:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:54:24,968 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:24,968 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:24,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:54:24,968 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:24,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:24,969 INFO L85 PathProgramCache]: Analyzing trace with hash 498100996, now seen corresponding path program 1 times [2022-02-20 16:54:24,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:24,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553402017] [2022-02-20 16:54:24,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:24,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:25,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:25,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {247#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {239#true} is VALID [2022-02-20 16:54:25,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {239#true} is VALID [2022-02-20 16:54:25,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {239#true} is VALID [2022-02-20 16:54:25,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {239#true} assume true; {239#true} is VALID [2022-02-20 16:54:25,067 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {239#true} {241#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} #130#return; {241#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:54:25,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {239#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(19, 2); {239#true} is VALID [2022-02-20 16:54:25,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {241#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:54:25,070 INFO L272 TraceCheckUtils]: 2: Hoare triple {241#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {247#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:54:25,070 INFO L290 TraceCheckUtils]: 3: Hoare triple {247#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {239#true} is VALID [2022-02-20 16:54:25,071 INFO L290 TraceCheckUtils]: 4: Hoare triple {239#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {239#true} is VALID [2022-02-20 16:54:25,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {239#true} is VALID [2022-02-20 16:54:25,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#true} assume true; {239#true} is VALID [2022-02-20 16:54:25,072 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {239#true} {241#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} #130#return; {241#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:54:25,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {241#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {241#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:54:25,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {241#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} assume !(dll_circular_create_~len#1 > 1); {240#false} is VALID [2022-02-20 16:54:25,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {240#false} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {240#false} is VALID [2022-02-20 16:54:25,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {240#false} is VALID [2022-02-20 16:54:25,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {240#false} assume !(main_~i~0#1 < main_~len~0#1); {240#false} is VALID [2022-02-20 16:54:25,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {240#false} main_~i~0#1 := 0; {240#false} is VALID [2022-02-20 16:54:25,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {240#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {240#false} is VALID [2022-02-20 16:54:25,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {240#false} assume !(dll_circular_get_data_at_~index#1 > 0); {240#false} is VALID [2022-02-20 16:54:25,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {240#false} call dll_circular_get_data_at_#t~mem11#1 := read~int(dll_circular_get_data_at_~head#1.base, 8 + dll_circular_get_data_at_~head#1.offset, 4);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {240#false} is VALID [2022-02-20 16:54:25,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {240#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {240#false} is VALID [2022-02-20 16:54:25,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {240#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {240#false} is VALID [2022-02-20 16:54:25,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-02-20 16:54:25,081 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 16:54:25,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:25,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553402017] [2022-02-20 16:54:25,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553402017] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:25,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:25,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:54:25,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766447437] [2022-02-20 16:54:25,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:25,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 16:54:25,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:25,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:25,107 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 16:54:25,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:54:25,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:25,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:54:25,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:54:25,109 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:25,207 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-02-20 16:54:25,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:54:25,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 16:54:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:25,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-02-20 16:54:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-02-20 16:54:25,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2022-02-20 16:54:25,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:25,261 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:54:25,261 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 16:54:25,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:54:25,262 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:25,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:25,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 16:54:25,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-02-20 16:54:25,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:25,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:25,278 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:25,278 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:25,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:25,281 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-02-20 16:54:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-02-20 16:54:25,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:25,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:25,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-02-20 16:54:25,285 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-02-20 16:54:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:25,290 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-02-20 16:54:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-02-20 16:54:25,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:25,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:25,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:25,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-02-20 16:54:25,292 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-02-20 16:54:25,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:25,293 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-20 16:54:25,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:25,293 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 16:54:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 16:54:25,294 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:25,294 INFO L514 BasicCegarLoop]: trace histogram [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 16:54:25,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:54:25,294 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:25,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash 698671896, now seen corresponding path program 1 times [2022-02-20 16:54:25,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:25,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016761749] [2022-02-20 16:54:25,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:25,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:25,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {448#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {434#true} is VALID [2022-02-20 16:54:25,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {434#true} is VALID [2022-02-20 16:54:25,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {434#true} is VALID [2022-02-20 16:54:25,426 INFO L290 TraceCheckUtils]: 3: Hoare triple {434#true} assume true; {434#true} is VALID [2022-02-20 16:54:25,427 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {434#true} {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #130#return; {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:54:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:25,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {448#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {434#true} is VALID [2022-02-20 16:54:25,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {434#true} is VALID [2022-02-20 16:54:25,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {434#true} is VALID [2022-02-20 16:54:25,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {434#true} assume true; {434#true} is VALID [2022-02-20 16:54:25,440 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {434#true} {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #132#return; {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {434#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(19, 2); {434#true} is VALID [2022-02-20 16:54:25,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,441 INFO L272 TraceCheckUtils]: 2: Hoare triple {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {448#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:54:25,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {448#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {434#true} is VALID [2022-02-20 16:54:25,442 INFO L290 TraceCheckUtils]: 4: Hoare triple {434#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {434#true} is VALID [2022-02-20 16:54:25,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {434#true} is VALID [2022-02-20 16:54:25,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {434#true} assume true; {434#true} is VALID [2022-02-20 16:54:25,443 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {434#true} {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #130#return; {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} assume !!(dll_circular_create_~len#1 > 1); {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,445 INFO L272 TraceCheckUtils]: 10: Hoare triple {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {448#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:54:25,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {448#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {434#true} is VALID [2022-02-20 16:54:25,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {434#true} is VALID [2022-02-20 16:54:25,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {434#true} is VALID [2022-02-20 16:54:25,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-02-20 16:54:25,446 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #132#return; {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4); {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4); {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} assume !(dll_circular_create_~len#1 > 1); {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {436#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {447#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0))} is VALID [2022-02-20 16:54:25,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {447#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0))} assume !(main_~i~0#1 < main_~len~0#1); {435#false} is VALID [2022-02-20 16:54:25,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {435#false} main_~i~0#1 := 0; {435#false} is VALID [2022-02-20 16:54:25,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {435#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {435#false} is VALID [2022-02-20 16:54:25,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {435#false} assume !(dll_circular_get_data_at_~index#1 > 0); {435#false} is VALID [2022-02-20 16:54:25,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {435#false} call dll_circular_get_data_at_#t~mem11#1 := read~int(dll_circular_get_data_at_~head#1.base, 8 + dll_circular_get_data_at_~head#1.offset, 4);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {435#false} is VALID [2022-02-20 16:54:25,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {435#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {435#false} is VALID [2022-02-20 16:54:25,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {435#false} is VALID [2022-02-20 16:54:25,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-02-20 16:54:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:54:25,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:25,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016761749] [2022-02-20 16:54:25,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016761749] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:25,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:25,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:54:25,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54112409] [2022-02-20 16:54:25,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:25,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-02-20 16:54:25,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:25,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:25,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:25,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:54:25,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:25,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:54:25,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:54:25,473 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:25,657 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-02-20 16:54:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:54:25,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-02-20 16:54:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 16:54:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 16:54:25,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-02-20 16:54:25,716 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 16:54:25,717 INFO L225 Difference]: With dead ends: 53 [2022-02-20 16:54:25,717 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 16:54:25,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:54:25,719 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:25,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 74 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 16:54:25,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-02-20 16:54:25,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:25,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:25,723 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:25,724 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:25,732 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-02-20 16:54:25,732 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-02-20 16:54:25,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:25,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:25,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 44 states. [2022-02-20 16:54:25,734 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 44 states. [2022-02-20 16:54:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:25,737 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-02-20 16:54:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-02-20 16:54:25,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:25,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:25,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:25,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-02-20 16:54:25,740 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 30 [2022-02-20 16:54:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:25,740 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-02-20 16:54:25,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 16:54:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 16:54:25,742 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:25,742 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-02-20 16:54:25,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:54:25,742 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:25,743 INFO L85 PathProgramCache]: Analyzing trace with hash 143562896, now seen corresponding path program 1 times [2022-02-20 16:54:25,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:25,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063779737] [2022-02-20 16:54:25,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:25,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:25,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:25,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {659#true} is VALID [2022-02-20 16:54:25,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {659#true} is VALID [2022-02-20 16:54:25,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {659#true} is VALID [2022-02-20 16:54:25,861 INFO L290 TraceCheckUtils]: 3: Hoare triple {659#true} assume true; {659#true} is VALID [2022-02-20 16:54:25,862 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {659#true} {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #130#return; {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:54:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:25,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {659#true} is VALID [2022-02-20 16:54:25,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {659#true} is VALID [2022-02-20 16:54:25,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {659#true} is VALID [2022-02-20 16:54:25,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {659#true} assume true; {659#true} is VALID [2022-02-20 16:54:25,888 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {659#true} {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #132#return; {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {659#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(19, 2); {659#true} is VALID [2022-02-20 16:54:25,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,889 INFO L272 TraceCheckUtils]: 2: Hoare triple {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:54:25,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {659#true} is VALID [2022-02-20 16:54:25,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {659#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {659#true} is VALID [2022-02-20 16:54:25,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {659#true} is VALID [2022-02-20 16:54:25,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#true} assume true; {659#true} is VALID [2022-02-20 16:54:25,891 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {659#true} {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #130#return; {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} assume !!(dll_circular_create_~len#1 > 1); {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,892 INFO L272 TraceCheckUtils]: 10: Hoare triple {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:54:25,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {659#true} is VALID [2022-02-20 16:54:25,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {659#true} is VALID [2022-02-20 16:54:25,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {659#true} is VALID [2022-02-20 16:54:25,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-02-20 16:54:25,894 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #132#return; {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4); {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4); {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} assume !(dll_circular_create_~len#1 > 1); {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:25,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {661#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {672#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0))} is VALID [2022-02-20 16:54:25,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {672#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {672#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0))} is VALID [2022-02-20 16:54:25,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {672#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0))} assume !(dll_circular_update_at_~index#1 > 0); {672#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0))} is VALID [2022-02-20 16:54:25,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {672#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0))} call write~int(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, 8 + dll_circular_update_at_~head#1.offset, 4); {672#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0))} is VALID [2022-02-20 16:54:25,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {672#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0))} assume { :end_inline_dll_circular_update_at } true; {672#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0))} is VALID [2022-02-20 16:54:25,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {672#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {673#(and (= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:54:25,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {673#(and (= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 < main_~len~0#1); {660#false} is VALID [2022-02-20 16:54:25,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {660#false} main_~i~0#1 := 0; {660#false} is VALID [2022-02-20 16:54:25,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {660#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {660#false} is VALID [2022-02-20 16:54:25,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {660#false} assume !(dll_circular_get_data_at_~index#1 > 0); {660#false} is VALID [2022-02-20 16:54:25,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {660#false} call dll_circular_get_data_at_#t~mem11#1 := read~int(dll_circular_get_data_at_~head#1.base, 8 + dll_circular_get_data_at_~head#1.offset, 4);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {660#false} is VALID [2022-02-20 16:54:25,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {660#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {660#false} is VALID [2022-02-20 16:54:25,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {660#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {660#false} is VALID [2022-02-20 16:54:25,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-02-20 16:54:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:54:25,903 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:25,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063779737] [2022-02-20 16:54:25,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063779737] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:25,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170257919] [2022-02-20 16:54:25,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:25,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:25,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:25,905 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 16:54:25,931 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 16:54:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:26,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:54:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:26,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:26,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {659#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(19, 2); {659#true} is VALID [2022-02-20 16:54:26,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,323 INFO L272 TraceCheckUtils]: 2: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {659#true} is VALID [2022-02-20 16:54:26,324 INFO L290 TraceCheckUtils]: 3: Hoare triple {659#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {659#true} is VALID [2022-02-20 16:54:26,324 INFO L290 TraceCheckUtils]: 4: Hoare triple {659#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {659#true} is VALID [2022-02-20 16:54:26,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {659#true} is VALID [2022-02-20 16:54:26,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#true} assume true; {659#true} is VALID [2022-02-20 16:54:26,325 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {659#true} {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #130#return; {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(dll_circular_create_~len#1 > 1); {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,326 INFO L272 TraceCheckUtils]: 10: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {659#true} is VALID [2022-02-20 16:54:26,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {659#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {659#true} is VALID [2022-02-20 16:54:26,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {659#true} is VALID [2022-02-20 16:54:26,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {659#true} is VALID [2022-02-20 16:54:26,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-02-20 16:54:26,327 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #132#return; {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4); {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4); {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_circular_create_~len#1 > 1); {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {742#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:54:26,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {742#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {742#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:54:26,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {742#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} assume !(dll_circular_update_at_~index#1 > 0); {742#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:54:26,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {742#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} call write~int(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, 8 + dll_circular_update_at_~head#1.offset, 4); {742#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:54:26,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {742#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} assume { :end_inline_dll_circular_update_at } true; {742#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:54:26,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {742#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {758#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:54:26,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {758#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 < main_~len~0#1); {660#false} is VALID [2022-02-20 16:54:26,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {660#false} main_~i~0#1 := 0; {660#false} is VALID [2022-02-20 16:54:26,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {660#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {660#false} is VALID [2022-02-20 16:54:26,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {660#false} assume !(dll_circular_get_data_at_~index#1 > 0); {660#false} is VALID [2022-02-20 16:54:26,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {660#false} call dll_circular_get_data_at_#t~mem11#1 := read~int(dll_circular_get_data_at_~head#1.base, 8 + dll_circular_get_data_at_~head#1.offset, 4);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {660#false} is VALID [2022-02-20 16:54:26,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {660#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {660#false} is VALID [2022-02-20 16:54:26,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {660#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {660#false} is VALID [2022-02-20 16:54:26,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-02-20 16:54:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:54:26,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:26,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-02-20 16:54:26,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {660#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {660#false} is VALID [2022-02-20 16:54:26,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {660#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {660#false} is VALID [2022-02-20 16:54:26,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {660#false} call dll_circular_get_data_at_#t~mem11#1 := read~int(dll_circular_get_data_at_~head#1.base, 8 + dll_circular_get_data_at_~head#1.offset, 4);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {660#false} is VALID [2022-02-20 16:54:26,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {660#false} assume !(dll_circular_get_data_at_~index#1 > 0); {660#false} is VALID [2022-02-20 16:54:26,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {660#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {660#false} is VALID [2022-02-20 16:54:26,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {660#false} main_~i~0#1 := 0; {660#false} is VALID [2022-02-20 16:54:26,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {804#(< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)} assume !(main_~i~0#1 < main_~len~0#1); {660#false} is VALID [2022-02-20 16:54:26,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {808#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {804#(< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {808#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} assume { :end_inline_dll_circular_update_at } true; {808#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {808#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} call write~int(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, 8 + dll_circular_update_at_~head#1.offset, 4); {808#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {808#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} assume !(dll_circular_update_at_~index#1 > 0); {808#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {808#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {808#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {808#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_circular_create_~len#1 > 1); {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4); {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4); {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,543 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #132#return; {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-02-20 16:54:26,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {659#true} is VALID [2022-02-20 16:54:26,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {659#true} is VALID [2022-02-20 16:54:26,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {659#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {659#true} is VALID [2022-02-20 16:54:26,544 INFO L272 TraceCheckUtils]: 10: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {659#true} is VALID [2022-02-20 16:54:26,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(dll_circular_create_~len#1 > 1); {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,545 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {659#true} {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #130#return; {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#true} assume true; {659#true} is VALID [2022-02-20 16:54:26,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {659#true} is VALID [2022-02-20 16:54:26,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {659#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {659#true} is VALID [2022-02-20 16:54:26,546 INFO L290 TraceCheckUtils]: 3: Hoare triple {659#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {659#true} is VALID [2022-02-20 16:54:26,546 INFO L272 TraceCheckUtils]: 2: Hoare triple {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {659#true} is VALID [2022-02-20 16:54:26,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {681#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:26,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {659#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(19, 2); {659#true} is VALID [2022-02-20 16:54:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:54:26,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170257919] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:54:26,547 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:54:26,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-02-20 16:54:26,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207146974] [2022-02-20 16:54:26,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:26,547 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-02-20 16:54:26,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:26,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:26,596 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 16:54:26,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 16:54:26,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:26,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 16:54:26,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:54:26,598 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:26,784 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-02-20 16:54:26,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:54:26,784 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-02-20 16:54:26,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-02-20 16:54:26,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-02-20 16:54:26,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-02-20 16:54:26,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:26,839 INFO L225 Difference]: With dead ends: 55 [2022-02-20 16:54:26,839 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 16:54:26,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:54:26,840 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 48 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:26,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 116 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:54:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 16:54:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2022-02-20 16:54:26,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:26,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:26,848 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:26,848 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:26,849 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-02-20 16:54:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-20 16:54:26,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:26,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:26,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 46 states. [2022-02-20 16:54:26,850 INFO L87 Difference]: Start difference. First operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 46 states. [2022-02-20 16:54:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:26,851 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-02-20 16:54:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-20 16:54:26,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:26,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:26,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:26,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:26,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-02-20 16:54:26,853 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 35 [2022-02-20 16:54:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:26,854 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-02-20 16:54:26,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-02-20 16:54:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 16:54:26,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:26,855 INFO L514 BasicCegarLoop]: trace histogram [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, 1] [2022-02-20 16:54:26,882 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 16:54:27,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:27,072 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:27,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1120694760, now seen corresponding path program 2 times [2022-02-20 16:54:27,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:27,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431140533] [2022-02-20 16:54:27,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:27,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:27,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {1109#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1109#true} is VALID [2022-02-20 16:54:27,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {1109#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {1109#true} assume true; {1109#true} is VALID [2022-02-20 16:54:27,193 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1109#true} {1109#true} #130#return; {1109#true} is VALID [2022-02-20 16:54:27,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:54:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:27,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {1109#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1109#true} is VALID [2022-02-20 16:54:27,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {1109#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {1109#true} assume true; {1109#true} is VALID [2022-02-20 16:54:27,201 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1109#true} {1109#true} #132#return; {1109#true} is VALID [2022-02-20 16:54:27,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {1109#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(19, 2); {1109#true} is VALID [2022-02-20 16:54:27,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {1109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {1109#true} is VALID [2022-02-20 16:54:27,202 INFO L272 TraceCheckUtils]: 2: Hoare triple {1109#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:54:27,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,202 INFO L290 TraceCheckUtils]: 4: Hoare triple {1109#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1109#true} is VALID [2022-02-20 16:54:27,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {1109#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {1109#true} assume true; {1109#true} is VALID [2022-02-20 16:54:27,202 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1109#true} {1109#true} #130#return; {1109#true} is VALID [2022-02-20 16:54:27,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {1109#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {1109#true} assume !!(dll_circular_create_~len#1 > 1); {1109#true} is VALID [2022-02-20 16:54:27,203 INFO L272 TraceCheckUtils]: 10: Hoare triple {1109#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:54:27,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {1109#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1109#true} is VALID [2022-02-20 16:54:27,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {1109#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {1109#true} assume true; {1109#true} is VALID [2022-02-20 16:54:27,204 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1109#true} {1109#true} #132#return; {1109#true} is VALID [2022-02-20 16:54:27,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {1109#true} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4); {1109#true} is VALID [2022-02-20 16:54:27,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {1109#true} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4); {1109#true} is VALID [2022-02-20 16:54:27,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {1109#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {1109#true} is VALID [2022-02-20 16:54:27,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {1109#true} assume !(dll_circular_create_~len#1 > 1); {1109#true} is VALID [2022-02-20 16:54:27,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {1109#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {1109#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {1121#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:54:27,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {1121#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {1121#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:54:27,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {1121#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(dll_circular_update_at_~index#1 > 0); {1121#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:54:27,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {1121#(= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, 8 + dll_circular_update_at_~head#1.offset, 4); {1121#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:54:27,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {1121#(= |ULTIMATE.start_main_~i~0#1| 0)} assume { :end_inline_dll_circular_update_at } true; {1121#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:54:27,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {1121#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1122#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:27,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {1122#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {1123#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ |ULTIMATE.start_main_~i~0#1| (* (- 1) |ULTIMATE.start_dll_circular_update_at_~index#1|)) 0))} is VALID [2022-02-20 16:54:27,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {1123#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ |ULTIMATE.start_main_~i~0#1| (* (- 1) |ULTIMATE.start_dll_circular_update_at_~index#1|)) 0))} assume !(dll_circular_update_at_~index#1 > 0); {1110#false} is VALID [2022-02-20 16:54:27,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {1110#false} call write~int(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, 8 + dll_circular_update_at_~head#1.offset, 4); {1110#false} is VALID [2022-02-20 16:54:27,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {1110#false} assume { :end_inline_dll_circular_update_at } true; {1110#false} is VALID [2022-02-20 16:54:27,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {1110#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1110#false} is VALID [2022-02-20 16:54:27,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {1110#false} assume !(main_~i~0#1 < main_~len~0#1); {1110#false} is VALID [2022-02-20 16:54:27,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {1110#false} main_~i~0#1 := 0; {1110#false} is VALID [2022-02-20 16:54:27,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {1110#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {1110#false} is VALID [2022-02-20 16:54:27,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {1110#false} assume !(dll_circular_get_data_at_~index#1 > 0); {1110#false} is VALID [2022-02-20 16:54:27,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {1110#false} call dll_circular_get_data_at_#t~mem11#1 := read~int(dll_circular_get_data_at_~head#1.base, 8 + dll_circular_get_data_at_~head#1.offset, 4);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {1110#false} is VALID [2022-02-20 16:54:27,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {1110#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {1110#false} is VALID [2022-02-20 16:54:27,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {1110#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {1110#false} is VALID [2022-02-20 16:54:27,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {1110#false} assume !false; {1110#false} is VALID [2022-02-20 16:54:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:54:27,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:27,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431140533] [2022-02-20 16:54:27,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431140533] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:27,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624314192] [2022-02-20 16:54:27,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:54:27,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:27,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:27,212 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 16:54:27,244 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 16:54:27,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:54:27,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:54:27,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:54:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:27,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:27,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {1109#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(19, 2); {1109#true} is VALID [2022-02-20 16:54:27,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {1109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {1109#true} is VALID [2022-02-20 16:54:27,481 INFO L272 TraceCheckUtils]: 2: Hoare triple {1109#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {1109#true} is VALID [2022-02-20 16:54:27,481 INFO L290 TraceCheckUtils]: 3: Hoare triple {1109#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,481 INFO L290 TraceCheckUtils]: 4: Hoare triple {1109#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1109#true} is VALID [2022-02-20 16:54:27,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {1109#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {1109#true} assume true; {1109#true} is VALID [2022-02-20 16:54:27,481 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1109#true} {1109#true} #130#return; {1109#true} is VALID [2022-02-20 16:54:27,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {1109#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {1109#true} assume !!(dll_circular_create_~len#1 > 1); {1109#true} is VALID [2022-02-20 16:54:27,481 INFO L272 TraceCheckUtils]: 10: Hoare triple {1109#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {1109#true} is VALID [2022-02-20 16:54:27,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {1109#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {1109#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1109#true} is VALID [2022-02-20 16:54:27,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {1109#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {1109#true} assume true; {1109#true} is VALID [2022-02-20 16:54:27,482 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1109#true} {1109#true} #132#return; {1109#true} is VALID [2022-02-20 16:54:27,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {1109#true} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4); {1109#true} is VALID [2022-02-20 16:54:27,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {1109#true} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4); {1109#true} is VALID [2022-02-20 16:54:27,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {1109#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {1109#true} is VALID [2022-02-20 16:54:27,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {1109#true} assume !(dll_circular_create_~len#1 > 1); {1109#true} is VALID [2022-02-20 16:54:27,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {1109#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {1109#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:27,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:27,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(dll_circular_update_at_~index#1 > 0); {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:27,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~int(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, 8 + dll_circular_update_at_~head#1.offset, 4); {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:27,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_dll_circular_update_at } true; {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:27,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1122#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:27,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {1122#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {1210#(<= 1 |ULTIMATE.start_dll_circular_update_at_~index#1|)} is VALID [2022-02-20 16:54:27,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {1210#(<= 1 |ULTIMATE.start_dll_circular_update_at_~index#1|)} assume !(dll_circular_update_at_~index#1 > 0); {1110#false} is VALID [2022-02-20 16:54:27,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {1110#false} call write~int(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, 8 + dll_circular_update_at_~head#1.offset, 4); {1110#false} is VALID [2022-02-20 16:54:27,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {1110#false} assume { :end_inline_dll_circular_update_at } true; {1110#false} is VALID [2022-02-20 16:54:27,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {1110#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1110#false} is VALID [2022-02-20 16:54:27,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {1110#false} assume !(main_~i~0#1 < main_~len~0#1); {1110#false} is VALID [2022-02-20 16:54:27,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {1110#false} main_~i~0#1 := 0; {1110#false} is VALID [2022-02-20 16:54:27,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {1110#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {1110#false} is VALID [2022-02-20 16:54:27,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {1110#false} assume !(dll_circular_get_data_at_~index#1 > 0); {1110#false} is VALID [2022-02-20 16:54:27,486 INFO L290 TraceCheckUtils]: 36: Hoare triple {1110#false} call dll_circular_get_data_at_#t~mem11#1 := read~int(dll_circular_get_data_at_~head#1.base, 8 + dll_circular_get_data_at_~head#1.offset, 4);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {1110#false} is VALID [2022-02-20 16:54:27,486 INFO L290 TraceCheckUtils]: 37: Hoare triple {1110#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {1110#false} is VALID [2022-02-20 16:54:27,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {1110#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {1110#false} is VALID [2022-02-20 16:54:27,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {1110#false} assume !false; {1110#false} is VALID [2022-02-20 16:54:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:54:27,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:27,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {1110#false} assume !false; {1110#false} is VALID [2022-02-20 16:54:27,594 INFO L290 TraceCheckUtils]: 38: Hoare triple {1110#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {1110#false} is VALID [2022-02-20 16:54:27,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {1110#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {1110#false} is VALID [2022-02-20 16:54:27,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {1110#false} call dll_circular_get_data_at_#t~mem11#1 := read~int(dll_circular_get_data_at_~head#1.base, 8 + dll_circular_get_data_at_~head#1.offset, 4);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {1110#false} is VALID [2022-02-20 16:54:27,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {1110#false} assume !(dll_circular_get_data_at_~index#1 > 0); {1110#false} is VALID [2022-02-20 16:54:27,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {1110#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {1110#false} is VALID [2022-02-20 16:54:27,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {1110#false} main_~i~0#1 := 0; {1110#false} is VALID [2022-02-20 16:54:27,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {1110#false} assume !(main_~i~0#1 < main_~len~0#1); {1110#false} is VALID [2022-02-20 16:54:27,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {1110#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1110#false} is VALID [2022-02-20 16:54:27,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {1110#false} assume { :end_inline_dll_circular_update_at } true; {1110#false} is VALID [2022-02-20 16:54:27,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {1110#false} call write~int(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, 8 + dll_circular_update_at_~head#1.offset, 4); {1110#false} is VALID [2022-02-20 16:54:27,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {1210#(<= 1 |ULTIMATE.start_dll_circular_update_at_~index#1|)} assume !(dll_circular_update_at_~index#1 > 0); {1110#false} is VALID [2022-02-20 16:54:27,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {1122#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {1210#(<= 1 |ULTIMATE.start_dll_circular_update_at_~index#1|)} is VALID [2022-02-20 16:54:27,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1122#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:27,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_dll_circular_update_at } true; {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:27,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~int(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, 8 + dll_circular_update_at_~head#1.offset, 4); {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:27,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(dll_circular_update_at_~index#1 > 0); {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:27,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:27,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {1109#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {1191#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:27,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {1109#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {1109#true} assume !(dll_circular_create_~len#1 > 1); {1109#true} is VALID [2022-02-20 16:54:27,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {1109#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {1109#true} is VALID [2022-02-20 16:54:27,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {1109#true} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4); {1109#true} is VALID [2022-02-20 16:54:27,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {1109#true} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4); {1109#true} is VALID [2022-02-20 16:54:27,600 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1109#true} {1109#true} #132#return; {1109#true} is VALID [2022-02-20 16:54:27,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {1109#true} assume true; {1109#true} is VALID [2022-02-20 16:54:27,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {1109#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {1109#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1109#true} is VALID [2022-02-20 16:54:27,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {1109#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,601 INFO L272 TraceCheckUtils]: 10: Hoare triple {1109#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {1109#true} is VALID [2022-02-20 16:54:27,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {1109#true} assume !!(dll_circular_create_~len#1 > 1); {1109#true} is VALID [2022-02-20 16:54:27,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {1109#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,601 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1109#true} {1109#true} #130#return; {1109#true} is VALID [2022-02-20 16:54:27,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {1109#true} assume true; {1109#true} is VALID [2022-02-20 16:54:27,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {1109#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,602 INFO L290 TraceCheckUtils]: 4: Hoare triple {1109#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1109#true} is VALID [2022-02-20 16:54:27,602 INFO L290 TraceCheckUtils]: 3: Hoare triple {1109#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1109#true} is VALID [2022-02-20 16:54:27,602 INFO L272 TraceCheckUtils]: 2: Hoare triple {1109#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {1109#true} is VALID [2022-02-20 16:54:27,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {1109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {1109#true} is VALID [2022-02-20 16:54:27,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {1109#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(19, 2); {1109#true} is VALID [2022-02-20 16:54:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:54:27,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624314192] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:54:27,603 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:54:27,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-02-20 16:54:27,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646067892] [2022-02-20 16:54:27,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:27,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-02-20 16:54:27,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:27,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:27,634 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 16:54:27,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:54:27,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:27,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:54:27,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:54:27,635 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:27,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:27,815 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-02-20 16:54:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:54:27,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-02-20 16:54:27,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-02-20 16:54:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-02-20 16:54:27,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-02-20 16:54:27,862 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 16:54:27,863 INFO L225 Difference]: With dead ends: 60 [2022-02-20 16:54:27,863 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 16:54:27,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:54:27,864 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 42 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:27,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 140 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:54:27,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 16:54:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2022-02-20 16:54:27,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:27,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:27,877 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:27,877 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:27,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:27,878 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-02-20 16:54:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-20 16:54:27,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:27,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:27,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 46 states. [2022-02-20 16:54:27,879 INFO L87 Difference]: Start difference. First operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 46 states. [2022-02-20 16:54:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:27,880 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-02-20 16:54:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-20 16:54:27,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:27,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:27,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:27,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-02-20 16:54:27,882 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 40 [2022-02-20 16:54:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:27,882 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-02-20 16:54:27,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 16:54:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 16:54:27,883 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:27,883 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2022-02-20 16:54:27,909 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 16:54:28,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:28,096 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:28,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:28,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2115896417, now seen corresponding path program 1 times [2022-02-20 16:54:28,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:28,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143737486] [2022-02-20 16:54:28,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:28,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:28,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:28,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1626#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:54:28,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {1626#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1626#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:54:28,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {1626#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1627#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:54:28,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {1627#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {1627#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:54:28,671 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1627#(= (select |#valid| |node_create_#res#1.base|) 1)} {1595#true} #130#return; {1602#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 16:54:28,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:54:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:28,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1628#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:28,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {1628#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1628#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:28,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {1628#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1629#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 16:54:28,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {1629#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} assume true; {1629#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 16:54:28,720 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1629#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} {1603#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} #132#return; {1609#(and (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 16:54:28,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {1595#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(19, 2); {1595#true} is VALID [2022-02-20 16:54:28,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {1595#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {1595#true} is VALID [2022-02-20 16:54:28,721 INFO L272 TraceCheckUtils]: 2: Hoare triple {1595#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {1625#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:54:28,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {1625#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1626#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:54:28,722 INFO L290 TraceCheckUtils]: 4: Hoare triple {1626#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1626#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:54:28,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {1626#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1627#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:54:28,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {1627#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {1627#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:54:28,723 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1627#(= (select |#valid| |node_create_#res#1.base|) 1)} {1595#true} #130#return; {1602#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 16:54:28,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {1602#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {1603#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 16:54:28,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {1603#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} assume !!(dll_circular_create_~len#1 > 1); {1603#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 16:54:28,725 INFO L272 TraceCheckUtils]: 10: Hoare triple {1603#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {1625#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:54:28,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {1625#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1628#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:28,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {1628#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1628#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:28,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {1628#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1629#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 16:54:28,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {1629#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} assume true; {1629#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 16:54:28,728 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1629#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} {1603#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} #132#return; {1609#(and (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 16:54:28,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {1609#(and (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4); {1610#(and (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {1610#(and (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4); {1611#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {1611#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {1612#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 16:54:28,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {1612#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} assume !(dll_circular_create_~len#1 > 1); {1612#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 16:54:28,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {1612#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {1613#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|) |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0))} is VALID [2022-02-20 16:54:28,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {1613#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|) |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0))} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {1614#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {1614#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {1615#(and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_dll_circular_update_at_~data#1|) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {1615#(and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_dll_circular_update_at_~data#1|) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(dll_circular_update_at_~index#1 > 0); {1615#(and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_dll_circular_update_at_~data#1|) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {1615#(and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_dll_circular_update_at_~data#1|) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} call write~int(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, 8 + dll_circular_update_at_~head#1.offset, 4); {1616#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {1616#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_dll_circular_update_at } true; {1616#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {1616#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1617#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {1617#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {1618#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {1618#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(dll_circular_update_at_~index#1 > 0);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#t~post13#1 - 1;havoc dll_circular_update_at_#t~post13#1; {1619#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (not (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {1619#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (not (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(dll_circular_update_at_~index#1 > 0); {1619#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (not (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {1619#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (not (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} call write~int(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, 8 + dll_circular_update_at_~head#1.offset, 4); {1620#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {1620#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_dll_circular_update_at } true; {1620#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {1620#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1620#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {1620#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_~i~0#1 < main_~len~0#1); {1620#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {1620#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_~i~0#1 := 0; {1621#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:54:28,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {1621#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {1622#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:54:28,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {1622#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_main_~expected~0#1|))} assume !(dll_circular_get_data_at_~index#1 > 0); {1622#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:54:28,747 INFO L290 TraceCheckUtils]: 37: Hoare triple {1622#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_main_~expected~0#1|))} call dll_circular_get_data_at_#t~mem11#1 := read~int(dll_circular_get_data_at_~head#1.base, 8 + dll_circular_get_data_at_~head#1.offset, 4);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {1623#(and (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:54:28,747 INFO L290 TraceCheckUtils]: 38: Hoare triple {1623#(and (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|))} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {1624#(and (< |ULTIMATE.start_main_#t~ret17#1| (+ |ULTIMATE.start_main_~expected~0#1| 1)) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|))} is VALID [2022-02-20 16:54:28,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {1624#(and (< |ULTIMATE.start_main_#t~ret17#1| (+ |ULTIMATE.start_main_~expected~0#1| 1)) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|))} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {1596#false} is VALID [2022-02-20 16:54:28,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {1596#false} assume !false; {1596#false} is VALID [2022-02-20 16:54:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:54:28,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:28,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143737486] [2022-02-20 16:54:28,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143737486] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:28,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052325312] [2022-02-20 16:54:28,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:28,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:28,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:28,750 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 16:54:28,751 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 16:54:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:28,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 100 conjunts are in the unsatisfiable core [2022-02-20 16:54:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:28,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:28,910 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 16:54:29,057 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 16:54:29,058 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 16:54:29,102 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 11 treesize of output 7 [2022-02-20 16:54:29,157 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 16:54:29,157 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 26 treesize of output 27 [2022-02-20 16:54:29,278 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 16:54:29,297 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 16:54:29,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:29,492 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_44| at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:54:29,495 INFO L158 Benchmark]: Toolchain (without parser) took 6062.43ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 50.6MB in the beginning and 83.2MB in the end (delta: -32.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:54:29,495 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:54:29,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.89ms. Allocated memory is still 94.4MB. Free memory was 50.3MB in the beginning and 63.2MB in the end (delta: -12.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:54:29,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.49ms. Allocated memory is still 94.4MB. Free memory was 63.2MB in the beginning and 60.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:54:29,496 INFO L158 Benchmark]: Boogie Preprocessor took 34.16ms. Allocated memory is still 94.4MB. Free memory was 60.9MB in the beginning and 58.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:54:29,496 INFO L158 Benchmark]: RCFGBuilder took 363.25ms. Allocated memory is still 94.4MB. Free memory was 58.8MB in the beginning and 41.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 16:54:29,496 INFO L158 Benchmark]: TraceAbstraction took 5222.19ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 40.9MB in the beginning and 83.2MB in the end (delta: -42.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:54:29,497 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.89ms. Allocated memory is still 94.4MB. Free memory was 50.3MB in the beginning and 63.2MB in the end (delta: -12.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.49ms. Allocated memory is still 94.4MB. Free memory was 63.2MB in the beginning and 60.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.16ms. Allocated memory is still 94.4MB. Free memory was 60.9MB in the beginning and 58.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 363.25ms. Allocated memory is still 94.4MB. Free memory was 58.8MB in the beginning and 41.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5222.19ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 40.9MB in the beginning and 83.2MB in the end (delta: -42.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_44| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_44|: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:54:29,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:54:31,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:54:31,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:54:31,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:54:31,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:54:31,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:54:31,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:54:31,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:54:31,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:54:31,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:54:31,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:54:31,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:54:31,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:54:31,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:54:31,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:54:31,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:54:31,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:54:31,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:54:31,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:54:31,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:54:31,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:54:31,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:54:31,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:54:31,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:54:31,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:54:31,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:54:31,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:54:31,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:54:31,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:54:31,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:54:31,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:54:31,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:54:31,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:54:31,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:54:31,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:54:31,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:54:31,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:54:31,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:54:31,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:54:31,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:54:31,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:54:31,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:54:31,270 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:54:31,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:54:31,273 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:54:31,273 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:54:31,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:54:31,274 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:54:31,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:54:31,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:54:31,275 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:54:31,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:54:31,276 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:54:31,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:54:31,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:54:31,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:54:31,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:54:31,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:54:31,277 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:54:31,277 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:54:31,278 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:54:31,278 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:54:31,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:54:31,278 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:54:31,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:54:31,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:54:31,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:54:31,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:54:31,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:31,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:54:31,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:54:31,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:54:31,288 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:54:31,288 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:54:31,289 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:54:31,289 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:54:31,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:54:31,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:54:31,290 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 ! call(reach_error())) ) 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2022-02-20 16:54:31,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:54:31,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:54:31,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:54:31,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:54:31,579 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:54:31,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all.i [2022-02-20 16:54:31,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/152310c33/fb93cce73d094840b6af29df4ad605b0/FLAGf052f58ca [2022-02-20 16:54:32,005 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:54:32,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2022-02-20 16:54:32,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/152310c33/fb93cce73d094840b6af29df4ad605b0/FLAGf052f58ca [2022-02-20 16:54:32,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/152310c33/fb93cce73d094840b6af29df4ad605b0 [2022-02-20 16:54:32,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:54:32,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:54:32,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:32,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:54:32,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:54:32,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:32" (1/1) ... [2022-02-20 16:54:32,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73334194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:32, skipping insertion in model container [2022-02-20 16:54:32,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:32" (1/1) ... [2022-02-20 16:54:32,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:54:32,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:54:32,372 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/dll2c_update_all.i[24538,24551] [2022-02-20 16:54:32,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:32,401 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:54:32,448 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/dll2c_update_all.i[24538,24551] [2022-02-20 16:54:32,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:32,480 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:54:32,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:32 WrapperNode [2022-02-20 16:54:32,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:32,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:32,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:54:32,483 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:54:32,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:32" (1/1) ... [2022-02-20 16:54:32,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:32" (1/1) ... [2022-02-20 16:54:32,518 INFO L137 Inliner]: procedures = 129, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-02-20 16:54:32,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:32,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:54:32,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:54:32,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:54:32,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:32" (1/1) ... [2022-02-20 16:54:32,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:32" (1/1) ... [2022-02-20 16:54:32,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:32" (1/1) ... [2022-02-20 16:54:32,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:32" (1/1) ... [2022-02-20 16:54:32,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:32" (1/1) ... [2022-02-20 16:54:32,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:32" (1/1) ... [2022-02-20 16:54:32,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:32" (1/1) ... [2022-02-20 16:54:32,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:54:32,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:54:32,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:54:32,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:54:32,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:32" (1/1) ... [2022-02-20 16:54:32,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:32,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:32,590 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 16:54:32,608 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 16:54:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:54:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 16:54:32,630 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 16:54:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:54:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:54:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:54:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:54:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:54:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:54:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:54:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:54:32,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:54:32,718 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:54:32,725 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:54:33,037 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:54:33,042 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:54:33,042 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:54:33,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:33 BoogieIcfgContainer [2022-02-20 16:54:33,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:54:33,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:54:33,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:54:33,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:54:33,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:54:32" (1/3) ... [2022-02-20 16:54:33,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8754177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:33, skipping insertion in model container [2022-02-20 16:54:33,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:32" (2/3) ... [2022-02-20 16:54:33,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8754177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:33, skipping insertion in model container [2022-02-20 16:54:33,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:33" (3/3) ... [2022-02-20 16:54:33,048 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2022-02-20 16:54:33,051 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:54:33,051 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:54:33,076 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:54:33,080 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 16:54:33,080 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:54:33,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:33,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:54:33,104 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:33,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:33,105 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:33,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:33,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1387430191, now seen corresponding path program 1 times [2022-02-20 16:54:33,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:33,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814353345] [2022-02-20 16:54:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:33,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:33,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:33,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:54:33,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:54:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:33,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:54:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:33,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:33,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {42#true} is VALID [2022-02-20 16:54:33,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {42#true} is VALID [2022-02-20 16:54:33,330 INFO L272 TraceCheckUtils]: 2: Hoare triple {42#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {42#true} is VALID [2022-02-20 16:54:33,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {42#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {42#true} is VALID [2022-02-20 16:54:33,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {42#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {42#true} is VALID [2022-02-20 16:54:33,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {42#true} is VALID [2022-02-20 16:54:33,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#true} assume true; {42#true} is VALID [2022-02-20 16:54:33,331 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {42#true} {42#true} #130#return; {42#true} is VALID [2022-02-20 16:54:33,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {42#true} is VALID [2022-02-20 16:54:33,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#true} assume !true; {43#false} is VALID [2022-02-20 16:54:33,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {43#false} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {43#false} is VALID [2022-02-20 16:54:33,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {43#false} is VALID [2022-02-20 16:54:33,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {43#false} is VALID [2022-02-20 16:54:33,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} main_~i~0#1 := 0bv32; {43#false} is VALID [2022-02-20 16:54:33,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {43#false} is VALID [2022-02-20 16:54:33,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {43#false} is VALID [2022-02-20 16:54:33,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {43#false} is VALID [2022-02-20 16:54:33,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {43#false} is VALID [2022-02-20 16:54:33,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {43#false} is VALID [2022-02-20 16:54:33,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-02-20 16:54:33,338 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 16:54:33,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:54:33,338 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:33,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814353345] [2022-02-20 16:54:33,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814353345] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:33,339 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:33,339 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:54:33,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935092064] [2022-02-20 16:54:33,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:33,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 16:54:33,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:33,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:33,369 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 16:54:33,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:54:33,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:33,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:54:33,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:54:33,390 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:33,478 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-02-20 16:54:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:54:33,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 16:54:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2022-02-20 16:54:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2022-02-20 16:54:33,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 90 transitions. [2022-02-20 16:54:33,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:33,580 INFO L225 Difference]: With dead ends: 63 [2022-02-20 16:54:33,581 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:54:33,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:54:33,587 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:33,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:54:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 16:54:33,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:33,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:33,610 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:33,610 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:33,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:33,615 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:54:33,616 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:54:33,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:33,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:33,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-02-20 16:54:33,619 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-02-20 16:54:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:33,624 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:54:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:54:33,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:33,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:33,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:33,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 16:54:33,627 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2022-02-20 16:54:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:33,627 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 16:54:33,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:54:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:54:33,628 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:33,628 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:33,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:33,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:54:33,836 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:33,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash 498100996, now seen corresponding path program 1 times [2022-02-20 16:54:33,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:33,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322013931] [2022-02-20 16:54:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:33,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:33,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:33,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:54:33,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:54:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:33,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:54:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:33,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:34,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {290#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {290#true} is VALID [2022-02-20 16:54:34,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {298#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:54:34,003 INFO L272 TraceCheckUtils]: 2: Hoare triple {298#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {290#true} is VALID [2022-02-20 16:54:34,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {290#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {290#true} is VALID [2022-02-20 16:54:34,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {290#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {290#true} is VALID [2022-02-20 16:54:34,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {290#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {290#true} is VALID [2022-02-20 16:54:34,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {290#true} assume true; {290#true} is VALID [2022-02-20 16:54:34,005 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {290#true} {298#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} #130#return; {298#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:54:34,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {298#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {298#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:54:34,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {298#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {291#false} is VALID [2022-02-20 16:54:34,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {291#false} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {291#false} is VALID [2022-02-20 16:54:34,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {291#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {291#false} is VALID [2022-02-20 16:54:34,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {291#false} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {291#false} is VALID [2022-02-20 16:54:34,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {291#false} main_~i~0#1 := 0bv32; {291#false} is VALID [2022-02-20 16:54:34,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {291#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {291#false} is VALID [2022-02-20 16:54:34,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {291#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {291#false} is VALID [2022-02-20 16:54:34,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {291#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {291#false} is VALID [2022-02-20 16:54:34,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {291#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {291#false} is VALID [2022-02-20 16:54:34,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {291#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {291#false} is VALID [2022-02-20 16:54:34,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {291#false} assume !false; {291#false} is VALID [2022-02-20 16:54:34,008 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 16:54:34,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:54:34,008 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:34,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322013931] [2022-02-20 16:54:34,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322013931] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:34,009 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:34,009 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:54:34,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081627995] [2022-02-20 16:54:34,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:34,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 16:54:34,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:34,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:34,028 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 16:54:34,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:54:34,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:34,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:54:34,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:54:34,030 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:34,168 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-02-20 16:54:34,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:54:34,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 16:54:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 16:54:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 16:54:34,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-02-20 16:54:34,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:34,231 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:54:34,231 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 16:54:34,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 16:54:34,232 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 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 16:54:34,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:34,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 16:54:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-02-20 16:54:34,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:34,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:34,235 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:34,235 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:34,237 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-02-20 16:54:34,237 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-02-20 16:54:34,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:34,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:34,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-02-20 16:54:34,238 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-02-20 16:54:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:34,242 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-02-20 16:54:34,242 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-02-20 16:54:34,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:34,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:34,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:34,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-02-20 16:54:34,246 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-02-20 16:54:34,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:34,246 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-20 16:54:34,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:54:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 16:54:34,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 16:54:34,247 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:34,247 INFO L514 BasicCegarLoop]: trace histogram [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 16:54:34,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:34,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:54:34,458 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash 698671896, now seen corresponding path program 1 times [2022-02-20 16:54:34,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:34,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683983547] [2022-02-20 16:54:34,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:34,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:34,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:34,461 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:54:34,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:54:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:34,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:54:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:34,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:34,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {536#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {536#true} is VALID [2022-02-20 16:54:34,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {536#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:34,698 INFO L272 TraceCheckUtils]: 2: Hoare triple {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {536#true} is VALID [2022-02-20 16:54:34,698 INFO L290 TraceCheckUtils]: 3: Hoare triple {536#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {536#true} is VALID [2022-02-20 16:54:34,698 INFO L290 TraceCheckUtils]: 4: Hoare triple {536#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {536#true} is VALID [2022-02-20 16:54:34,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {536#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {536#true} is VALID [2022-02-20 16:54:34,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {536#true} assume true; {536#true} is VALID [2022-02-20 16:54:34,699 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {536#true} {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} #130#return; {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:34,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:34,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:34,704 INFO L272 TraceCheckUtils]: 10: Hoare triple {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {536#true} is VALID [2022-02-20 16:54:34,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {536#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {536#true} is VALID [2022-02-20 16:54:34,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {536#true} is VALID [2022-02-20 16:54:34,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {536#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {536#true} is VALID [2022-02-20 16:54:34,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {536#true} assume true; {536#true} is VALID [2022-02-20 16:54:34,707 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {536#true} {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} #132#return; {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:34,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:34,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:34,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:34,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:34,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:34,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {544#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {605#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:34,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {605#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {537#false} is VALID [2022-02-20 16:54:34,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {537#false} main_~i~0#1 := 0bv32; {537#false} is VALID [2022-02-20 16:54:34,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {537#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {537#false} is VALID [2022-02-20 16:54:34,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {537#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {537#false} is VALID [2022-02-20 16:54:34,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {537#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {537#false} is VALID [2022-02-20 16:54:34,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {537#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {537#false} is VALID [2022-02-20 16:54:34,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {537#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {537#false} is VALID [2022-02-20 16:54:34,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {537#false} assume !false; {537#false} is VALID [2022-02-20 16:54:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:54:34,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:54:34,712 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:34,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683983547] [2022-02-20 16:54:34,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683983547] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:34,713 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:34,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:54:34,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820935744] [2022-02-20 16:54:34,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:34,716 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-02-20 16:54:34,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:34,717 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:34,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:34,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:54:34,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:34,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:54:34,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:54:34,744 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:34,901 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-02-20 16:54:34,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:54:34,901 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-02-20 16:54:34,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:34,901 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-02-20 16:54:34,903 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-02-20 16:54:34,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-02-20 16:54:34,965 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 16:54:34,967 INFO L225 Difference]: With dead ends: 53 [2022-02-20 16:54:34,967 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 16:54:34,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:54:34,968 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:34,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 57 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:34,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 16:54:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-02-20 16:54:34,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:34,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:34,972 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:34,972 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:34,974 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-02-20 16:54:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-02-20 16:54:34,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:34,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:34,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 44 states. [2022-02-20 16:54:34,975 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 44 states. [2022-02-20 16:54:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:34,977 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-02-20 16:54:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-02-20 16:54:34,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:34,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:34,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:34,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-02-20 16:54:34,979 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 30 [2022-02-20 16:54:34,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:34,979 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-02-20 16:54:34,980 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:34,980 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 16:54:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 16:54:34,980 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:34,981 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-02-20 16:54:34,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 16:54:35,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:54:35,190 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:35,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:35,190 INFO L85 PathProgramCache]: Analyzing trace with hash 143562896, now seen corresponding path program 1 times [2022-02-20 16:54:35,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:35,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83279843] [2022-02-20 16:54:35,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:35,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:35,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:35,192 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:54:35,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:54:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:35,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:54:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:35,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:35,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {837#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {837#true} is VALID [2022-02-20 16:54:35,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,465 INFO L272 TraceCheckUtils]: 2: Hoare triple {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {837#true} is VALID [2022-02-20 16:54:35,465 INFO L290 TraceCheckUtils]: 3: Hoare triple {837#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {837#true} is VALID [2022-02-20 16:54:35,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {837#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {837#true} is VALID [2022-02-20 16:54:35,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {837#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {837#true} is VALID [2022-02-20 16:54:35,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {837#true} assume true; {837#true} is VALID [2022-02-20 16:54:35,466 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {837#true} {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} #130#return; {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,466 INFO L272 TraceCheckUtils]: 10: Hoare triple {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {837#true} is VALID [2022-02-20 16:54:35,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {837#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {837#true} is VALID [2022-02-20 16:54:35,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {837#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {837#true} is VALID [2022-02-20 16:54:35,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {837#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {837#true} is VALID [2022-02-20 16:54:35,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#true} assume true; {837#true} is VALID [2022-02-20 16:54:35,468 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {837#true} {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} #132#return; {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {845#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {906#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:35,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {906#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {906#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:35,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {906#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {906#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:35,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {906#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {906#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:35,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {906#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume { :end_inline_dll_circular_update_at } true; {906#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:35,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {906#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {922#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:35,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {922#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {838#false} is VALID [2022-02-20 16:54:35,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {838#false} main_~i~0#1 := 0bv32; {838#false} is VALID [2022-02-20 16:54:35,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {838#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {838#false} is VALID [2022-02-20 16:54:35,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {838#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {838#false} is VALID [2022-02-20 16:54:35,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {838#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {838#false} is VALID [2022-02-20 16:54:35,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {838#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {838#false} is VALID [2022-02-20 16:54:35,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {838#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {838#false} is VALID [2022-02-20 16:54:35,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {838#false} assume !false; {838#false} is VALID [2022-02-20 16:54:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:54:35,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:35,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {838#false} assume !false; {838#false} is VALID [2022-02-20 16:54:35,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {838#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {838#false} is VALID [2022-02-20 16:54:35,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {838#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {838#false} is VALID [2022-02-20 16:54:35,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {838#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {838#false} is VALID [2022-02-20 16:54:35,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {838#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {838#false} is VALID [2022-02-20 16:54:35,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {838#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {838#false} is VALID [2022-02-20 16:54:35,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {838#false} main_~i~0#1 := 0bv32; {838#false} is VALID [2022-02-20 16:54:35,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {968#(bvslt |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {838#false} is VALID [2022-02-20 16:54:35,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {972#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {968#(bvslt |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {972#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)} assume { :end_inline_dll_circular_update_at } true; {972#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {972#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {972#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {972#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {972#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {972#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {972#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {972#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,636 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {837#true} {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} #132#return; {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#true} assume true; {837#true} is VALID [2022-02-20 16:54:35,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {837#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {837#true} is VALID [2022-02-20 16:54:35,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {837#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {837#true} is VALID [2022-02-20 16:54:35,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {837#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {837#true} is VALID [2022-02-20 16:54:35,637 INFO L272 TraceCheckUtils]: 10: Hoare triple {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {837#true} is VALID [2022-02-20 16:54:35,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,638 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {837#true} {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} #130#return; {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {837#true} assume true; {837#true} is VALID [2022-02-20 16:54:35,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {837#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {837#true} is VALID [2022-02-20 16:54:35,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {837#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {837#true} is VALID [2022-02-20 16:54:35,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {837#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {837#true} is VALID [2022-02-20 16:54:35,638 INFO L272 TraceCheckUtils]: 2: Hoare triple {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {837#true} is VALID [2022-02-20 16:54:35,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {988#(bvslt (_ bv1 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:35,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {837#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {837#true} is VALID [2022-02-20 16:54:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:54:35,639 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:35,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83279843] [2022-02-20 16:54:35,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83279843] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:54:35,639 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:54:35,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 16:54:35,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334119220] [2022-02-20 16:54:35,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:35,640 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-02-20 16:54:35,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:35,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:35,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:35,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:54:35,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:35,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:54:35,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:54:35,706 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:36,094 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-02-20 16:54:36,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:54:36,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-02-20 16:54:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:36,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-02-20 16:54:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-02-20 16:54:36,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2022-02-20 16:54:36,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:36,167 INFO L225 Difference]: With dead ends: 66 [2022-02-20 16:54:36,167 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 16:54:36,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:54:36,168 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 154 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:36,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 101 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:54:36,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 16:54:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2022-02-20 16:54:36,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:36,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:36,172 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:36,172 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:36,174 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-02-20 16:54:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-02-20 16:54:36,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:36,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:36,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-02-20 16:54:36,175 INFO L87 Difference]: Start difference. First operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-02-20 16:54:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:36,176 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-02-20 16:54:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-02-20 16:54:36,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:36,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:36,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:36,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-02-20 16:54:36,178 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 35 [2022-02-20 16:54:36,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:36,178 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-02-20 16:54:36,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-02-20 16:54:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 16:54:36,179 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:36,179 INFO L514 BasicCegarLoop]: trace histogram [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, 1] [2022-02-20 16:54:36,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 16:54:36,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:54:36,392 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:36,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1120694760, now seen corresponding path program 2 times [2022-02-20 16:54:36,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:36,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075046271] [2022-02-20 16:54:36,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:54:36,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:36,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:36,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:54:36,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:54:36,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:54:36,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:54:36,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:54:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:36,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:36,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {1313#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {1313#true} is VALID [2022-02-20 16:54:36,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {1313#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {1313#true} is VALID [2022-02-20 16:54:36,654 INFO L272 TraceCheckUtils]: 2: Hoare triple {1313#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {1313#true} is VALID [2022-02-20 16:54:36,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {1313#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1313#true} is VALID [2022-02-20 16:54:36,655 INFO L290 TraceCheckUtils]: 4: Hoare triple {1313#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1313#true} is VALID [2022-02-20 16:54:36,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {1313#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1313#true} is VALID [2022-02-20 16:54:36,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {1313#true} assume true; {1313#true} is VALID [2022-02-20 16:54:36,655 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1313#true} {1313#true} #130#return; {1313#true} is VALID [2022-02-20 16:54:36,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {1313#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {1313#true} is VALID [2022-02-20 16:54:36,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {1313#true} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {1313#true} is VALID [2022-02-20 16:54:36,655 INFO L272 TraceCheckUtils]: 10: Hoare triple {1313#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {1313#true} is VALID [2022-02-20 16:54:36,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1313#true} is VALID [2022-02-20 16:54:36,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {1313#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1313#true} is VALID [2022-02-20 16:54:36,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {1313#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1313#true} is VALID [2022-02-20 16:54:36,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {1313#true} assume true; {1313#true} is VALID [2022-02-20 16:54:36,655 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1313#true} {1313#true} #132#return; {1313#true} is VALID [2022-02-20 16:54:36,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {1313#true} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {1313#true} is VALID [2022-02-20 16:54:36,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {1313#true} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {1313#true} is VALID [2022-02-20 16:54:36,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {1313#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {1313#true} is VALID [2022-02-20 16:54:36,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {1313#true} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {1313#true} is VALID [2022-02-20 16:54:36,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {1313#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {1313#true} is VALID [2022-02-20 16:54:36,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {1313#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {1381#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:36,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {1381#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {1381#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:36,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {1381#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {1381#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:36,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {1381#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {1381#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:36,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {1381#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume { :end_inline_dll_circular_update_at } true; {1381#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:36,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {1381#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {1397#(= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))} is VALID [2022-02-20 16:54:36,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {1397#(= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {1401#(= (_ bv1 32) |ULTIMATE.start_dll_circular_update_at_~index#1|)} is VALID [2022-02-20 16:54:36,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {1401#(= (_ bv1 32) |ULTIMATE.start_dll_circular_update_at_~index#1|)} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {1314#false} is VALID [2022-02-20 16:54:36,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {1314#false} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {1314#false} is VALID [2022-02-20 16:54:36,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {1314#false} assume { :end_inline_dll_circular_update_at } true; {1314#false} is VALID [2022-02-20 16:54:36,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {1314#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {1314#false} is VALID [2022-02-20 16:54:36,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {1314#false} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {1314#false} is VALID [2022-02-20 16:54:36,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {1314#false} main_~i~0#1 := 0bv32; {1314#false} is VALID [2022-02-20 16:54:36,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {1314#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {1314#false} is VALID [2022-02-20 16:54:36,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {1314#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {1314#false} is VALID [2022-02-20 16:54:36,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {1314#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {1314#false} is VALID [2022-02-20 16:54:36,660 INFO L290 TraceCheckUtils]: 37: Hoare triple {1314#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {1314#false} is VALID [2022-02-20 16:54:36,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {1314#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {1314#false} is VALID [2022-02-20 16:54:36,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {1314#false} assume !false; {1314#false} is VALID [2022-02-20 16:54:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:54:36,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:36,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {1314#false} assume !false; {1314#false} is VALID [2022-02-20 16:54:36,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {1314#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {1314#false} is VALID [2022-02-20 16:54:36,777 INFO L290 TraceCheckUtils]: 37: Hoare triple {1314#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {1314#false} is VALID [2022-02-20 16:54:36,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {1314#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {1314#false} is VALID [2022-02-20 16:54:36,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {1314#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {1314#false} is VALID [2022-02-20 16:54:36,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {1314#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {1314#false} is VALID [2022-02-20 16:54:36,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {1314#false} main_~i~0#1 := 0bv32; {1314#false} is VALID [2022-02-20 16:54:36,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {1314#false} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {1314#false} is VALID [2022-02-20 16:54:36,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {1314#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {1314#false} is VALID [2022-02-20 16:54:36,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {1314#false} assume { :end_inline_dll_circular_update_at } true; {1314#false} is VALID [2022-02-20 16:54:36,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {1314#false} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {1314#false} is VALID [2022-02-20 16:54:36,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {1471#(bvsgt |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {1314#false} is VALID [2022-02-20 16:54:36,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {1475#(bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {1471#(bvsgt |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))} is VALID [2022-02-20 16:54:36,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {1479#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {1475#(bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:36,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {1479#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} assume { :end_inline_dll_circular_update_at } true; {1479#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} is VALID [2022-02-20 16:54:36,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {1479#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {1479#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} is VALID [2022-02-20 16:54:36,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {1479#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {1479#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} is VALID [2022-02-20 16:54:36,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {1479#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {1479#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} is VALID [2022-02-20 16:54:36,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {1313#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {1479#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} is VALID [2022-02-20 16:54:36,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {1313#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {1313#true} is VALID [2022-02-20 16:54:36,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {1313#true} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {1313#true} is VALID [2022-02-20 16:54:36,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {1313#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {1313#true} is VALID [2022-02-20 16:54:36,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {1313#true} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {1313#true} is VALID [2022-02-20 16:54:36,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {1313#true} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {1313#true} is VALID [2022-02-20 16:54:36,783 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1313#true} {1313#true} #132#return; {1313#true} is VALID [2022-02-20 16:54:36,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {1313#true} assume true; {1313#true} is VALID [2022-02-20 16:54:36,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {1313#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1313#true} is VALID [2022-02-20 16:54:36,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {1313#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1313#true} is VALID [2022-02-20 16:54:36,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1313#true} is VALID [2022-02-20 16:54:36,784 INFO L272 TraceCheckUtils]: 10: Hoare triple {1313#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {1313#true} is VALID [2022-02-20 16:54:36,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {1313#true} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {1313#true} is VALID [2022-02-20 16:54:36,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {1313#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {1313#true} is VALID [2022-02-20 16:54:36,784 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1313#true} {1313#true} #130#return; {1313#true} is VALID [2022-02-20 16:54:36,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {1313#true} assume true; {1313#true} is VALID [2022-02-20 16:54:36,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {1313#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1313#true} is VALID [2022-02-20 16:54:36,784 INFO L290 TraceCheckUtils]: 4: Hoare triple {1313#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1313#true} is VALID [2022-02-20 16:54:36,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {1313#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1313#true} is VALID [2022-02-20 16:54:36,784 INFO L272 TraceCheckUtils]: 2: Hoare triple {1313#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {1313#true} is VALID [2022-02-20 16:54:36,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {1313#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {1313#true} is VALID [2022-02-20 16:54:36,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {1313#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {1313#true} is VALID [2022-02-20 16:54:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:54:36,785 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:36,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075046271] [2022-02-20 16:54:36,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075046271] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:54:36,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:54:36,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 16:54:36,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361528658] [2022-02-20 16:54:36,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:36,786 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-02-20 16:54:36,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:36,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:36,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:36,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:54:36,824 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:36,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:54:36,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:54:36,825 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:37,460 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2022-02-20 16:54:37,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:54:37,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-02-20 16:54:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-02-20 16:54:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-02-20 16:54:37,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 91 transitions. [2022-02-20 16:54:37,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:37,542 INFO L225 Difference]: With dead ends: 76 [2022-02-20 16:54:37,542 INFO L226 Difference]: Without dead ends: 62 [2022-02-20 16:54:37,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:54:37,543 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 49 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:37,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 227 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:54:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-20 16:54:37,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 38. [2022-02-20 16:54:37,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:37,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:37,548 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:37,548 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:37,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:37,549 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-02-20 16:54:37,549 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-02-20 16:54:37,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:37,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:37,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 62 states. [2022-02-20 16:54:37,550 INFO L87 Difference]: Start difference. First operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 62 states. [2022-02-20 16:54:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:37,551 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-02-20 16:54:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-02-20 16:54:37,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:37,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:37,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:37,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:54:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-02-20 16:54:37,553 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 40 [2022-02-20 16:54:37,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:37,553 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-02-20 16:54:37,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 16:54:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 16:54:37,554 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:37,554 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2022-02-20 16:54:37,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:37,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:54:37,765 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:37,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:37,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2115896417, now seen corresponding path program 1 times [2022-02-20 16:54:37,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:37,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044617509] [2022-02-20 16:54:37,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:37,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:37,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:37,767 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:54:37,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:54:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:37,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 61 conjunts are in the unsatisfiable core [2022-02-20 16:54:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:37,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:38,012 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 16:54:38,170 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 16:54:38,170 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 12 treesize of output 12 [2022-02-20 16:54:38,210 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 11 treesize of output 7 [2022-02-20 16:54:38,256 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 14 treesize of output 16 [2022-02-20 16:54:38,367 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-02-20 16:54:38,367 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 29 [2022-02-20 16:54:38,595 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 16:54:38,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:38,614 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-02-20 16:54:38,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 34 [2022-02-20 16:54:38,795 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 16:54:38,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 14 [2022-02-20 16:54:38,878 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 16 treesize of output 18 [2022-02-20 16:54:39,057 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 15 treesize of output 7 [2022-02-20 16:54:39,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {1851#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {1851#true} is VALID [2022-02-20 16:54:39,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {1851#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {1851#true} is VALID [2022-02-20 16:54:39,129 INFO L272 TraceCheckUtils]: 2: Hoare triple {1851#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {1851#true} is VALID [2022-02-20 16:54:39,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {1851#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1865#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 16:54:39,130 INFO L290 TraceCheckUtils]: 4: Hoare triple {1865#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1865#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 16:54:39,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {1865#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1872#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 16:54:39,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {1872#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} assume true; {1872#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 16:54:39,132 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1872#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} {1851#true} #130#return; {1879#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (_ bv1 1))} is VALID [2022-02-20 16:54:39,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {1879#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (_ bv1 1))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {1883#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 16:54:39,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {1883#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {1883#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 16:54:39,134 INFO L272 TraceCheckUtils]: 10: Hoare triple {1883#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {1890#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 16:54:39,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {1890#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1894#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 16:54:39,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {1894#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1894#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 16:54:39,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {1894#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1901#(and (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_#res#1.base|))) (= |node_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:54:39,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {1901#(and (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_#res#1.base|))) (= |node_create_#res#1.offset| (_ bv0 32)))} assume true; {1901#(and (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_#res#1.base|))) (= |node_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:54:39,137 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1901#(and (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_#res#1.base|))) (= |node_create_#res#1.offset| (_ bv0 32)))} {1883#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)))} #132#return; {1908#(and (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| (_ bv0 32)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 16:54:39,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {1908#(and (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| (_ bv0 32)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {1912#(and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|))} is VALID [2022-02-20 16:54:39,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {1912#(and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {1916#(and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 16:54:39,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {1916#(and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {1920#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 16:54:39,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {1920#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {1920#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 16:54:39,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {1920#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {1927#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_#res#1.base|)))} is VALID [2022-02-20 16:54:39,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {1927#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_#res#1.base|)))} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {1931#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)))} is VALID [2022-02-20 16:54:39,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {1931#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {1935#(and (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_dll_circular_update_at_~data#1| |ULTIMATE.start_main_~len~0#1|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)))} is VALID [2022-02-20 16:54:39,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {1935#(and (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_dll_circular_update_at_~data#1| |ULTIMATE.start_main_~len~0#1|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {1935#(and (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_dll_circular_update_at_~data#1| |ULTIMATE.start_main_~len~0#1|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)))} is VALID [2022-02-20 16:54:39,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {1935#(and (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_dll_circular_update_at_~data#1| |ULTIMATE.start_main_~len~0#1|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {1942#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:39,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {1942#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} assume { :end_inline_dll_circular_update_at } true; {1942#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:39,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {1942#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {1942#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:39,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {1942#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {1952#(and (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:39,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {1952#(and (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {1956#(and (not (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:39,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {1956#(and (not (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {1956#(and (not (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:39,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {1956#(and (not (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {1963#(and (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:39,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {1963#(and (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} assume { :end_inline_dll_circular_update_at } true; {1963#(and (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:39,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {1963#(and (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {1963#(and (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:39,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {1963#(and (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {1963#(and (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:39,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {1963#(and (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} main_~i~0#1 := 0bv32; {1976#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:39,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {1976#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {1980#(and (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv8 32))))} is VALID [2022-02-20 16:54:39,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {1980#(and (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv8 32))))} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {1980#(and (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv8 32))))} is VALID [2022-02-20 16:54:39,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {1980#(and (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv8 32))))} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {1987#(= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)} is VALID [2022-02-20 16:54:39,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {1987#(= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {1991#(= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|)} is VALID [2022-02-20 16:54:39,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {1991#(= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|)} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {1852#false} is VALID [2022-02-20 16:54:39,184 INFO L290 TraceCheckUtils]: 40: Hoare triple {1852#false} assume !false; {1852#false} is VALID [2022-02-20 16:54:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:54:39,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:39,478 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_~len~0#1|)) is different from false [2022-02-20 16:54:39,504 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))) is different from false [2022-02-20 16:54:39,515 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_~len~0#1|)) is different from false [2022-02-20 16:54:39,540 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:54:39,541 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 1 case distinctions, treesize of input 36 treesize of output 37 [2022-02-20 16:54:39,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:54:39,571 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 64 treesize of output 67 [2022-02-20 16:54:39,578 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 25 treesize of output 21 [2022-02-20 16:54:40,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (_ BitVec 32)) (v_ArrVal_346 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_339) (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_346) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2022-02-20 16:54:41,383 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (_ BitVec 32)) (v_ArrVal_346 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (not (= (select (store (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_339) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_346) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-02-20 16:54:41,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (_ BitVec 32)) (v_ArrVal_346 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (store (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_338))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_339) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_346) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-02-20 16:54:41,419 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:54:41,419 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 1 case distinctions, treesize of input 48 treesize of output 41 [2022-02-20 16:54:41,449 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:54:41,449 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 455 treesize of output 445 [2022-02-20 16:54:41,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:54:41,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:54:41,467 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 374 treesize of output 358 [2022-02-20 16:54:41,544 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 6 treesize of output 4 [2022-02-20 16:54:41,558 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 525 treesize of output 515 [2022-02-20 16:54:42,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {1852#false} assume !false; {1852#false} is VALID [2022-02-20 16:54:42,028 INFO L290 TraceCheckUtils]: 39: Hoare triple {1991#(= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|)} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {1852#false} is VALID [2022-02-20 16:54:42,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {1987#(= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {1991#(= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|)} is VALID [2022-02-20 16:54:42,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {2007#(= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32))))} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {1987#(= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)} is VALID [2022-02-20 16:54:42,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {2007#(= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32))))} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {2007#(= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32))))} is VALID [2022-02-20 16:54:42,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {2014#(= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {2007#(= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32))))} is VALID [2022-02-20 16:54:42,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {2018#(= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))} main_~i~0#1 := 0bv32; {2014#(= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:42,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {2018#(= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {2018#(= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 16:54:42,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {2018#(= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 16:54:42,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {2018#(= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))} assume { :end_inline_dll_circular_update_at } true; {2018#(= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 16:54:42,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {2031#(forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_349) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {2018#(= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 16:54:42,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {2031#(forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_349) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {2031#(forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_349) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:42,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {2038#(forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_349) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {2031#(forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_349) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:42,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {2042#(forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_349) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {2038#(forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_349) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:42,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {2042#(forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_349) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {2042#(forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_349) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:42,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {2042#(forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_349) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} assume { :end_inline_dll_circular_update_at } true; {2042#(forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_349) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:42,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {2052#(and (= |ULTIMATE.start_dll_circular_update_at_~data#1| |ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_346 (_ BitVec 32))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_346)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {2042#(forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_349) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))))} is VALID [2022-02-20 16:54:42,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {2052#(and (= |ULTIMATE.start_dll_circular_update_at_~data#1| |ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_346 (_ BitVec 32))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_346)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {2052#(and (= |ULTIMATE.start_dll_circular_update_at_~data#1| |ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_346 (_ BitVec 32))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_346)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|))} is VALID [2022-02-20 16:54:42,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {2059#(and (forall ((|ULTIMATE.start_main_~len~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_346 (_ BitVec 32))) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_346) |ULTIMATE.start_main_~s~0#1.offset|)))))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {2052#(and (= |ULTIMATE.start_dll_circular_update_at_~data#1| |ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_346 (_ BitVec 32))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_346)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|))} is VALID [2022-02-20 16:54:42,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {2063#(forall ((v_ArrVal_346 (_ BitVec 32))) (not (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_346) |ULTIMATE.start_dll_circular_create_#res#1.offset|) |ULTIMATE.start_dll_circular_create_#res#1.base|)))} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {2059#(and (forall ((|ULTIMATE.start_main_~len~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_346 (_ BitVec 32))) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_346) |ULTIMATE.start_main_~s~0#1.offset|)))))} is VALID [2022-02-20 16:54:42,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {2067#(forall ((v_ArrVal_339 (_ BitVec 32)) (v_ArrVal_346 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (not (= (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_339) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_346) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {2063#(forall ((v_ArrVal_346 (_ BitVec 32))) (not (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_346) |ULTIMATE.start_dll_circular_create_#res#1.offset|) |ULTIMATE.start_dll_circular_create_#res#1.base|)))} is VALID [2022-02-20 16:54:42,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {2067#(forall ((v_ArrVal_339 (_ BitVec 32)) (v_ArrVal_346 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (not (= (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_339) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_346) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {2067#(forall ((v_ArrVal_339 (_ BitVec 32)) (v_ArrVal_346 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (not (= (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_339) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_346) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 16:54:42,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {2074#(forall ((v_ArrVal_339 (_ BitVec 32)) (v_ArrVal_346 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (not (= (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_339) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_346) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {2067#(forall ((v_ArrVal_339 (_ BitVec 32)) (v_ArrVal_346 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (not (= (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_339) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_346) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 16:54:42,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {2078#(forall ((v_ArrVal_339 (_ BitVec 32)) (v_ArrVal_346 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (store (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_338) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_338) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_339) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_346) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {2074#(forall ((v_ArrVal_339 (_ BitVec 32)) (v_ArrVal_346 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (not (= (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_339) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_346) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))} is VALID [2022-02-20 16:54:42,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {2082#(and (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {2078#(forall ((v_ArrVal_339 (_ BitVec 32)) (v_ArrVal_346 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (store (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_338) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_338) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_339) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_346) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))} is VALID [2022-02-20 16:54:42,052 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2090#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_#res#1.base|))))} {2086#(and (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (_ bv0 1))) (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (_ bv0 1))))} #132#return; {2082#(and (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 16:54:42,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {2090#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_#res#1.base|))))} assume true; {2090#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_#res#1.base|))))} is VALID [2022-02-20 16:54:42,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {2097#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2090#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_#res#1.base|))))} is VALID [2022-02-20 16:54:42,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {2097#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2097#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 16:54:42,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {2104#(forall ((|v_node_create_~temp~0#1.base_20| (_ BitVec 32))) (or (not (= (bvneg (select |#valid| |v_node_create_~temp~0#1.base_20|)) (_ bv0 1))) (= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |v_node_create_~temp~0#1.base_20|))))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2097#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 16:54:42,056 INFO L272 TraceCheckUtils]: 10: Hoare triple {2086#(and (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (_ bv0 1))) (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (_ bv0 1))))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {2104#(forall ((|v_node_create_~temp~0#1.base_20| (_ BitVec 32))) (or (not (= (bvneg (select |#valid| |v_node_create_~temp~0#1.base_20|)) (_ bv0 1))) (= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |v_node_create_~temp~0#1.base_20|))))))} is VALID [2022-02-20 16:54:42,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {2086#(and (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (_ bv0 1))) (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (_ bv0 1))))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {2086#(and (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (_ bv0 1))) (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (_ bv0 1))))} is VALID [2022-02-20 16:54:42,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {1879#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (_ bv1 1))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {2086#(and (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (_ bv0 1))) (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (_ bv0 1))))} is VALID [2022-02-20 16:54:42,058 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1872#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} {1851#true} #130#return; {1879#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (_ bv1 1))} is VALID [2022-02-20 16:54:42,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {1872#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} assume true; {1872#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 16:54:42,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {1865#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1872#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 16:54:42,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {1865#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1865#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 16:54:42,060 INFO L290 TraceCheckUtils]: 3: Hoare triple {1851#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1865#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 16:54:42,061 INFO L272 TraceCheckUtils]: 2: Hoare triple {1851#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {1851#true} is VALID [2022-02-20 16:54:42,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {1851#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {1851#true} is VALID [2022-02-20 16:54:42,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {1851#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {1851#true} is VALID [2022-02-20 16:54:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-02-20 16:54:42,061 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:42,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044617509] [2022-02-20 16:54:42,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044617509] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:54:42,062 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:54:42,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 41 [2022-02-20 16:54:42,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232028956] [2022-02-20 16:54:42,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:42,063 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2022-02-20 16:54:42,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:42,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:42,182 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 16:54:42,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-20 16:54:42,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:42,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-20 16:54:42,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1108, Unknown=6, NotChecked=426, Total=1640 [2022-02-20 16:54:42,183 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:47,323 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2022-02-20 16:54:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-20 16:54:47,324 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2022-02-20 16:54:47,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:47,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 96 transitions. [2022-02-20 16:54:47,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 96 transitions. [2022-02-20 16:54:47,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 96 transitions. [2022-02-20 16:54:47,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:47,462 INFO L225 Difference]: With dead ends: 88 [2022-02-20 16:54:47,462 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 16:54:47,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 6 IntricatePredicates, 3 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=183, Invalid=1905, Unknown=6, NotChecked=558, Total=2652 [2022-02-20 16:54:47,464 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 46 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:47,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 503 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 406 Invalid, 0 Unknown, 363 Unchecked, 0.9s Time] [2022-02-20 16:54:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 16:54:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2022-02-20 16:54:47,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:47,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 69 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:47,476 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 69 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:47,476 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 69 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:47,478 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2022-02-20 16:54:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2022-02-20 16:54:47,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:47,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:47,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 86 states. [2022-02-20 16:54:47,480 INFO L87 Difference]: Start difference. First operand has 69 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 86 states. [2022-02-20 16:54:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:47,482 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2022-02-20 16:54:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2022-02-20 16:54:47,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:47,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:47,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:47,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2022-02-20 16:54:47,485 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 41 [2022-02-20 16:54:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:47,485 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2022-02-20 16:54:47,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2022-02-20 16:54:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 16:54:47,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:47,486 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2022-02-20 16:54:47,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:47,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:54:47,697 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:47,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:47,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1219933381, now seen corresponding path program 1 times [2022-02-20 16:54:47,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:47,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207145307] [2022-02-20 16:54:47,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:47,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:47,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:47,699 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:54:47,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 16:54:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:47,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:54:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:47,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:47,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {2559#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {2559#true} is VALID [2022-02-20 16:54:47,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {2559#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {2559#true} is VALID [2022-02-20 16:54:47,901 INFO L272 TraceCheckUtils]: 2: Hoare triple {2559#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {2559#true} is VALID [2022-02-20 16:54:47,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {2559#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2559#true} is VALID [2022-02-20 16:54:47,901 INFO L290 TraceCheckUtils]: 4: Hoare triple {2559#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2559#true} is VALID [2022-02-20 16:54:47,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {2559#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2559#true} is VALID [2022-02-20 16:54:47,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-02-20 16:54:47,901 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2559#true} {2559#true} #130#return; {2559#true} is VALID [2022-02-20 16:54:47,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {2559#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {2559#true} is VALID [2022-02-20 16:54:47,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {2559#true} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {2559#true} is VALID [2022-02-20 16:54:47,902 INFO L272 TraceCheckUtils]: 10: Hoare triple {2559#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {2559#true} is VALID [2022-02-20 16:54:47,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {2559#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2559#true} is VALID [2022-02-20 16:54:47,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {2559#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2559#true} is VALID [2022-02-20 16:54:47,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {2559#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2559#true} is VALID [2022-02-20 16:54:47,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-02-20 16:54:47,902 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2559#true} {2559#true} #132#return; {2559#true} is VALID [2022-02-20 16:54:47,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {2559#true} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {2559#true} is VALID [2022-02-20 16:54:47,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {2559#true} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {2559#true} is VALID [2022-02-20 16:54:47,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {2559#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {2559#true} is VALID [2022-02-20 16:54:47,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {2559#true} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {2559#true} is VALID [2022-02-20 16:54:47,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {2559#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {2559#true} is VALID [2022-02-20 16:54:47,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {2559#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {2559#true} is VALID [2022-02-20 16:54:47,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {2559#true} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {2559#true} is VALID [2022-02-20 16:54:47,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {2559#true} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {2559#true} is VALID [2022-02-20 16:54:47,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {2559#true} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {2559#true} is VALID [2022-02-20 16:54:47,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {2559#true} assume { :end_inline_dll_circular_update_at } true; {2559#true} is VALID [2022-02-20 16:54:47,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {2559#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {2559#true} is VALID [2022-02-20 16:54:47,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {2559#true} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {2559#true} is VALID [2022-02-20 16:54:47,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {2559#true} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {2559#true} is VALID [2022-02-20 16:54:47,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {2559#true} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {2559#true} is VALID [2022-02-20 16:54:47,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {2559#true} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {2559#true} is VALID [2022-02-20 16:54:47,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {2559#true} assume { :end_inline_dll_circular_update_at } true; {2559#true} is VALID [2022-02-20 16:54:47,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {2559#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {2559#true} is VALID [2022-02-20 16:54:47,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {2559#true} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {2559#true} is VALID [2022-02-20 16:54:47,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {2559#true} main_~i~0#1 := 0bv32; {2666#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:47,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {2666#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {2670#(= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32))} is VALID [2022-02-20 16:54:47,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {2670#(= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32))} assume !!~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32);call dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, 4bv32);dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset;dll_circular_get_data_at_#t~post10#1 := dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~index#1 := ~bvsub32(dll_circular_get_data_at_#t~post10#1, 1bv32);havoc dll_circular_get_data_at_#t~post10#1; {2560#false} is VALID [2022-02-20 16:54:47,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {2560#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {2560#false} is VALID [2022-02-20 16:54:47,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {2560#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {2560#false} is VALID [2022-02-20 16:54:47,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {2560#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {2560#false} is VALID [2022-02-20 16:54:47,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {2560#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {2560#false} is VALID [2022-02-20 16:54:47,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {2560#false} assume !false; {2560#false} is VALID [2022-02-20 16:54:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 16:54:47,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:54:47,909 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:47,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207145307] [2022-02-20 16:54:47,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207145307] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:47,909 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:47,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:54:47,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748648754] [2022-02-20 16:54:47,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:47,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-02-20 16:54:47,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:47,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:47,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:47,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:54:47,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:47,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:54:47,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:54:47,938 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:48,158 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2022-02-20 16:54:48,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:54:48,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-02-20 16:54:48,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-20 16:54:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-20 16:54:48,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-02-20 16:54:48,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:48,217 INFO L225 Difference]: With dead ends: 86 [2022-02-20 16:54:48,218 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 16:54:48,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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 16:54:48,218 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:48,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 91 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 16:54:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2022-02-20 16:54:48,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:48,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 71 states, 64 states have (on average 1.1875) internal successors, (76), 65 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:48,231 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 71 states, 64 states have (on average 1.1875) internal successors, (76), 65 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:48,231 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 71 states, 64 states have (on average 1.1875) internal successors, (76), 65 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:48,235 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-02-20 16:54:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-02-20 16:54:48,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:48,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:48,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 64 states have (on average 1.1875) internal successors, (76), 65 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 78 states. [2022-02-20 16:54:48,236 INFO L87 Difference]: Start difference. First operand has 71 states, 64 states have (on average 1.1875) internal successors, (76), 65 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 78 states. [2022-02-20 16:54:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:48,238 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-02-20 16:54:48,238 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-02-20 16:54:48,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:48,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:48,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:48,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.1875) internal successors, (76), 65 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2022-02-20 16:54:48,241 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 42 [2022-02-20 16:54:48,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:48,242 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2022-02-20 16:54:48,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:48,242 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-02-20 16:54:48,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 16:54:48,243 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:48,243 INFO L514 BasicCegarLoop]: trace histogram [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, 1] [2022-02-20 16:54:48,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:48,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:54:48,451 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash -628992200, now seen corresponding path program 2 times [2022-02-20 16:54:48,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:48,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737382400] [2022-02-20 16:54:48,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:54:48,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:48,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:48,453 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:54:48,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 16:54:48,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:54:48,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:54:48,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:54:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:48,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:48,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {3074#true} is VALID [2022-02-20 16:54:48,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {3074#true} is VALID [2022-02-20 16:54:48,706 INFO L272 TraceCheckUtils]: 2: Hoare triple {3074#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {3074#true} is VALID [2022-02-20 16:54:48,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {3074#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3074#true} is VALID [2022-02-20 16:54:48,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {3074#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3074#true} is VALID [2022-02-20 16:54:48,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {3074#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3074#true} is VALID [2022-02-20 16:54:48,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-02-20 16:54:48,706 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3074#true} {3074#true} #130#return; {3074#true} is VALID [2022-02-20 16:54:48,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {3074#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {3074#true} is VALID [2022-02-20 16:54:48,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {3074#true} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {3074#true} is VALID [2022-02-20 16:54:48,706 INFO L272 TraceCheckUtils]: 10: Hoare triple {3074#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {3074#true} is VALID [2022-02-20 16:54:48,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {3074#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3074#true} is VALID [2022-02-20 16:54:48,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {3074#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3074#true} is VALID [2022-02-20 16:54:48,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {3074#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3074#true} is VALID [2022-02-20 16:54:48,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-02-20 16:54:48,707 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3074#true} {3074#true} #132#return; {3074#true} is VALID [2022-02-20 16:54:48,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {3074#true} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {3074#true} is VALID [2022-02-20 16:54:48,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {3074#true} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {3074#true} is VALID [2022-02-20 16:54:48,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {3074#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {3074#true} is VALID [2022-02-20 16:54:48,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {3074#true} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {3074#true} is VALID [2022-02-20 16:54:48,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {3074#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {3074#true} is VALID [2022-02-20 16:54:48,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {3074#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {3142#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:48,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {3142#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {3142#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:48,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {3142#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {3142#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:48,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {3142#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {3142#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:48,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {3142#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume { :end_inline_dll_circular_update_at } true; {3142#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:48,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {3142#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {3158#(= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))} is VALID [2022-02-20 16:54:48,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {3158#(= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {3162#(= (_ bv1 32) |ULTIMATE.start_dll_circular_update_at_~index#1|)} is VALID [2022-02-20 16:54:48,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {3162#(= (_ bv1 32) |ULTIMATE.start_dll_circular_update_at_~index#1|)} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {3166#(= (bvadd (_ bv1 32) |ULTIMATE.start_dll_circular_update_at_~index#1|) (_ bv1 32))} is VALID [2022-02-20 16:54:48,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {3166#(= (bvadd (_ bv1 32) |ULTIMATE.start_dll_circular_update_at_~index#1|) (_ bv1 32))} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {3075#false} is VALID [2022-02-20 16:54:48,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {3075#false} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {3075#false} is VALID [2022-02-20 16:54:48,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {3075#false} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {3075#false} is VALID [2022-02-20 16:54:48,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {3075#false} assume { :end_inline_dll_circular_update_at } true; {3075#false} is VALID [2022-02-20 16:54:48,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {3075#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {3075#false} is VALID [2022-02-20 16:54:48,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {3075#false} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {3075#false} is VALID [2022-02-20 16:54:48,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {3075#false} main_~i~0#1 := 0bv32; {3075#false} is VALID [2022-02-20 16:54:48,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {3075#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {3075#false} is VALID [2022-02-20 16:54:48,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {3075#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {3075#false} is VALID [2022-02-20 16:54:48,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {3075#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {3075#false} is VALID [2022-02-20 16:54:48,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {3075#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {3075#false} is VALID [2022-02-20 16:54:48,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {3075#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {3075#false} is VALID [2022-02-20 16:54:48,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {3075#false} assume !false; {3075#false} is VALID [2022-02-20 16:54:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:54:48,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:48,854 INFO L290 TraceCheckUtils]: 41: Hoare triple {3075#false} assume !false; {3075#false} is VALID [2022-02-20 16:54:48,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {3075#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {3075#false} is VALID [2022-02-20 16:54:48,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {3075#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {3075#false} is VALID [2022-02-20 16:54:48,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {3075#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {3075#false} is VALID [2022-02-20 16:54:48,855 INFO L290 TraceCheckUtils]: 37: Hoare triple {3075#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {3075#false} is VALID [2022-02-20 16:54:48,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {3075#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {3075#false} is VALID [2022-02-20 16:54:48,855 INFO L290 TraceCheckUtils]: 35: Hoare triple {3075#false} main_~i~0#1 := 0bv32; {3075#false} is VALID [2022-02-20 16:54:48,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {3075#false} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {3075#false} is VALID [2022-02-20 16:54:48,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {3075#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {3075#false} is VALID [2022-02-20 16:54:48,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {3075#false} assume { :end_inline_dll_circular_update_at } true; {3075#false} is VALID [2022-02-20 16:54:48,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {3075#false} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {3075#false} is VALID [2022-02-20 16:54:48,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {3075#false} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {3075#false} is VALID [2022-02-20 16:54:48,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {3242#(not (bvsgt |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32)))} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {3075#false} is VALID [2022-02-20 16:54:48,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {3246#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_circular_update_at_~index#1|) (_ bv0 32)))} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {3242#(not (bvsgt |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32)))} is VALID [2022-02-20 16:54:48,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {3250#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {3246#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_circular_update_at_~index#1|) (_ bv0 32)))} is VALID [2022-02-20 16:54:48,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {3254#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {3250#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32)))} is VALID [2022-02-20 16:54:48,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {3254#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} assume { :end_inline_dll_circular_update_at } true; {3254#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:54:48,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {3254#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {3254#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:54:48,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {3254#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {3254#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:54:48,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {3254#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {3254#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:54:48,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {3074#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {3254#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:54:48,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {3074#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {3074#true} is VALID [2022-02-20 16:54:48,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {3074#true} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {3074#true} is VALID [2022-02-20 16:54:48,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {3074#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {3074#true} is VALID [2022-02-20 16:54:48,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {3074#true} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {3074#true} is VALID [2022-02-20 16:54:48,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {3074#true} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {3074#true} is VALID [2022-02-20 16:54:48,861 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3074#true} {3074#true} #132#return; {3074#true} is VALID [2022-02-20 16:54:48,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-02-20 16:54:48,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {3074#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3074#true} is VALID [2022-02-20 16:54:48,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {3074#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3074#true} is VALID [2022-02-20 16:54:48,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {3074#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3074#true} is VALID [2022-02-20 16:54:48,862 INFO L272 TraceCheckUtils]: 10: Hoare triple {3074#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {3074#true} is VALID [2022-02-20 16:54:48,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {3074#true} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {3074#true} is VALID [2022-02-20 16:54:48,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {3074#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {3074#true} is VALID [2022-02-20 16:54:48,862 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3074#true} {3074#true} #130#return; {3074#true} is VALID [2022-02-20 16:54:48,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-02-20 16:54:48,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {3074#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3074#true} is VALID [2022-02-20 16:54:48,862 INFO L290 TraceCheckUtils]: 4: Hoare triple {3074#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3074#true} is VALID [2022-02-20 16:54:48,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {3074#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3074#true} is VALID [2022-02-20 16:54:48,863 INFO L272 TraceCheckUtils]: 2: Hoare triple {3074#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {3074#true} is VALID [2022-02-20 16:54:48,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {3074#true} is VALID [2022-02-20 16:54:48,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {3074#true} is VALID [2022-02-20 16:54:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:54:48,863 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:48,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737382400] [2022-02-20 16:54:48,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737382400] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:54:48,864 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:54:48,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-02-20 16:54:48,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397961532] [2022-02-20 16:54:48,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:48,865 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-02-20 16:54:48,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:48,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:48,905 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 16:54:48,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 16:54:48,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:48,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 16:54:48,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:54:48,906 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:49,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:49,621 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2022-02-20 16:54:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 16:54:49,621 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-02-20 16:54:49,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-02-20 16:54:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-02-20 16:54:49,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 112 transitions. [2022-02-20 16:54:49,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:49,733 INFO L225 Difference]: With dead ends: 138 [2022-02-20 16:54:49,733 INFO L226 Difference]: Without dead ends: 116 [2022-02-20 16:54:49,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-02-20 16:54:49,734 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 118 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:49,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 258 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:54:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-20 16:54:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2022-02-20 16:54:49,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:49,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 73 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 67 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:49,747 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 73 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 67 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:49,748 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 73 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 67 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:49,750 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2022-02-20 16:54:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2022-02-20 16:54:49,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:49,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:49,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 67 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 116 states. [2022-02-20 16:54:49,758 INFO L87 Difference]: Start difference. First operand has 73 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 67 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 116 states. [2022-02-20 16:54:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:49,760 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2022-02-20 16:54:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2022-02-20 16:54:49,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:49,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:49,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:49,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 67 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-02-20 16:54:49,767 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 42 [2022-02-20 16:54:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:49,767 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-02-20 16:54:49,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-02-20 16:54:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 16:54:49,769 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:49,769 INFO L514 BasicCegarLoop]: trace histogram [2, 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 16:54:49,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:49,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:54:49,984 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:49,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1999508780, now seen corresponding path program 1 times [2022-02-20 16:54:49,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:49,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514764021] [2022-02-20 16:54:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:49,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:49,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:49,986 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:54:49,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 16:54:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:50,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:54:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:50,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:50,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {3883#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {3883#true} is VALID [2022-02-20 16:54:50,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {3883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {3883#true} is VALID [2022-02-20 16:54:50,230 INFO L272 TraceCheckUtils]: 2: Hoare triple {3883#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {3883#true} is VALID [2022-02-20 16:54:50,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {3883#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3883#true} is VALID [2022-02-20 16:54:50,230 INFO L290 TraceCheckUtils]: 4: Hoare triple {3883#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {3883#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3883#true} {3883#true} #130#return; {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {3883#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {3883#true} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L272 TraceCheckUtils]: 10: Hoare triple {3883#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {3883#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {3883#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {3883#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3883#true} {3883#true} #132#return; {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {3883#true} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {3883#true} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {3883#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {3883#true} is VALID [2022-02-20 16:54:50,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {3883#true} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {3883#true} is VALID [2022-02-20 16:54:50,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {3883#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {3883#true} is VALID [2022-02-20 16:54:50,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {3883#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {3883#true} is VALID [2022-02-20 16:54:50,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {3883#true} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {3883#true} is VALID [2022-02-20 16:54:50,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {3883#true} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {3883#true} is VALID [2022-02-20 16:54:50,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {3883#true} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {3883#true} is VALID [2022-02-20 16:54:50,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {3883#true} assume { :end_inline_dll_circular_update_at } true; {3883#true} is VALID [2022-02-20 16:54:50,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {3883#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {3883#true} is VALID [2022-02-20 16:54:50,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {3883#true} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {3883#true} is VALID [2022-02-20 16:54:50,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {3883#true} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {3883#true} is VALID [2022-02-20 16:54:50,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {3883#true} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {3883#true} is VALID [2022-02-20 16:54:50,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {3883#true} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {3883#true} is VALID [2022-02-20 16:54:50,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {3883#true} assume { :end_inline_dll_circular_update_at } true; {3883#true} is VALID [2022-02-20 16:54:50,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {3883#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {3883#true} is VALID [2022-02-20 16:54:50,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {3883#true} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {3883#true} is VALID [2022-02-20 16:54:50,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {3883#true} main_~i~0#1 := 0bv32; {3990#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:50,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {3990#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {3990#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:50,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {3990#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {3990#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:50,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {3990#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {3990#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:50,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {3990#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {3990#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:50,243 INFO L290 TraceCheckUtils]: 39: Hoare triple {3990#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {3990#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:50,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {3990#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post16#1);havoc main_#t~post16#1; {4009#(= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))} is VALID [2022-02-20 16:54:50,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {4009#(= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {4013#(= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv1 32))} is VALID [2022-02-20 16:54:50,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {4013#(= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv1 32))} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {3884#false} is VALID [2022-02-20 16:54:50,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {3884#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {3884#false} is VALID [2022-02-20 16:54:50,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {3884#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {3884#false} is VALID [2022-02-20 16:54:50,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {3884#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {3884#false} is VALID [2022-02-20 16:54:50,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {3884#false} assume !false; {3884#false} is VALID [2022-02-20 16:54:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 16:54:50,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:50,356 INFO L290 TraceCheckUtils]: 46: Hoare triple {3884#false} assume !false; {3884#false} is VALID [2022-02-20 16:54:50,356 INFO L290 TraceCheckUtils]: 45: Hoare triple {3884#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {3884#false} is VALID [2022-02-20 16:54:50,356 INFO L290 TraceCheckUtils]: 44: Hoare triple {3884#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {3884#false} is VALID [2022-02-20 16:54:50,356 INFO L290 TraceCheckUtils]: 43: Hoare triple {3884#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {3884#false} is VALID [2022-02-20 16:54:50,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {4041#(bvsgt |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32))} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {3884#false} is VALID [2022-02-20 16:54:50,357 INFO L290 TraceCheckUtils]: 41: Hoare triple {4045#(bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {4041#(bvsgt |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32))} is VALID [2022-02-20 16:54:50,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {4049#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post16#1);havoc main_#t~post16#1; {4045#(bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:54:50,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {4049#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {4049#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} is VALID [2022-02-20 16:54:50,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {4049#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {4049#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} is VALID [2022-02-20 16:54:50,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {4049#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {4049#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} is VALID [2022-02-20 16:54:50,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {4049#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {4049#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} is VALID [2022-02-20 16:54:50,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {4049#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {4049#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} is VALID [2022-02-20 16:54:50,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {3883#true} main_~i~0#1 := 0bv32; {4049#(bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))} is VALID [2022-02-20 16:54:50,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {3883#true} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {3883#true} is VALID [2022-02-20 16:54:50,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {3883#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 31: Hoare triple {3883#true} assume { :end_inline_dll_circular_update_at } true; {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {3883#true} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {3883#true} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {3883#true} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {3883#true} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {3883#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {3883#true} assume { :end_inline_dll_circular_update_at } true; {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {3883#true} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {3883#true} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {3883#true} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {3883#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {3883#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {3883#true} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {3883#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {3883#true} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {3883#true} is VALID [2022-02-20 16:54:50,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {3883#true} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3883#true} {3883#true} #132#return; {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {3883#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {3883#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {3883#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L272 TraceCheckUtils]: 10: Hoare triple {3883#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {3883#true} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {3883#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3883#true} {3883#true} #130#return; {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {3883#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {3883#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {3883#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L272 TraceCheckUtils]: 2: Hoare triple {3883#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {3883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {3883#true} is VALID [2022-02-20 16:54:50,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {3883#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {3883#true} is VALID [2022-02-20 16:54:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 16:54:50,363 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:50,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514764021] [2022-02-20 16:54:50,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514764021] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:54:50,363 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:54:50,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 16:54:50,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545893140] [2022-02-20 16:54:50,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:50,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-02-20 16:54:50,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:50,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:50,401 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 16:54:50,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:54:50,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:50,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:54:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:54:50,402 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:50,936 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2022-02-20 16:54:50,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:54:50,936 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-02-20 16:54:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-02-20 16:54:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-02-20 16:54:50,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-02-20 16:54:51,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:51,026 INFO L225 Difference]: With dead ends: 103 [2022-02-20 16:54:51,026 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 16:54:51,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:54:51,027 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 59 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:51,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 185 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:54:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 16:54:51,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2022-02-20 16:54:51,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:51,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 74 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 68 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:51,034 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 74 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 68 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:51,034 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 74 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 68 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:51,037 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-02-20 16:54:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-02-20 16:54:51,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:51,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:51,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 68 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 95 states. [2022-02-20 16:54:51,038 INFO L87 Difference]: Start difference. First operand has 74 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 68 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 95 states. [2022-02-20 16:54:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:51,039 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-02-20 16:54:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-02-20 16:54:51,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:51,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:51,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:51,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 68 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-02-20 16:54:51,041 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 47 [2022-02-20 16:54:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:51,041 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-02-20 16:54:51,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:54:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-02-20 16:54:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 16:54:51,042 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:51,042 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 16:54:51,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:51,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:54:51,252 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:51,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:51,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1222144142, now seen corresponding path program 3 times [2022-02-20 16:54:51,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:51,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023375077] [2022-02-20 16:54:51,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 16:54:51,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:51,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:51,254 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:54:51,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 16:54:51,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 16:54:51,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:54:51,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 16:54:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:51,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:51,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {4626#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {4626#true} is VALID [2022-02-20 16:54:51,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {4626#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:51,665 INFO L272 TraceCheckUtils]: 2: Hoare triple {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {4626#true} is VALID [2022-02-20 16:54:51,665 INFO L290 TraceCheckUtils]: 3: Hoare triple {4626#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4626#true} is VALID [2022-02-20 16:54:51,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {4626#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4626#true} is VALID [2022-02-20 16:54:51,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {4626#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4626#true} is VALID [2022-02-20 16:54:51,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-02-20 16:54:51,666 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4626#true} {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} #130#return; {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:51,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:51,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:51,666 INFO L272 TraceCheckUtils]: 10: Hoare triple {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {4626#true} is VALID [2022-02-20 16:54:51,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {4626#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4626#true} is VALID [2022-02-20 16:54:51,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {4626#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4626#true} is VALID [2022-02-20 16:54:51,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {4626#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4626#true} is VALID [2022-02-20 16:54:51,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-02-20 16:54:51,667 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4626#true} {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} #132#return; {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:51,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:51,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:51,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:51,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:51,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:51,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {4634#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {4695#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {4695#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {4695#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {4695#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {4695#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {4695#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {4695#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {4695#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume { :end_inline_dll_circular_update_at } true; {4695#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {4695#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {4711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {4711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {4711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {4711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {4711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {4711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {4711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {4711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {4711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {4711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume { :end_inline_dll_circular_update_at } true; {4711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {4711#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {4730#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv1 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {4730#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv1 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {4627#false} is VALID [2022-02-20 16:54:51,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {4627#false} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {4627#false} is VALID [2022-02-20 16:54:51,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {4627#false} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {4627#false} is VALID [2022-02-20 16:54:51,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {4627#false} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {4627#false} is VALID [2022-02-20 16:54:51,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {4627#false} assume { :end_inline_dll_circular_update_at } true; {4627#false} is VALID [2022-02-20 16:54:51,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {4627#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {4627#false} is VALID [2022-02-20 16:54:51,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {4627#false} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {4627#false} is VALID [2022-02-20 16:54:51,674 INFO L290 TraceCheckUtils]: 40: Hoare triple {4627#false} main_~i~0#1 := 0bv32; {4627#false} is VALID [2022-02-20 16:54:51,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {4627#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {4627#false} is VALID [2022-02-20 16:54:51,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {4627#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {4627#false} is VALID [2022-02-20 16:54:51,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {4627#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {4627#false} is VALID [2022-02-20 16:54:51,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {4627#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {4627#false} is VALID [2022-02-20 16:54:51,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {4627#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {4627#false} is VALID [2022-02-20 16:54:51,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {4627#false} assume !false; {4627#false} is VALID [2022-02-20 16:54:51,674 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 16:54:51,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:51,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {4627#false} assume !false; {4627#false} is VALID [2022-02-20 16:54:51,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {4627#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {4627#false} is VALID [2022-02-20 16:54:51,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {4627#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {4627#false} is VALID [2022-02-20 16:54:51,892 INFO L290 TraceCheckUtils]: 43: Hoare triple {4627#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {4627#false} is VALID [2022-02-20 16:54:51,892 INFO L290 TraceCheckUtils]: 42: Hoare triple {4627#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {4627#false} is VALID [2022-02-20 16:54:51,892 INFO L290 TraceCheckUtils]: 41: Hoare triple {4627#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {4627#false} is VALID [2022-02-20 16:54:51,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {4627#false} main_~i~0#1 := 0bv32; {4627#false} is VALID [2022-02-20 16:54:51,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {4627#false} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {4627#false} is VALID [2022-02-20 16:54:51,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {4627#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {4627#false} is VALID [2022-02-20 16:54:51,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {4627#false} assume { :end_inline_dll_circular_update_at } true; {4627#false} is VALID [2022-02-20 16:54:51,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {4627#false} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {4627#false} is VALID [2022-02-20 16:54:51,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {4627#false} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {4627#false} is VALID [2022-02-20 16:54:51,893 INFO L290 TraceCheckUtils]: 34: Hoare triple {4809#(not (bvsgt |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32)))} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {4627#false} is VALID [2022-02-20 16:54:51,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {4813#(or (not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32))) (not (bvslt |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {4809#(not (bvsgt |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32)))} is VALID [2022-02-20 16:54:51,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {4817#(or (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {4813#(or (not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32))) (not (bvslt |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)))} is VALID [2022-02-20 16:54:51,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {4817#(or (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)))} assume { :end_inline_dll_circular_update_at } true; {4817#(or (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)))} is VALID [2022-02-20 16:54:51,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {4817#(or (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {4817#(or (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)))} is VALID [2022-02-20 16:54:51,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {4817#(or (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {4817#(or (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)))} is VALID [2022-02-20 16:54:51,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {4817#(or (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)))} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {4817#(or (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)))} is VALID [2022-02-20 16:54:51,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {4817#(or (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {4817#(or (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)))} is VALID [2022-02-20 16:54:51,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {4836#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) |ULTIMATE.start_main_~len~0#1|)) (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv0 32))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {4817#(or (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~len~0#1|)))} is VALID [2022-02-20 16:54:51,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {4836#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) |ULTIMATE.start_main_~len~0#1|)) (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv0 32))))} assume { :end_inline_dll_circular_update_at } true; {4836#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) |ULTIMATE.start_main_~len~0#1|)) (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv0 32))))} is VALID [2022-02-20 16:54:51,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {4836#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) |ULTIMATE.start_main_~len~0#1|)) (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv0 32))))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {4836#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) |ULTIMATE.start_main_~len~0#1|)) (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv0 32))))} is VALID [2022-02-20 16:54:51,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {4836#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) |ULTIMATE.start_main_~len~0#1|)) (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv0 32))))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {4836#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) |ULTIMATE.start_main_~len~0#1|)) (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv0 32))))} is VALID [2022-02-20 16:54:51,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {4836#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) |ULTIMATE.start_main_~len~0#1|)) (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv0 32))))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {4836#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) |ULTIMATE.start_main_~len~0#1|)) (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv0 32))))} is VALID [2022-02-20 16:54:51,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {4836#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) |ULTIMATE.start_main_~len~0#1|)) (not (bvsgt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv0 32))))} is VALID [2022-02-20 16:54:51,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,961 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4626#true} {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} #132#return; {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-02-20 16:54:51,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {4626#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4626#true} is VALID [2022-02-20 16:54:51,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {4626#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4626#true} is VALID [2022-02-20 16:54:51,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {4626#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4626#true} is VALID [2022-02-20 16:54:51,961 INFO L272 TraceCheckUtils]: 10: Hoare triple {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {4626#true} is VALID [2022-02-20 16:54:51,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,962 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4626#true} {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} #130#return; {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-02-20 16:54:51,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {4626#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4626#true} is VALID [2022-02-20 16:54:51,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {4626#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4626#true} is VALID [2022-02-20 16:54:51,963 INFO L290 TraceCheckUtils]: 3: Hoare triple {4626#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4626#true} is VALID [2022-02-20 16:54:51,963 INFO L272 TraceCheckUtils]: 2: Hoare triple {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {4626#true} is VALID [2022-02-20 16:54:51,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {4626#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {4852#(not (bvslt (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:51,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {4626#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {4626#true} is VALID [2022-02-20 16:54:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:54:51,963 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:51,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023375077] [2022-02-20 16:54:51,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023375077] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:54:51,964 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:54:51,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2022-02-20 16:54:51,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153505691] [2022-02-20 16:54:51,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:51,964 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-02-20 16:54:51,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:51,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:52,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:52,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 16:54:52,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:52,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 16:54:52,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:54:52,067 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:52,582 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2022-02-20 16:54:52,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:54:52,582 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-02-20 16:54:52,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-02-20 16:54:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-02-20 16:54:52,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2022-02-20 16:54:52,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:52,643 INFO L225 Difference]: With dead ends: 97 [2022-02-20 16:54:52,643 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 16:54:52,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-02-20 16:54:52,644 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 79 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:52,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 163 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:54:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 16:54:52,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-02-20 16:54:52,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:52,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 68 states have (on average 1.088235294117647) internal successors, (74), 69 states have internal predecessors, (74), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:52,658 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 68 states have (on average 1.088235294117647) internal successors, (74), 69 states have internal predecessors, (74), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:52,658 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 68 states have (on average 1.088235294117647) internal successors, (74), 69 states have internal predecessors, (74), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:52,659 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-02-20 16:54:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-02-20 16:54:52,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:52,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:52,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 68 states have (on average 1.088235294117647) internal successors, (74), 69 states have internal predecessors, (74), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 77 states. [2022-02-20 16:54:52,660 INFO L87 Difference]: Start difference. First operand has 75 states, 68 states have (on average 1.088235294117647) internal successors, (74), 69 states have internal predecessors, (74), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 77 states. [2022-02-20 16:54:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:52,661 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-02-20 16:54:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-02-20 16:54:52,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:52,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:52,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:52,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.088235294117647) internal successors, (74), 69 states have internal predecessors, (74), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:54:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-02-20 16:54:52,663 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 47 [2022-02-20 16:54:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:52,664 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-02-20 16:54:52,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:54:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-02-20 16:54:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 16:54:52,664 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:52,665 INFO L514 BasicCegarLoop]: trace histogram [2, 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, 1] [2022-02-20 16:54:52,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:52,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:54:52,873 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:52,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1906883930, now seen corresponding path program 1 times [2022-02-20 16:54:52,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:52,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137309978] [2022-02-20 16:54:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:52,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:52,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:52,875 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:54:52,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 16:54:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:53,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 93 conjunts are in the unsatisfiable core [2022-02-20 16:54:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:53,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:53,156 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 16:54:53,339 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 16:54:53,340 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 12 treesize of output 12 [2022-02-20 16:54:53,395 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 11 treesize of output 7 [2022-02-20 16:54:53,403 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 11 treesize of output 7 [2022-02-20 16:54:53,473 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 14 treesize of output 16 [2022-02-20 16:54:53,481 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 14 treesize of output 16 [2022-02-20 16:54:53,633 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-02-20 16:54:53,633 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 56 [2022-02-20 16:54:53,640 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 51 treesize of output 29 [2022-02-20 16:54:53,943 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-20 16:54:53,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:53,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-02-20 16:54:53,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:53,983 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-02-20 16:54:53,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-02-20 16:54:54,612 INFO L356 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2022-02-20 16:54:54,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 78 [2022-02-20 16:54:54,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:54,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:54:54,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2022-02-20 16:54:54,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:54,629 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 47 treesize of output 36 [2022-02-20 16:54:54,638 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 5 treesize of output 3 [2022-02-20 16:54:55,222 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 23 [2022-02-20 16:54:55,225 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 34 treesize of output 22 [2022-02-20 16:54:55,304 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 16:54:55,304 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 37 treesize of output 21 [2022-02-20 16:54:55,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {5327#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {5327#true} is VALID [2022-02-20 16:54:55,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {5327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {5335#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:55,398 INFO L272 TraceCheckUtils]: 2: Hoare triple {5335#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {5327#true} is VALID [2022-02-20 16:54:55,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {5327#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5342#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:54:55,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {5342#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5342#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:54:55,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {5342#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5349#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 16:54:55,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {5349#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {5349#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 16:54:55,401 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5349#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {5335#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} #130#return; {5356#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:55,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {5356#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {5360#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:55,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {5360#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {5360#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:55,403 INFO L272 TraceCheckUtils]: 10: Hoare triple {5360#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {5367#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 16:54:55,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {5367#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5371#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 16:54:55,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {5371#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5371#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 16:54:55,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {5371#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5378#(and (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_#res#1.base|))) (= |node_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:54:55,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {5378#(and (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_#res#1.base|))) (= |node_create_#res#1.offset| (_ bv0 32)))} assume true; {5378#(and (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_#res#1.base|))) (= |node_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:54:55,405 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5378#(and (= (_ bv0 1) (bvneg (select |old(#valid)| |node_create_#res#1.base|))) (= |node_create_#res#1.offset| (_ bv0 32)))} {5360#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} #132#return; {5385#(and (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| (_ bv0 32)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 16:54:55,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {5385#(and (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| (_ bv0 32)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {5389#(and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:54:55,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {5389#(and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {5393#(and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 16:54:55,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {5393#(and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {5397#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 16:54:55,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {5397#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {5397#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 16:54:55,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {5397#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {5404#(and (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32))) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_#res#1.base|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_#res#1.base|)))} is VALID [2022-02-20 16:54:55,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {5404#(and (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32))) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_#res#1.base|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_#res#1.base|)))} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {5408#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {5408#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {5412#(and (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_dll_circular_update_at_~data#1| (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {5412#(and (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_dll_circular_update_at_~data#1| (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {5412#(and (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_dll_circular_update_at_~data#1| (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {5412#(and (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_dll_circular_update_at_~data#1| (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {5419#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {5419#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} assume { :end_inline_dll_circular_update_at } true; {5419#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {5419#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {5426#(and (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) |ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {5426#(and (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) |ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {5430#(and (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) |ULTIMATE.start_dll_circular_update_at_~data#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {5430#(and (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) |ULTIMATE.start_dll_circular_update_at_~data#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {5434#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) |ULTIMATE.start_dll_circular_update_at_~data#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {5434#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) |ULTIMATE.start_dll_circular_update_at_~data#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {5434#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) |ULTIMATE.start_dll_circular_update_at_~data#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {5434#(and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) |ULTIMATE.start_dll_circular_update_at_~data#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {5441#(and (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {5441#(and (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} assume { :end_inline_dll_circular_update_at } true; {5441#(and (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {5441#(and (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {5441#(and (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {5441#(and (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {5441#(and (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {5441#(and (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} main_~i~0#1 := 0bv32; {5454#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {5454#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {5454#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {5454#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {5454#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {5454#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {5454#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {5454#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {5454#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {5454#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {5454#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {5454#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post16#1);havoc main_#t~post16#1; {5473#(and (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 16:54:55,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {5473#(and (= (bvadd (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {5477#(and (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~expected~0#1| (bvadd (_ bv1 32) (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv8 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32))) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32)))) (bvadd (_ bv1 32) (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv8 32))))} is VALID [2022-02-20 16:54:55,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {5477#(and (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~expected~0#1| (bvadd (_ bv1 32) (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv8 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32))) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32)))) (bvadd (_ bv1 32) (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv8 32))))} assume !!~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32);call dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, 4bv32);dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset;dll_circular_get_data_at_#t~post10#1 := dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~index#1 := ~bvsub32(dll_circular_get_data_at_#t~post10#1, 1bv32);havoc dll_circular_get_data_at_#t~post10#1; {5481#(and (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~expected~0#1| (bvadd (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13|) (_ bv8 32)) (_ bv1 32))) (= (bvadd (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13|) (_ bv8 32)) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32)))) (= (_ bv2 32) (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13|) (_ bv8 32))))))} is VALID [2022-02-20 16:54:55,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {5481#(and (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~expected~0#1| (bvadd (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13|) (_ bv8 32)) (_ bv1 32))) (= (bvadd (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13|) (_ bv8 32)) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32)))) (= (_ bv2 32) (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13|) (_ bv8 32))))))} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {5481#(and (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~expected~0#1| (bvadd (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13|) (_ bv8 32)) (_ bv1 32))) (= (bvadd (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13|) (_ bv8 32)) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32)))) (= (_ bv2 32) (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13|) (_ bv8 32))))))} is VALID [2022-02-20 16:54:55,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {5481#(and (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~expected~0#1| (bvadd (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13|) (_ bv8 32)) (_ bv1 32))) (= (bvadd (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13|) (_ bv8 32)) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32)))) (= (_ bv2 32) (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13|) (_ bv8 32))))))} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {5488#(and (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (= (_ bv2 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_circular_get_data_at_#res#1|)))} is VALID [2022-02-20 16:54:55,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {5488#(and (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (= (_ bv2 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_circular_get_data_at_#res#1|)))} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {5492#(and (= (_ bv2 32) (bvadd |ULTIMATE.start_main_~expected~0#1| (_ bv4294967295 32))) (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|))} is VALID [2022-02-20 16:54:55,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {5492#(and (= (_ bv2 32) (bvadd |ULTIMATE.start_main_~expected~0#1| (_ bv4294967295 32))) (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|))} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {5328#false} is VALID [2022-02-20 16:54:55,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {5328#false} assume !false; {5328#false} is VALID [2022-02-20 16:54:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:54:55,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:57,969 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_745) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) is different from false [2022-02-20 16:54:58,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_745) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)))) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) is different from false [2022-02-20 16:54:58,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_745) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)))) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) is different from false [2022-02-20 16:54:58,063 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_745) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)))))) is different from false [2022-02-20 16:54:58,193 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 656 treesize of output 588 [2022-02-20 16:54:58,683 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_741)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_736))) (.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse3 (select (select (store .cse8 .cse6 v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse5 (bvadd (_ bv8 32) (select (select (store .cse7 .cse6 v_ArrVal_745) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32))) (.cse0 (= .cse5 (bvadd (_ bv8 32) (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (.cse2 (= .cse6 .cse3))) (or (and .cse0 (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse1) .cse2) (and (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| .cse1) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| .cse3) (or (not .cse0) (not .cse2)) (= .cse4 .cse5))))))))) is different from false [2022-02-20 16:54:59,160 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_741))) (let ((.cse6 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_736)) (.cse0 (select .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse5 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| .cse6) .cse0 v_ArrVal_745) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse7) .cse0 v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse3 (= (bvadd (_ bv8 32) (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|)) .cse5)) (.cse2 (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) (or (and (= .cse0 .cse1) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse2) .cse3) (and (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (not .cse3) (= .cse4 .cse5) (= .cse2 (bvadd |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)))))))))) is different from false [2022-02-20 16:54:59,251 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse3 v_ArrVal_741))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0) .cse1 v_ArrVal_743) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse1) (let ((.cse2 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse3 v_ArrVal_736))) (= (bvadd (_ bv8 32) (select .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2) .cse1 v_ArrVal_745) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))))) is different from false [2022-02-20 16:54:59,280 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_730) .cse3 v_ArrVal_736))) (= (bvadd (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (select (store (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_726) .cse3 v_ArrVal_741) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_745) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (_ bv8 32)) (bvadd (_ bv8 32) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse5 (store (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse5) .cse6 v_ArrVal_743) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse6)))))) is different from false [2022-02-20 16:54:59,346 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse2 (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_743) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse6 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse3 (store (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse5 v_ArrVal_730) .cse6 v_ArrVal_736))) (= (bvadd (_ bv8 32) (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3) (select (store (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse5 v_ArrVal_726) .cse6 v_ArrVal_741) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_745) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) is different from false [2022-02-20 16:54:59,413 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_722 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_743) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse2))))) (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_722 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_723))) (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse4 (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse7 v_ArrVal_730) .cse8 v_ArrVal_736))) (= (bvadd (_ bv8 32) (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse4) (select (store (store (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722))) (store .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse7 v_ArrVal_726) .cse8 v_ArrVal_741) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_745) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) is different from false [2022-02-20 16:54:59,448 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:54:59,448 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 1 case distinctions, treesize of input 177 treesize of output 138 [2022-02-20 16:54:59,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:54:59,543 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 1566 treesize of output 1558 [2022-02-20 16:54:59,581 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:54:59,582 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 1 case distinctions, treesize of input 920 treesize of output 736 [2022-02-20 16:54:59,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:54:59,625 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 2968 treesize of output 2878 [2022-02-20 16:54:59,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:54:59,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:54:59,658 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 2528 treesize of output 2432 [2022-02-20 16:54:59,778 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 2336 treesize of output 2312 [2022-02-20 16:54:59,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:54:59,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:54:59,807 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 2280 treesize of output 2270 [2022-02-20 16:54:59,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:54:59,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:54:59,891 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 1510 treesize of output 1502 [2022-02-20 16:55:00,805 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 6 treesize of output 4 [2022-02-20 16:55:00,841 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 1003 treesize of output 985 [2022-02-20 16:55:00,899 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:55:00,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 1 [2022-02-20 16:55:01,425 INFO L290 TraceCheckUtils]: 47: Hoare triple {5328#false} assume !false; {5328#false} is VALID [2022-02-20 16:55:01,426 INFO L290 TraceCheckUtils]: 46: Hoare triple {5502#(= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|)} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {5328#false} is VALID [2022-02-20 16:55:01,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {5506#(= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {5502#(= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|)} is VALID [2022-02-20 16:55:01,427 INFO L290 TraceCheckUtils]: 44: Hoare triple {5510#(= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32))))} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {5506#(= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)} is VALID [2022-02-20 16:55:01,427 INFO L290 TraceCheckUtils]: 43: Hoare triple {5510#(= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32))))} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {5510#(= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32))))} is VALID [2022-02-20 16:55:01,427 INFO L290 TraceCheckUtils]: 42: Hoare triple {5517#(= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))))} assume !!~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32);call dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, 4bv32);dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset;dll_circular_get_data_at_#t~post10#1 := dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~index#1 := ~bvsub32(dll_circular_get_data_at_#t~post10#1, 1bv32);havoc dll_circular_get_data_at_#t~post10#1; {5510#(= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32))))} is VALID [2022-02-20 16:55:01,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {5521#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {5517#(= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))))} is VALID [2022-02-20 16:55:01,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {5525#(= (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post16#1);havoc main_#t~post16#1; {5521#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:55:01,617 INFO L290 TraceCheckUtils]: 39: Hoare triple {5525#(= (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {5525#(= (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} is VALID [2022-02-20 16:55:01,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {5525#(= (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {5525#(= (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} is VALID [2022-02-20 16:55:01,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {5525#(= (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {5525#(= (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} is VALID [2022-02-20 16:55:01,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {5525#(= (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {5525#(= (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} is VALID [2022-02-20 16:55:01,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {5525#(= (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {5525#(= (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} is VALID [2022-02-20 16:55:01,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {5544#(= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} main_~i~0#1 := 0bv32; {5525#(= (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} is VALID [2022-02-20 16:55:01,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {5544#(= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {5544#(= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} is VALID [2022-02-20 16:55:01,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {5544#(= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {5544#(= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} is VALID [2022-02-20 16:55:01,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {5544#(= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} assume { :end_inline_dll_circular_update_at } true; {5544#(= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} is VALID [2022-02-20 16:55:03,624 WARN L290 TraceCheckUtils]: 30: Hoare triple {5557#(forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select (store |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {5544#(= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))} is UNKNOWN [2022-02-20 16:55:03,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {5557#(forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select (store |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {5557#(forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select (store |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))))} is VALID [2022-02-20 16:55:03,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {5564#(forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (_ bv8 32)) |ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))))} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {5557#(forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select (store |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))))} is VALID [2022-02-20 16:55:03,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {5568#(forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32))))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {5564#(forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (_ bv8 32)) |ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))))} is VALID [2022-02-20 16:55:05,666 WARN L290 TraceCheckUtils]: 26: Hoare triple {5572#(forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {5568#(forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32))))} is UNKNOWN [2022-02-20 16:55:05,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {5572#(forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))))} assume { :end_inline_dll_circular_update_at } true; {5572#(forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))))} is VALID [2022-02-20 16:55:07,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {5579#(forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) |ULTIMATE.start_dll_circular_update_at_~data#1|) (or (not (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (not (= (bvadd (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))) (= (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (= (bvadd (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32))))))} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {5572#(forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))))} is VALID [2022-02-20 16:55:07,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {5579#(forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) |ULTIMATE.start_dll_circular_update_at_~data#1|) (or (not (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (not (= (bvadd (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))) (= (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (= (bvadd (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32))))))} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {5579#(forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) |ULTIMATE.start_dll_circular_update_at_~data#1|) (or (not (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (not (= (bvadd (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))) (= (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (= (bvadd (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32))))))} is VALID [2022-02-20 16:55:07,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {5586#(forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (= |ULTIMATE.start_main_~s~0#1.base| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_736)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (not (= (bvadd (_ bv8 32) (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_736) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_736)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))) (and (= (bvadd (_ bv8 32) (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_736) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_736)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_main_~s~0#1.offset|) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32))))))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {5579#(forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) |ULTIMATE.start_dll_circular_update_at_~data#1|) (or (not (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (not (= (bvadd (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))) (= (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (= (bvadd (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_736)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_741)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32))))))} is VALID [2022-02-20 16:55:07,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {5590#(forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_736)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_745) |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (bvadd (_ bv8 32) (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_736) |ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_741)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_743) |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_#res#1.offset|))))} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {5586#(forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (= |ULTIMATE.start_main_~s~0#1.base| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_736)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (not (= (bvadd (_ bv8 32) (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_736) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_736)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))) (and (= (bvadd (_ bv8 32) (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_736) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_736)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_main_~s~0#1.offset|) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32))))))} is VALID [2022-02-20 16:55:07,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {5594#(and (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv8 32) (select (select (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_730) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_736)) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (bvadd (_ bv8 32) (select (store (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_730) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_736) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741)) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {5590#(forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_736)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_745) |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (bvadd (_ bv8 32) (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_736) |ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_741)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_743) |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_#res#1.offset|))))} is VALID [2022-02-20 16:55:07,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {5594#(and (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv8 32) (select (select (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_730) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_736)) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (bvadd (_ bv8 32) (select (store (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_730) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_736) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741)) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {5594#(and (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv8 32) (select (select (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_730) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_736)) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (bvadd (_ bv8 32) (select (store (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_730) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_736) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741)) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))} is VALID [2022-02-20 16:55:07,548 WARN L290 TraceCheckUtils]: 18: Hoare triple {5601#(and (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv8 32) (select (store (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_730) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_736) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_730) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_736)) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741)) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {5594#(and (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv8 32) (select (select (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_730) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_736)) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (bvadd (_ bv8 32) (select (store (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_730) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_736) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741)) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))} is UNKNOWN [2022-02-20 16:55:07,828 WARN L290 TraceCheckUtils]: 17: Hoare triple {5605#(and (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_722 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store (store (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_723) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_723) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_730) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_736) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (bvadd (_ bv8 32) (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_723) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_723) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_723) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_723) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_730) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_736)) (select (store (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_722 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741)) (select (store (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (select (store (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {5601#(and (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv8 32) (select (store (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_730) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_736) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_730) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_736)) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741)) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (select (store (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))} is UNKNOWN [2022-02-20 16:55:07,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {5609#(and (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {5605#(and (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_722 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store (store (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_723) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_723) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_730) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_736) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (bvadd (_ bv8 32) (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_723) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_723) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_723) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_723) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_730) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_736)) (select (store (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_745) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_722 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741)) (select (store (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_743) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (select (store (store (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))} is VALID [2022-02-20 16:55:07,833 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5617#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_#res#1.base|))))} {5613#(and (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (_ bv0 1))) (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (_ bv0 1))))} #132#return; {5609#(and (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 16:55:07,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {5617#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_#res#1.base|))))} assume true; {5617#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_#res#1.base|))))} is VALID [2022-02-20 16:55:07,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {5624#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5617#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_#res#1.base|))))} is VALID [2022-02-20 16:55:07,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {5624#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5624#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 16:55:07,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {5631#(forall ((|v_node_create_~temp~0#1.base_46| (_ BitVec 32))) (or (= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |v_node_create_~temp~0#1.base_46|)))) (not (= (_ bv0 1) (bvneg (select |#valid| |v_node_create_~temp~0#1.base_46|))))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5624#(= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 16:55:07,836 INFO L272 TraceCheckUtils]: 10: Hoare triple {5613#(and (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (_ bv0 1))) (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (_ bv0 1))))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {5631#(forall ((|v_node_create_~temp~0#1.base_46| (_ BitVec 32))) (or (= (_ bv0 1) (bvneg (bvneg (select |old(#valid)| |v_node_create_~temp~0#1.base_46|)))) (not (= (_ bv0 1) (bvneg (select |#valid| |v_node_create_~temp~0#1.base_46|))))))} is VALID [2022-02-20 16:55:07,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {5613#(and (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (_ bv0 1))) (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (_ bv0 1))))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {5613#(and (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (_ bv0 1))) (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (_ bv0 1))))} is VALID [2022-02-20 16:55:07,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {5638#(not (= (_ bv0 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|)))))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {5613#(and (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (_ bv0 1))) (not (= (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (_ bv0 1))))} is VALID [2022-02-20 16:55:07,837 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5645#(not (= (_ bv0 1) (bvneg (bvneg (select |#valid| |node_create_#res#1.base|)))))} {5327#true} #130#return; {5638#(not (= (_ bv0 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|)))))} is VALID [2022-02-20 16:55:07,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {5645#(not (= (_ bv0 1) (bvneg (bvneg (select |#valid| |node_create_#res#1.base|)))))} assume true; {5645#(not (= (_ bv0 1) (bvneg (bvneg (select |#valid| |node_create_#res#1.base|)))))} is VALID [2022-02-20 16:55:07,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {5652#(not (= (_ bv0 1) (bvneg (bvneg (select |#valid| |node_create_~temp~0#1.base|)))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5645#(not (= (_ bv0 1) (bvneg (bvneg (select |#valid| |node_create_#res#1.base|)))))} is VALID [2022-02-20 16:55:07,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {5652#(not (= (_ bv0 1) (bvneg (bvneg (select |#valid| |node_create_~temp~0#1.base|)))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5652#(not (= (_ bv0 1) (bvneg (bvneg (select |#valid| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 16:55:07,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {5327#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5652#(not (= (_ bv0 1) (bvneg (bvneg (select |#valid| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 16:55:07,841 INFO L272 TraceCheckUtils]: 2: Hoare triple {5327#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {5327#true} is VALID [2022-02-20 16:55:07,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {5327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {5327#true} is VALID [2022-02-20 16:55:07,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {5327#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {5327#true} is VALID [2022-02-20 16:55:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-02-20 16:55:07,841 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:55:07,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137309978] [2022-02-20 16:55:07,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137309978] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:55:07,841 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:55:07,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2022-02-20 16:55:07,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16093615] [2022-02-20 16:55:07,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:55:07,842 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 47 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2022-02-20 16:55:07,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:07,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 53 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 47 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:55:15,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 89 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:15,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-02-20 16:55:15,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:55:15,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-02-20 16:55:15,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1695, Unknown=10, NotChecked=910, Total=2756 [2022-02-20 16:55:15,158 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 53 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 47 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:55:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:26,090 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-02-20 16:55:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-20 16:55:26,093 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 47 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2022-02-20 16:55:26,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 47 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:55:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 80 transitions. [2022-02-20 16:55:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 47 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:55:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 80 transitions. [2022-02-20 16:55:26,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 80 transitions. [2022-02-20 16:55:26,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:26,232 INFO L225 Difference]: With dead ends: 89 [2022-02-20 16:55:26,232 INFO L226 Difference]: Without dead ends: 84 [2022-02-20 16:55:26,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 10 IntricatePredicates, 4 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=264, Invalid=3188, Unknown=10, NotChecked=1230, Total=4692 [2022-02-20 16:55:26,234 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 643 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:26,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 619 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 517 Invalid, 0 Unknown, 643 Unchecked, 1.5s Time] [2022-02-20 16:55:26,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-02-20 16:55:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-02-20 16:55:26,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:26,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 83 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:55:26,242 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 83 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:55:26,242 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 83 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:55:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:26,244 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-02-20 16:55:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-02-20 16:55:26,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:26,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:26,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 84 states. [2022-02-20 16:55:26,244 INFO L87 Difference]: Start difference. First operand has 83 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 84 states. [2022-02-20 16:55:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:26,246 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-02-20 16:55:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-02-20 16:55:26,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:26,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:26,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:26,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:26,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:55:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-02-20 16:55:26,249 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 48 [2022-02-20 16:55:26,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:26,249 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-02-20 16:55:26,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 47 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:55:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-02-20 16:55:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 16:55:26,250 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:26,250 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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 16:55:26,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 16:55:26,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:55:26,460 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:26,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:26,461 INFO L85 PathProgramCache]: Analyzing trace with hash -964486420, now seen corresponding path program 2 times [2022-02-20 16:55:26,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:55:26,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494085741] [2022-02-20 16:55:26,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:55:26,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:55:26,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:55:26,462 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:55:26,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 16:55:26,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:55:26,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:55:26,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:55:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:26,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:55:26,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {6121#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {6121#true} is VALID [2022-02-20 16:55:26,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {6121#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {6121#true} is VALID [2022-02-20 16:55:26,732 INFO L272 TraceCheckUtils]: 2: Hoare triple {6121#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {6121#true} is VALID [2022-02-20 16:55:26,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {6121#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6121#true} is VALID [2022-02-20 16:55:26,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {6121#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6121#true} is VALID [2022-02-20 16:55:26,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {6121#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6121#true} is VALID [2022-02-20 16:55:26,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {6121#true} assume true; {6121#true} is VALID [2022-02-20 16:55:26,732 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6121#true} {6121#true} #130#return; {6121#true} is VALID [2022-02-20 16:55:26,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {6121#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {6121#true} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L272 TraceCheckUtils]: 10: Hoare triple {6121#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {6121#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {6121#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {6121#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {6121#true} assume true; {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6121#true} {6121#true} #132#return; {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {6121#true} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {6121#true} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {6121#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {6121#true} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {6121#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {6121#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {6121#true} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {6121#true} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {6121#true} is VALID [2022-02-20 16:55:26,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {6121#true} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {6121#true} is VALID [2022-02-20 16:55:26,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {6121#true} assume { :end_inline_dll_circular_update_at } true; {6121#true} is VALID [2022-02-20 16:55:26,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {6121#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {6121#true} is VALID [2022-02-20 16:55:26,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {6121#true} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {6121#true} is VALID [2022-02-20 16:55:26,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {6121#true} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {6121#true} is VALID [2022-02-20 16:55:26,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {6121#true} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {6121#true} is VALID [2022-02-20 16:55:26,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {6121#true} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {6121#true} is VALID [2022-02-20 16:55:26,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {6121#true} assume { :end_inline_dll_circular_update_at } true; {6121#true} is VALID [2022-02-20 16:55:26,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {6121#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {6121#true} is VALID [2022-02-20 16:55:26,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {6121#true} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {6121#true} is VALID [2022-02-20 16:55:26,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {6121#true} main_~i~0#1 := 0bv32; {6228#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:55:26,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {6228#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {6228#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:55:26,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {6228#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {6228#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:55:26,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {6228#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {6228#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:55:26,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {6228#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {6228#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:55:26,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {6228#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {6228#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:55:26,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {6228#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post16#1);havoc main_#t~post16#1; {6247#(= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))} is VALID [2022-02-20 16:55:26,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {6247#(= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {6251#(= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv1 32))} is VALID [2022-02-20 16:55:26,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {6251#(= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv1 32))} assume !!~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32);call dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, 4bv32);dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset;dll_circular_get_data_at_#t~post10#1 := dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~index#1 := ~bvsub32(dll_circular_get_data_at_#t~post10#1, 1bv32);havoc dll_circular_get_data_at_#t~post10#1; {6255#(= (bvadd |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv1 32)) (_ bv1 32))} is VALID [2022-02-20 16:55:26,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {6255#(= (bvadd |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv1 32)) (_ bv1 32))} assume !!~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32);call dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, 4bv32);dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset;dll_circular_get_data_at_#t~post10#1 := dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~index#1 := ~bvsub32(dll_circular_get_data_at_#t~post10#1, 1bv32);havoc dll_circular_get_data_at_#t~post10#1; {6122#false} is VALID [2022-02-20 16:55:26,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {6122#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {6122#false} is VALID [2022-02-20 16:55:26,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {6122#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {6122#false} is VALID [2022-02-20 16:55:26,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {6122#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {6122#false} is VALID [2022-02-20 16:55:26,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {6122#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {6122#false} is VALID [2022-02-20 16:55:26,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {6122#false} assume !false; {6122#false} is VALID [2022-02-20 16:55:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 16:55:26,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:55:26,874 INFO L290 TraceCheckUtils]: 48: Hoare triple {6122#false} assume !false; {6122#false} is VALID [2022-02-20 16:55:26,874 INFO L290 TraceCheckUtils]: 47: Hoare triple {6122#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {6122#false} is VALID [2022-02-20 16:55:26,874 INFO L290 TraceCheckUtils]: 46: Hoare triple {6122#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {6122#false} is VALID [2022-02-20 16:55:26,874 INFO L290 TraceCheckUtils]: 45: Hoare triple {6122#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {6122#false} is VALID [2022-02-20 16:55:26,874 INFO L290 TraceCheckUtils]: 44: Hoare triple {6122#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {6122#false} is VALID [2022-02-20 16:55:26,874 INFO L290 TraceCheckUtils]: 43: Hoare triple {6289#(not (bvsgt |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32)))} assume !!~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32);call dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, 4bv32);dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset;dll_circular_get_data_at_#t~post10#1 := dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~index#1 := ~bvsub32(dll_circular_get_data_at_#t~post10#1, 1bv32);havoc dll_circular_get_data_at_#t~post10#1; {6122#false} is VALID [2022-02-20 16:55:26,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {6293#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (_ bv0 32)))} assume !!~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32);call dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, 4bv32);dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset;dll_circular_get_data_at_#t~post10#1 := dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~index#1 := ~bvsub32(dll_circular_get_data_at_#t~post10#1, 1bv32);havoc dll_circular_get_data_at_#t~post10#1; {6289#(not (bvsgt |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32)))} is VALID [2022-02-20 16:55:26,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {6297#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {6293#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (_ bv0 32)))} is VALID [2022-02-20 16:55:26,876 INFO L290 TraceCheckUtils]: 40: Hoare triple {6301#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post16#1);havoc main_#t~post16#1; {6297#(not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32)))} is VALID [2022-02-20 16:55:26,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {6301#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {6301#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:55:26,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {6301#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {6301#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:55:26,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {6301#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {6301#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:55:26,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {6301#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {6301#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:55:26,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {6301#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {6301#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:55:26,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {6121#true} main_~i~0#1 := 0bv32; {6301#(not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:55:26,879 INFO L290 TraceCheckUtils]: 33: Hoare triple {6121#true} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {6121#true} is VALID [2022-02-20 16:55:26,879 INFO L290 TraceCheckUtils]: 32: Hoare triple {6121#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {6121#true} assume { :end_inline_dll_circular_update_at } true; {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {6121#true} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {6121#true} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {6121#true} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {6121#true} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {6121#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {6121#true} assume { :end_inline_dll_circular_update_at } true; {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {6121#true} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {6121#true} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {6121#true} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {6121#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {6121#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {6121#true} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {6121#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {6121#true} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {6121#true} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {6121#true} is VALID [2022-02-20 16:55:26,880 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6121#true} {6121#true} #132#return; {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {6121#true} assume true; {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {6121#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {6121#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {6121#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L272 TraceCheckUtils]: 10: Hoare triple {6121#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {6121#true} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {6121#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6121#true} {6121#true} #130#return; {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {6121#true} assume true; {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {6121#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L290 TraceCheckUtils]: 4: Hoare triple {6121#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {6121#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L272 TraceCheckUtils]: 2: Hoare triple {6121#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {6121#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {6121#true} is VALID [2022-02-20 16:55:26,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {6121#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {6121#true} is VALID [2022-02-20 16:55:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 16:55:26,882 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:55:26,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494085741] [2022-02-20 16:55:26,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494085741] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:55:26,882 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:55:26,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-02-20 16:55:26,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648449903] [2022-02-20 16:55:26,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:55:26,882 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-02-20 16:55:26,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:26,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:55:26,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:26,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 16:55:26,922 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:55:26,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 16:55:26,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:55:26,923 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:55:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:27,612 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-02-20 16:55:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:55:27,612 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-02-20 16:55:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:55:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-02-20 16:55:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:55:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-02-20 16:55:27,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-02-20 16:55:27,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:27,661 INFO L225 Difference]: With dead ends: 92 [2022-02-20 16:55:27,661 INFO L226 Difference]: Without dead ends: 62 [2022-02-20 16:55:27,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-02-20 16:55:27,661 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 43 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:27,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 222 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:55:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-20 16:55:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-02-20 16:55:27,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:27,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 60 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:55:27,670 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 60 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:55:27,671 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 60 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:55:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:27,672 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-02-20 16:55:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-02-20 16:55:27,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:27,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:27,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 62 states. [2022-02-20 16:55:27,673 INFO L87 Difference]: Start difference. First operand has 60 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 62 states. [2022-02-20 16:55:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:27,674 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-02-20 16:55:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-02-20 16:55:27,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:27,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:27,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:27,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:55:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-02-20 16:55:27,676 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 49 [2022-02-20 16:55:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:27,676 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-02-20 16:55:27,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:55:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-02-20 16:55:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 16:55:27,677 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:27,677 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 16:55:27,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 16:55:27,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:55:27,887 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:27,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:27,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1687625933, now seen corresponding path program 4 times [2022-02-20 16:55:27,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:55:27,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428267901] [2022-02-20 16:55:27,888 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 16:55:27,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:55:27,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:55:27,890 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:55:27,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 16:55:28,035 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 16:55:28,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:55:28,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:55:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:28,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:55:28,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {6770#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {6770#true} is VALID [2022-02-20 16:55:28,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {6770#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:55:28,164 INFO L272 TraceCheckUtils]: 2: Hoare triple {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {6770#true} is VALID [2022-02-20 16:55:28,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {6770#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6770#true} is VALID [2022-02-20 16:55:28,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {6770#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6770#true} is VALID [2022-02-20 16:55:28,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {6770#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6770#true} is VALID [2022-02-20 16:55:28,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {6770#true} assume true; {6770#true} is VALID [2022-02-20 16:55:28,165 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6770#true} {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} #130#return; {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:55:28,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:55:28,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:55:28,165 INFO L272 TraceCheckUtils]: 10: Hoare triple {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {6770#true} is VALID [2022-02-20 16:55:28,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {6770#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6770#true} is VALID [2022-02-20 16:55:28,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {6770#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6770#true} is VALID [2022-02-20 16:55:28,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {6770#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6770#true} is VALID [2022-02-20 16:55:28,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {6770#true} assume true; {6770#true} is VALID [2022-02-20 16:55:28,166 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6770#true} {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} #132#return; {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:55:28,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:55:28,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:55:28,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {6778#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {6830#(= (_ bv2 32) (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32)))} is VALID [2022-02-20 16:55:28,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {6830#(= (_ bv2 32) (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32)))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {6771#false} is VALID [2022-02-20 16:55:28,167 INFO L272 TraceCheckUtils]: 20: Hoare triple {6771#false} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {6771#false} is VALID [2022-02-20 16:55:28,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {6771#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6771#false} is VALID [2022-02-20 16:55:28,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {6771#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6771#false} is VALID [2022-02-20 16:55:28,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {6771#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6771#false} is VALID [2022-02-20 16:55:28,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {6771#false} assume true; {6771#false} is VALID [2022-02-20 16:55:28,168 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6771#false} {6771#false} #132#return; {6771#false} is VALID [2022-02-20 16:55:28,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {6771#false} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {6771#false} is VALID [2022-02-20 16:55:28,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {6771#false} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {6771#false} is VALID [2022-02-20 16:55:28,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {6771#false} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {6771#false} is VALID [2022-02-20 16:55:28,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {6771#false} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {6771#false} is VALID [2022-02-20 16:55:28,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {6771#false} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {6771#false} is VALID [2022-02-20 16:55:28,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {6771#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {6771#false} is VALID [2022-02-20 16:55:28,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {6771#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {6771#false} is VALID [2022-02-20 16:55:28,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {6771#false} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {6771#false} is VALID [2022-02-20 16:55:28,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {6771#false} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {6771#false} is VALID [2022-02-20 16:55:28,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {6771#false} assume { :end_inline_dll_circular_update_at } true; {6771#false} is VALID [2022-02-20 16:55:28,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {6771#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {6771#false} is VALID [2022-02-20 16:55:28,169 INFO L290 TraceCheckUtils]: 37: Hoare triple {6771#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {6771#false} is VALID [2022-02-20 16:55:28,169 INFO L290 TraceCheckUtils]: 38: Hoare triple {6771#false} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {6771#false} is VALID [2022-02-20 16:55:28,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {6771#false} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {6771#false} is VALID [2022-02-20 16:55:28,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {6771#false} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {6771#false} is VALID [2022-02-20 16:55:28,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {6771#false} assume { :end_inline_dll_circular_update_at } true; {6771#false} is VALID [2022-02-20 16:55:28,170 INFO L290 TraceCheckUtils]: 42: Hoare triple {6771#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {6771#false} is VALID [2022-02-20 16:55:28,170 INFO L290 TraceCheckUtils]: 43: Hoare triple {6771#false} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {6771#false} is VALID [2022-02-20 16:55:28,170 INFO L290 TraceCheckUtils]: 44: Hoare triple {6771#false} main_~i~0#1 := 0bv32; {6771#false} is VALID [2022-02-20 16:55:28,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {6771#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {6771#false} is VALID [2022-02-20 16:55:28,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {6771#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {6771#false} is VALID [2022-02-20 16:55:28,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {6771#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {6771#false} is VALID [2022-02-20 16:55:28,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {6771#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {6771#false} is VALID [2022-02-20 16:55:28,171 INFO L290 TraceCheckUtils]: 49: Hoare triple {6771#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {6771#false} is VALID [2022-02-20 16:55:28,171 INFO L290 TraceCheckUtils]: 50: Hoare triple {6771#false} assume !false; {6771#false} is VALID [2022-02-20 16:55:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 16:55:28,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:55:28,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {6771#false} assume !false; {6771#false} is VALID [2022-02-20 16:55:28,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {6771#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {6771#false} is VALID [2022-02-20 16:55:28,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {6771#false} main_#t~ret17#1 := dll_circular_get_data_at_#res#1;assume { :end_inline_dll_circular_get_data_at } true; {6771#false} is VALID [2022-02-20 16:55:28,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {6771#false} call dll_circular_get_data_at_#t~mem11#1 := read~intINTTYPE4(dll_circular_get_data_at_~head#1.base, ~bvadd32(8bv32, dll_circular_get_data_at_~head#1.offset), 4bv32);dll_circular_get_data_at_#res#1 := dll_circular_get_data_at_#t~mem11#1;havoc dll_circular_get_data_at_#t~mem11#1; {6771#false} is VALID [2022-02-20 16:55:28,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {6771#false} assume !~bvsgt32(dll_circular_get_data_at_~index#1, 0bv32); {6771#false} is VALID [2022-02-20 16:55:28,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {6771#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~expected~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_get_data_at } true;dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset, dll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc dll_circular_get_data_at_#res#1;havoc dll_circular_get_data_at_#t~mem9#1.base, dll_circular_get_data_at_#t~mem9#1.offset, dll_circular_get_data_at_#t~post10#1, dll_circular_get_data_at_#t~mem11#1, dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset, dll_circular_get_data_at_~index#1;dll_circular_get_data_at_~head#1.base, dll_circular_get_data_at_~head#1.offset := dll_circular_get_data_at_#in~head#1.base, dll_circular_get_data_at_#in~head#1.offset;dll_circular_get_data_at_~index#1 := dll_circular_get_data_at_#in~index#1; {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {6771#false} main_~i~0#1 := 0bv32; {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {6771#false} assume !~bvslt32(main_~i~0#1, main_~len~0#1); {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {6771#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {6771#false} assume { :end_inline_dll_circular_update_at } true; {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {6771#false} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {6771#false} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {6771#false} assume !!~bvsgt32(dll_circular_update_at_~index#1, 0bv32);call dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, 4bv32);dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;havoc dll_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset;dll_circular_update_at_#t~post13#1 := dll_circular_update_at_~index#1;dll_circular_update_at_~index#1 := ~bvsub32(dll_circular_update_at_#t~post13#1, 1bv32);havoc dll_circular_update_at_#t~post13#1; {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {6771#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {6771#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post15#1);havoc main_#t~post15#1; {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {6771#false} assume { :end_inline_dll_circular_update_at } true; {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {6771#false} call write~intINTTYPE4(dll_circular_update_at_~data#1, dll_circular_update_at_~head#1.base, ~bvadd32(8bv32, dll_circular_update_at_~head#1.offset), 4bv32); {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {6771#false} assume !~bvsgt32(dll_circular_update_at_~index#1, 0bv32); {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {6771#false} assume !!~bvslt32(main_~i~0#1, main_~len~0#1);main_~new_data~0#1 := ~bvadd32(main_~i~0#1, main_~len~0#1);assume { :begin_inline_dll_circular_update_at } true;dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset, dll_circular_update_at_#in~data#1, dll_circular_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_circular_update_at_#t~mem12#1.base, dll_circular_update_at_#t~mem12#1.offset, dll_circular_update_at_#t~post13#1, dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset, dll_circular_update_at_~data#1, dll_circular_update_at_~index#1;dll_circular_update_at_~head#1.base, dll_circular_update_at_~head#1.offset := dll_circular_update_at_#in~head#1.base, dll_circular_update_at_#in~head#1.offset;dll_circular_update_at_~data#1 := dll_circular_update_at_#in~data#1;dll_circular_update_at_~index#1 := dll_circular_update_at_#in~index#1; {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {6771#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0bv32;main_~i~0#1 := 0bv32; {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {6771#false} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {6771#false} is VALID [2022-02-20 16:55:28,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {6771#false} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {6771#false} is VALID [2022-02-20 16:55:28,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {6771#false} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {6771#false} is VALID [2022-02-20 16:55:28,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {6771#false} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {6771#false} is VALID [2022-02-20 16:55:28,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {6771#false} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {6771#false} is VALID [2022-02-20 16:55:28,318 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6770#true} {6771#false} #132#return; {6771#false} is VALID [2022-02-20 16:55:28,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {6770#true} assume true; {6770#true} is VALID [2022-02-20 16:55:28,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {6770#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6770#true} is VALID [2022-02-20 16:55:28,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {6770#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6770#true} is VALID [2022-02-20 16:55:28,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {6770#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6770#true} is VALID [2022-02-20 16:55:28,318 INFO L272 TraceCheckUtils]: 20: Hoare triple {6771#false} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {6770#true} is VALID [2022-02-20 16:55:28,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {7020#(not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32)))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {6771#false} is VALID [2022-02-20 16:55:28,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {7020#(not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32)))} is VALID [2022-02-20 16:55:28,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} is VALID [2022-02-20 16:55:28,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} is VALID [2022-02-20 16:55:28,322 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6770#true} {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} #132#return; {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} is VALID [2022-02-20 16:55:28,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {6770#true} assume true; {6770#true} is VALID [2022-02-20 16:55:28,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {6770#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6770#true} is VALID [2022-02-20 16:55:28,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {6770#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6770#true} is VALID [2022-02-20 16:55:28,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {6770#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6770#true} is VALID [2022-02-20 16:55:28,322 INFO L272 TraceCheckUtils]: 10: Hoare triple {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {6770#true} is VALID [2022-02-20 16:55:28,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} is VALID [2022-02-20 16:55:28,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} is VALID [2022-02-20 16:55:28,323 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6770#true} {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} #130#return; {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} is VALID [2022-02-20 16:55:28,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {6770#true} assume true; {6770#true} is VALID [2022-02-20 16:55:28,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {6770#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6770#true} is VALID [2022-02-20 16:55:28,323 INFO L290 TraceCheckUtils]: 4: Hoare triple {6770#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6770#true} is VALID [2022-02-20 16:55:28,323 INFO L290 TraceCheckUtils]: 3: Hoare triple {6770#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6770#true} is VALID [2022-02-20 16:55:28,323 INFO L272 TraceCheckUtils]: 2: Hoare triple {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {6770#true} is VALID [2022-02-20 16:55:28,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {6770#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#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 := 2bv32;main_~data~0#1 := 1bv32;assume { :begin_inline_dll_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {7024#(not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32)))} is VALID [2022-02-20 16:55:28,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {6770#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {6770#true} is VALID [2022-02-20 16:55:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 16:55:28,324 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:55:28,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428267901] [2022-02-20 16:55:28,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428267901] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:55:28,324 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:55:28,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-02-20 16:55:28,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614678297] [2022-02-20 16:55:28,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:55:28,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2022-02-20 16:55:28,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:28,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:55:28,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:28,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:55:28,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:55:28,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:55:28,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:55:28,372 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:55:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:28,518 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-02-20 16:55:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:55:28,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2022-02-20 16:55:28,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:55:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-02-20 16:55:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:55:28,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-02-20 16:55:28,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-02-20 16:55:28,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:28,563 INFO L225 Difference]: With dead ends: 65 [2022-02-20 16:55:28,563 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:55:28,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:55:28,564 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:28,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:55:28,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:55:28,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:55:28,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:28,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:55:28,565 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:55:28,565 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:55:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:28,566 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:55:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:55:28,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:28,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:28,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 0 states. [2022-02-20 16:55:28,566 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 0 states. [2022-02-20 16:55:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:28,566 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:55:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:55:28,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:28,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:28,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:28,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:55:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:55:28,568 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2022-02-20 16:55:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:28,569 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:55:28,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:55:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:55:28,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:28,571 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:55:28,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-02-20 16:55:28,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:55:28,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.