./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:57:22,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:57:22,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:57:22,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:57:22,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:57:22,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:57:22,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:57:22,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:57:22,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:57:22,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:57:22,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:57:22,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:57:22,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:57:22,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:57:22,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:57:22,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:57:22,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:57:22,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:57:22,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:57:22,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:57:22,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:57:22,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:57:22,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:57:22,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:57:22,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:57:22,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:57:22,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:57:22,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:57:22,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:57:22,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:57:22,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:57:22,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:57:22,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:57:22,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:57:22,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:57:22,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:57:22,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:57:22,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:57:22,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:57:22,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:57:22,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:57:22,721 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:57:22,735 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:57:22,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:57:22,736 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:57:22,736 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:57:22,736 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:57:22,737 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:57:22,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:57:22,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:57:22,737 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:57:22,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:57:22,738 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:57:22,743 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:57:22,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:57:22,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:57:22,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:57:22,744 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:57:22,744 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:57:22,744 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:57:22,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:57:22,745 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:57:22,745 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:57:22,745 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:57:22,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:57:22,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:57:22,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:57:22,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:57:22,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:57:22,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:57:22,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:57:22,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:57:22,746 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2022-02-20 23:57:22,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:57:22,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:57:22,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:57:22,974 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:57:22,975 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:57:22,977 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-02-20 23:57:23,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2a13ede6/3ba4d7cca4574e638cc3e99f3e5e9d6c/FLAGbcb989621 [2022-02-20 23:57:23,446 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:57:23,446 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-02-20 23:57:23,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2a13ede6/3ba4d7cca4574e638cc3e99f3e5e9d6c/FLAGbcb989621 [2022-02-20 23:57:23,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2a13ede6/3ba4d7cca4574e638cc3e99f3e5e9d6c [2022-02-20 23:57:23,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:57:23,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:57:23,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:57:23,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:57:23,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:57:23,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:57:23" (1/1) ... [2022-02-20 23:57:23,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3903e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:23, skipping insertion in model container [2022-02-20 23:57:23,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:57:23" (1/1) ... [2022-02-20 23:57:23,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:57:23,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:57:24,085 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_insert_unequal.i[25148,25161] [2022-02-20 23:57:24,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:57:24,096 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:57:24,133 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_insert_unequal.i[25148,25161] [2022-02-20 23:57:24,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:57:24,152 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:57:24,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:24 WrapperNode [2022-02-20 23:57:24,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:57:24,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:57:24,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:57:24,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:57:24,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:24" (1/1) ... [2022-02-20 23:57:24,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:24" (1/1) ... [2022-02-20 23:57:24,204 INFO L137 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 191 [2022-02-20 23:57:24,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:57:24,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:57:24,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:57:24,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:57:24,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:24" (1/1) ... [2022-02-20 23:57:24,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:24" (1/1) ... [2022-02-20 23:57:24,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:24" (1/1) ... [2022-02-20 23:57:24,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:24" (1/1) ... [2022-02-20 23:57:24,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:24" (1/1) ... [2022-02-20 23:57:24,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:24" (1/1) ... [2022-02-20 23:57:24,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:24" (1/1) ... [2022-02-20 23:57:24,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:57:24,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:57:24,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:57:24,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:57:24,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:24" (1/1) ... [2022-02-20 23:57:24,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:57:24,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:24,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:57:24,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:57:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:57:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:57:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 23:57:24,316 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 23:57:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:57:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:57:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:57:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:57:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:57:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:57:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:57:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:57:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:57:24,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:57:24,421 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:57:24,422 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:57:24,961 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:57:24,969 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:57:24,970 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 23:57:24,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:57:24 BoogieIcfgContainer [2022-02-20 23:57:24,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:57:24,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:57:24,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:57:24,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:57:24,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:57:23" (1/3) ... [2022-02-20 23:57:24,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dba8ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:57:24, skipping insertion in model container [2022-02-20 23:57:24,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:24" (2/3) ... [2022-02-20 23:57:24,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dba8ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:57:24, skipping insertion in model container [2022-02-20 23:57:24,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:57:24" (3/3) ... [2022-02-20 23:57:24,984 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2022-02-20 23:57:24,988 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:57:24,988 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 82 error locations. [2022-02-20 23:57:25,024 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:57:25,029 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:57:25,030 INFO L340 AbstractCegarLoop]: Starting to check reachability of 82 error locations. [2022-02-20 23:57:25,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 87 states have (on average 2.160919540229885) internal successors, (188), 169 states have internal predecessors, (188), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:57:25,059 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:25,059 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:57:25,060 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash 897735090, now seen corresponding path program 1 times [2022-02-20 23:57:25,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:25,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727609399] [2022-02-20 23:57:25,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:25,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:25,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {177#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(23, 2); {177#true} is VALID [2022-02-20 23:57:25,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {177#true} is VALID [2022-02-20 23:57:25,259 INFO L272 TraceCheckUtils]: 2: Hoare triple {177#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {177#true} is VALID [2022-02-20 23:57:25,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#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; {179#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:25,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {179#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {179#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:25,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {179#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(1 == #valid[~temp~0#1.base]); {178#false} is VALID [2022-02-20 23:57:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:25,262 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:25,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727609399] [2022-02-20 23:57:25,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727609399] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:25,263 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:25,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:57:25,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52455141] [2022-02-20 23:57:25,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:25,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:57:25,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:25,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:25,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:25,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:57:25,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:25,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:57:25,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:25,300 INFO L87 Difference]: Start difference. First operand has 174 states, 87 states have (on average 2.160919540229885) internal successors, (188), 169 states have internal predecessors, (188), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:25,592 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2022-02-20 23:57:25,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:57:25,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:57:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2022-02-20 23:57:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2022-02-20 23:57:25,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2022-02-20 23:57:25,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:25,770 INFO L225 Difference]: With dead ends: 171 [2022-02-20 23:57:25,771 INFO L226 Difference]: Without dead ends: 168 [2022-02-20 23:57:25,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:25,774 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 10 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:25,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 269 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:57:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-02-20 23:57:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-02-20 23:57:25,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:25,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 168 states, 85 states have (on average 2.0588235294117645) internal successors, (175), 163 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:25,808 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 168 states, 85 states have (on average 2.0588235294117645) internal successors, (175), 163 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:25,809 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 168 states, 85 states have (on average 2.0588235294117645) internal successors, (175), 163 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:25,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:25,816 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2022-02-20 23:57:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2022-02-20 23:57:25,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:25,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:25,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 85 states have (on average 2.0588235294117645) internal successors, (175), 163 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 168 states. [2022-02-20 23:57:25,818 INFO L87 Difference]: Start difference. First operand has 168 states, 85 states have (on average 2.0588235294117645) internal successors, (175), 163 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 168 states. [2022-02-20 23:57:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:25,825 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2022-02-20 23:57:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2022-02-20 23:57:25,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:25,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:25,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:25,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 85 states have (on average 2.0588235294117645) internal successors, (175), 163 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2022-02-20 23:57:25,832 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 6 [2022-02-20 23:57:25,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:25,833 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2022-02-20 23:57:25,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2022-02-20 23:57:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:57:25,833 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:25,834 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:57:25,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:57:25,834 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:25,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:25,835 INFO L85 PathProgramCache]: Analyzing trace with hash 897735091, now seen corresponding path program 1 times [2022-02-20 23:57:25,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:25,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953699486] [2022-02-20 23:57:25,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:25,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:25,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {857#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(23, 2); {857#true} is VALID [2022-02-20 23:57:25,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {857#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {857#true} is VALID [2022-02-20 23:57:25,880 INFO L272 TraceCheckUtils]: 2: Hoare triple {857#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {857#true} is VALID [2022-02-20 23:57:25,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {857#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; {859#(and (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 12)) 0) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 23:57:25,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {859#(and (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 12)) 0) (= |node_create_~temp~0#1.offset| 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {859#(and (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 12)) 0) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 23:57:25,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {859#(and (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 12)) 0) (= |node_create_~temp~0#1.offset| 0))} assume !(4 + ~temp~0#1.offset <= #length[~temp~0#1.base] && 0 <= ~temp~0#1.offset); {858#false} is VALID [2022-02-20 23:57:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:25,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:25,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953699486] [2022-02-20 23:57:25,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953699486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:25,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:25,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:57:25,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570228484] [2022-02-20 23:57:25,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:25,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:57:25,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:25,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:25,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:25,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:57:25,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:25,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:57:25,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:25,891 INFO L87 Difference]: Start difference. First operand 168 states and 181 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:26,116 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2022-02-20 23:57:26,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:57:26,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:57:26,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:26,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2022-02-20 23:57:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2022-02-20 23:57:26,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 181 transitions. [2022-02-20 23:57:26,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:26,254 INFO L225 Difference]: With dead ends: 165 [2022-02-20 23:57:26,254 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 23:57:26,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:26,255 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 5 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:26,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 271 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:57:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 23:57:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-02-20 23:57:26,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:26,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 165 states, 85 states have (on average 2.023529411764706) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:26,261 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 165 states, 85 states have (on average 2.023529411764706) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:26,262 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 165 states, 85 states have (on average 2.023529411764706) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:26,266 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2022-02-20 23:57:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2022-02-20 23:57:26,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:26,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:26,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 85 states have (on average 2.023529411764706) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 165 states. [2022-02-20 23:57:26,268 INFO L87 Difference]: Start difference. First operand has 165 states, 85 states have (on average 2.023529411764706) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 165 states. [2022-02-20 23:57:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:26,272 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2022-02-20 23:57:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2022-02-20 23:57:26,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:26,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:26,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:26,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 85 states have (on average 2.023529411764706) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2022-02-20 23:57:26,278 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 6 [2022-02-20 23:57:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:26,278 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2022-02-20 23:57:26,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2022-02-20 23:57:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:57:26,279 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:26,279 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:26,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:57:26,280 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:26,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:26,280 INFO L85 PathProgramCache]: Analyzing trace with hash 165946077, now seen corresponding path program 1 times [2022-02-20 23:57:26,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:26,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121670234] [2022-02-20 23:57:26,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:26,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:26,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:57:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:26,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {1533#(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; {1522#true} is VALID [2022-02-20 23:57:26,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {1522#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1522#true} is VALID [2022-02-20 23:57:26,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {1522#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {1522#true} is VALID [2022-02-20 23:57:26,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {1522#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {1522#true} is VALID [2022-02-20 23:57:26,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {1522#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {1522#true} is VALID [2022-02-20 23:57:26,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {1522#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1522#true} is VALID [2022-02-20 23:57:26,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {1522#true} assume true; {1522#true} is VALID [2022-02-20 23:57:26,394 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1522#true} {1524#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} #274#return; {1524#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:26,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {1522#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(23, 2); {1522#true} is VALID [2022-02-20 23:57:26,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {1522#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {1524#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:26,396 INFO L272 TraceCheckUtils]: 2: Hoare triple {1524#(= (+ (- 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); {1533#(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 23:57:26,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {1533#(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; {1522#true} is VALID [2022-02-20 23:57:26,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {1522#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1522#true} is VALID [2022-02-20 23:57:26,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {1522#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {1522#true} is VALID [2022-02-20 23:57:26,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {1522#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {1522#true} is VALID [2022-02-20 23:57:26,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {1522#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {1522#true} is VALID [2022-02-20 23:57:26,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {1522#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1522#true} is VALID [2022-02-20 23:57:26,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {1522#true} assume true; {1522#true} is VALID [2022-02-20 23:57:26,398 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1522#true} {1524#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} #274#return; {1524#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:26,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {1524#(= (+ (- 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; {1524#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:26,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {1524#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} assume !(dll_circular_create_~len#1 > 1); {1523#false} is VALID [2022-02-20 23:57:26,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {1523#false} assume !(1 == #valid[dll_circular_create_~last~0#1.base]); {1523#false} is VALID [2022-02-20 23:57:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:26,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:26,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121670234] [2022-02-20 23:57:26,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121670234] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:26,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:26,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:57:26,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514191691] [2022-02-20 23:57:26,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:26,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2022-02-20 23:57:26,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:26,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:57:26,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:26,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:57:26,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:26,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:57:26,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:57:26,415 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:57:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:26,732 INFO L93 Difference]: Finished difference Result 176 states and 191 transitions. [2022-02-20 23:57:26,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:57:26,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2022-02-20 23:57:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:57:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-02-20 23:57:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:57:26,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-02-20 23:57:26,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-02-20 23:57:26,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:26,880 INFO L225 Difference]: With dead ends: 176 [2022-02-20 23:57:26,880 INFO L226 Difference]: Without dead ends: 176 [2022-02-20 23:57:26,880 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 23:57:26,881 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 10 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:26,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 406 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:57:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-02-20 23:57:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2022-02-20 23:57:26,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:26,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 166 states, 86 states have (on average 2.011627906976744) internal successors, (173), 161 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:26,887 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 166 states, 86 states have (on average 2.011627906976744) internal successors, (173), 161 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:26,887 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 166 states, 86 states have (on average 2.011627906976744) internal successors, (173), 161 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:26,891 INFO L93 Difference]: Finished difference Result 176 states and 191 transitions. [2022-02-20 23:57:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2022-02-20 23:57:26,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:26,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:26,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 86 states have (on average 2.011627906976744) internal successors, (173), 161 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 176 states. [2022-02-20 23:57:26,893 INFO L87 Difference]: Start difference. First operand has 166 states, 86 states have (on average 2.011627906976744) internal successors, (173), 161 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 176 states. [2022-02-20 23:57:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:26,897 INFO L93 Difference]: Finished difference Result 176 states and 191 transitions. [2022-02-20 23:57:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2022-02-20 23:57:26,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:26,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:26,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:26,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 86 states have (on average 2.011627906976744) internal successors, (173), 161 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2022-02-20 23:57:26,902 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 14 [2022-02-20 23:57:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:26,902 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2022-02-20 23:57:26,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:57:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2022-02-20 23:57:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:57:26,903 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:26,903 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:26,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:57:26,904 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:26,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:26,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1886331456, now seen corresponding path program 1 times [2022-02-20 23:57:26,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:26,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949486068] [2022-02-20 23:57:26,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:26,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:26,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:57:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:27,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {2250#(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; {2230#true} is VALID [2022-02-20 23:57:27,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {2230#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2230#true} is VALID [2022-02-20 23:57:27,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {2230#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {2230#true} is VALID [2022-02-20 23:57:27,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {2230#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {2230#true} is VALID [2022-02-20 23:57:27,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {2230#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {2230#true} is VALID [2022-02-20 23:57:27,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {2230#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2230#true} is VALID [2022-02-20 23:57:27,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-02-20 23:57:27,004 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2230#true} {2230#true} #274#return; {2230#true} is VALID [2022-02-20 23:57:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 23:57:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:27,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {2250#(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; {2230#true} is VALID [2022-02-20 23:57:27,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {2230#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2230#true} is VALID [2022-02-20 23:57:27,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {2230#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {2251#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:27,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {2251#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {2251#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:27,062 INFO L290 TraceCheckUtils]: 4: Hoare triple {2251#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {2251#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:27,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {2251#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2252#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:27,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {2252#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {2252#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:27,063 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2252#(= (select |#valid| |node_create_#res#1.base|) 1)} {2230#true} #276#return; {2248#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:57:27,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {2230#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(23, 2); {2230#true} is VALID [2022-02-20 23:57:27,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {2230#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {2230#true} is VALID [2022-02-20 23:57:27,065 INFO L272 TraceCheckUtils]: 2: Hoare triple {2230#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {2250#(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 23:57:27,065 INFO L290 TraceCheckUtils]: 3: Hoare triple {2250#(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; {2230#true} is VALID [2022-02-20 23:57:27,065 INFO L290 TraceCheckUtils]: 4: Hoare triple {2230#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2230#true} is VALID [2022-02-20 23:57:27,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {2230#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {2230#true} is VALID [2022-02-20 23:57:27,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {2230#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {2230#true} is VALID [2022-02-20 23:57:27,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {2230#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {2230#true} is VALID [2022-02-20 23:57:27,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2230#true} is VALID [2022-02-20 23:57:27,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-02-20 23:57:27,066 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2230#true} {2230#true} #274#return; {2230#true} is VALID [2022-02-20 23:57:27,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {2230#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; {2230#true} is VALID [2022-02-20 23:57:27,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {2230#true} assume !!(dll_circular_create_~len#1 > 1); {2230#true} is VALID [2022-02-20 23:57:27,067 INFO L272 TraceCheckUtils]: 13: Hoare triple {2230#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {2250#(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 23:57:27,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {2250#(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; {2230#true} is VALID [2022-02-20 23:57:27,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {2230#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2230#true} is VALID [2022-02-20 23:57:27,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {2230#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {2251#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:27,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {2251#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {2251#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:27,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {2251#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {2251#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:27,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {2251#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2252#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:27,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {2252#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {2252#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:27,070 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2252#(= (select |#valid| |node_create_#res#1.base|) 1)} {2230#true} #276#return; {2248#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:57:27,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {2248#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 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; {2249#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:57:27,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {2249#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)} assume !(1 == #valid[dll_circular_create_~new_head~0#1.base]); {2231#false} is VALID [2022-02-20 23:57:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:57:27,072 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:27,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949486068] [2022-02-20 23:57:27,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949486068] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:27,072 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:27,072 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:57:27,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836651350] [2022-02-20 23:57:27,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:27,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 23:57:27,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:27,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:27,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:27,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:57:27,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:27,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:57:27,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:57:27,104 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:27,904 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2022-02-20 23:57:27,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:57:27,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 23:57:27,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2022-02-20 23:57:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2022-02-20 23:57:27,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 181 transitions. [2022-02-20 23:57:28,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:28,043 INFO L225 Difference]: With dead ends: 166 [2022-02-20 23:57:28,043 INFO L226 Difference]: Without dead ends: 166 [2022-02-20 23:57:28,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:57:28,044 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 21 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:28,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 567 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:57:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-02-20 23:57:28,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2022-02-20 23:57:28,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:28,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 165 states, 86 states have (on average 2.0) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:28,051 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 165 states, 86 states have (on average 2.0) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:28,051 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 165 states, 86 states have (on average 2.0) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:28,055 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2022-02-20 23:57:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2022-02-20 23:57:28,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:28,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:28,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 86 states have (on average 2.0) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 166 states. [2022-02-20 23:57:28,057 INFO L87 Difference]: Start difference. First operand has 165 states, 86 states have (on average 2.0) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 166 states. [2022-02-20 23:57:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:28,061 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2022-02-20 23:57:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2022-02-20 23:57:28,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:28,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:28,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:28,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:28,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 86 states have (on average 2.0) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2022-02-20 23:57:28,065 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 24 [2022-02-20 23:57:28,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:28,066 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2022-02-20 23:57:28,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2022-02-20 23:57:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:57:28,066 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:28,067 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:28,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:57:28,067 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:28,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1886331457, now seen corresponding path program 1 times [2022-02-20 23:57:28,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:28,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618933267] [2022-02-20 23:57:28,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:28,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:28,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:57:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:28,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {2940#(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; {2920#true} is VALID [2022-02-20 23:57:28,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {2920#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2920#true} is VALID [2022-02-20 23:57:28,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {2920#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {2920#true} is VALID [2022-02-20 23:57:28,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {2920#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {2920#true} is VALID [2022-02-20 23:57:28,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {2920#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {2920#true} is VALID [2022-02-20 23:57:28,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {2920#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2920#true} is VALID [2022-02-20 23:57:28,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {2920#true} assume true; {2920#true} is VALID [2022-02-20 23:57:28,172 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2920#true} {2920#true} #274#return; {2920#true} is VALID [2022-02-20 23:57:28,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 23:57:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:28,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {2940#(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; {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:28,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:28,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:28,233 INFO L290 TraceCheckUtils]: 3: Hoare triple {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:28,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:28,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2942#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} is VALID [2022-02-20 23:57:28,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {2942#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} assume true; {2942#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} is VALID [2022-02-20 23:57:28,236 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2942#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} {2920#true} #276#return; {2938#(and (= (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0))} is VALID [2022-02-20 23:57:28,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {2920#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(23, 2); {2920#true} is VALID [2022-02-20 23:57:28,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {2920#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {2920#true} is VALID [2022-02-20 23:57:28,237 INFO L272 TraceCheckUtils]: 2: Hoare triple {2920#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {2940#(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 23:57:28,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {2940#(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; {2920#true} is VALID [2022-02-20 23:57:28,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {2920#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2920#true} is VALID [2022-02-20 23:57:28,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {2920#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {2920#true} is VALID [2022-02-20 23:57:28,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {2920#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {2920#true} is VALID [2022-02-20 23:57:28,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {2920#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {2920#true} is VALID [2022-02-20 23:57:28,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {2920#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2920#true} is VALID [2022-02-20 23:57:28,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {2920#true} assume true; {2920#true} is VALID [2022-02-20 23:57:28,240 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2920#true} {2920#true} #274#return; {2920#true} is VALID [2022-02-20 23:57:28,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {2920#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; {2920#true} is VALID [2022-02-20 23:57:28,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {2920#true} assume !!(dll_circular_create_~len#1 > 1); {2920#true} is VALID [2022-02-20 23:57:28,241 INFO L272 TraceCheckUtils]: 13: Hoare triple {2920#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {2940#(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 23:57:28,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {2940#(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; {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:28,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:28,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:28,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:28,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:28,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {2941#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2942#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} is VALID [2022-02-20 23:57:28,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {2942#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} assume true; {2942#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} is VALID [2022-02-20 23:57:28,246 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2942#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} {2920#true} #276#return; {2938#(and (= (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0))} is VALID [2022-02-20 23:57:28,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {2938#(and (= (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 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; {2939#(and (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:57:28,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {2939#(and (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (- 12)) 0))} assume !(4 + dll_circular_create_~new_head~0#1.offset <= #length[dll_circular_create_~new_head~0#1.base] && 0 <= dll_circular_create_~new_head~0#1.offset); {2921#false} is VALID [2022-02-20 23:57:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:57:28,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:28,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618933267] [2022-02-20 23:57:28,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618933267] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:28,251 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:28,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:57:28,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043216432] [2022-02-20 23:57:28,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:28,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 23:57:28,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:28,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:28,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:28,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:57:28,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:28,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:57:28,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:57:28,273 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:29,222 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:57:29,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:57:29,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 23:57:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2022-02-20 23:57:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2022-02-20 23:57:29,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 180 transitions. [2022-02-20 23:57:29,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:29,342 INFO L225 Difference]: With dead ends: 165 [2022-02-20 23:57:29,342 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 23:57:29,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:57:29,351 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 19 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:29,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 591 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:57:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 23:57:29,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2022-02-20 23:57:29,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:29,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 164 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 159 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:29,356 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 164 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 159 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:29,357 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 164 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 159 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:29,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:29,360 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:57:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2022-02-20 23:57:29,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:29,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:29,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 159 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 165 states. [2022-02-20 23:57:29,361 INFO L87 Difference]: Start difference. First operand has 164 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 159 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 165 states. [2022-02-20 23:57:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:29,364 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:57:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2022-02-20 23:57:29,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:29,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:29,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:29,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 159 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2022-02-20 23:57:29,369 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 24 [2022-02-20 23:57:29,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:29,369 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2022-02-20 23:57:29,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2022-02-20 23:57:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:57:29,370 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:29,370 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:29,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:57:29,370 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:29,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:29,371 INFO L85 PathProgramCache]: Analyzing trace with hash 288330017, now seen corresponding path program 1 times [2022-02-20 23:57:29,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:29,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601951820] [2022-02-20 23:57:29,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:29,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:29,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:57:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:29,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {3626#(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; {3606#true} is VALID [2022-02-20 23:57:29,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {3606#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3606#true} is VALID [2022-02-20 23:57:29,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {3606#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:29,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:29,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:29,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3628#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:29,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {3628#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {3628#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:29,453 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3628#(= (select |#valid| |node_create_#res#1.base|) 1)} {3606#true} #274#return; {3616#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:57:29,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 23:57:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:29,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {3626#(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; {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:29,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:29,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:29,501 INFO L290 TraceCheckUtils]: 3: Hoare triple {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:29,502 INFO L290 TraceCheckUtils]: 4: Hoare triple {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:29,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3630#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:29,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {3630#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {3630#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:29,504 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3630#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} #276#return; {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:29,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {3606#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(23, 2); {3606#true} is VALID [2022-02-20 23:57:29,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {3606#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {3606#true} is VALID [2022-02-20 23:57:29,505 INFO L272 TraceCheckUtils]: 2: Hoare triple {3606#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {3626#(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 23:57:29,505 INFO L290 TraceCheckUtils]: 3: Hoare triple {3626#(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; {3606#true} is VALID [2022-02-20 23:57:29,506 INFO L290 TraceCheckUtils]: 4: Hoare triple {3606#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3606#true} is VALID [2022-02-20 23:57:29,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {3606#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:29,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:29,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:29,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3628#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:29,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {3628#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {3628#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:29,509 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3628#(= (select |#valid| |node_create_#res#1.base|) 1)} {3606#true} #274#return; {3616#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:57:29,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {3616#(= (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; {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:29,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} assume !!(dll_circular_create_~len#1 > 1); {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:29,510 INFO L272 TraceCheckUtils]: 13: Hoare triple {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {3626#(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 23:57:29,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {3626#(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; {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:29,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:29,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:29,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:29,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:29,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {3629#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3630#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:29,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {3630#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {3630#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:29,516 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3630#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} #276#return; {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:29,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 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; {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:29,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} SUMMARY for 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); srcloc: L590 {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:29,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:29,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} assume !(1 == #valid[dll_circular_create_~head~0#1.base]); {3607#false} is VALID [2022-02-20 23:57:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:57:29,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:29,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601951820] [2022-02-20 23:57:29,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601951820] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:29,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107308220] [2022-02-20 23:57:29,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:29,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:29,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:29,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:57:29,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:57:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:29,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:57:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:29,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:29,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:57:30,002 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:57:30,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 23:57:30,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {3606#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(23, 2); {3606#true} is VALID [2022-02-20 23:57:30,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {3606#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {3606#true} is VALID [2022-02-20 23:57:30,024 INFO L272 TraceCheckUtils]: 2: Hoare triple {3606#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {3606#true} is VALID [2022-02-20 23:57:30,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {3606#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; {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:30,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:30,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:30,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:30,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:30,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {3627#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3628#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:30,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {3628#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {3628#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:30,028 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3628#(= (select |#valid| |node_create_#res#1.base|) 1)} {3606#true} #274#return; {3616#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:57:30,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {3616#(= (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; {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:30,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} assume !!(dll_circular_create_~len#1 > 1); {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:30,029 INFO L272 TraceCheckUtils]: 13: Hoare triple {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {3673#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:57:30,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {3673#(= |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; {3677#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:30,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {3677#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3677#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:30,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {3677#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {3677#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:30,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {3677#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {3677#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:30,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {3677#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {3677#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:30,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {3677#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3677#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:30,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {3677#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume true; {3677#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:30,039 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3677#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} #276#return; {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:30,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 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; {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:30,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} SUMMARY for 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); srcloc: L590 {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:30,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:30,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {3617#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} assume !(1 == #valid[dll_circular_create_~head~0#1.base]); {3607#false} is VALID [2022-02-20 23:57:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:30,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:57:30,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107308220] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:30,156 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:57:30,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-02-20 23:57:30,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909154494] [2022-02-20 23:57:30,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:57:30,157 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-02-20 23:57:30,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:30,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:30,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:30,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:57:30,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:30,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:57:30,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:57:30,189 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:31,144 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2022-02-20 23:57:31,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:57:31,144 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-02-20 23:57:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2022-02-20 23:57:31,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2022-02-20 23:57:31,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 206 transitions. [2022-02-20 23:57:31,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:31,307 INFO L225 Difference]: With dead ends: 189 [2022-02-20 23:57:31,307 INFO L226 Difference]: Without dead ends: 189 [2022-02-20 23:57:31,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:57:31,308 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 151 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:31,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 452 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 468 Invalid, 0 Unknown, 4 Unchecked, 0.4s Time] [2022-02-20 23:57:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-02-20 23:57:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2022-02-20 23:57:31,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:31,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 169 states, 90 states have (on average 1.9666666666666666) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:31,312 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 169 states, 90 states have (on average 1.9666666666666666) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:31,312 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 169 states, 90 states have (on average 1.9666666666666666) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:31,316 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2022-02-20 23:57:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2022-02-20 23:57:31,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:31,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:31,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 90 states have (on average 1.9666666666666666) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 189 states. [2022-02-20 23:57:31,317 INFO L87 Difference]: Start difference. First operand has 169 states, 90 states have (on average 1.9666666666666666) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 189 states. [2022-02-20 23:57:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:31,321 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2022-02-20 23:57:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2022-02-20 23:57:31,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:31,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:31,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:31,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 90 states have (on average 1.9666666666666666) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 185 transitions. [2022-02-20 23:57:31,325 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 185 transitions. Word has length 26 [2022-02-20 23:57:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:31,326 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 185 transitions. [2022-02-20 23:57:31,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:31,326 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 185 transitions. [2022-02-20 23:57:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:57:31,326 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:31,327 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:31,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:57:31,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 23:57:31,540 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:31,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:31,540 INFO L85 PathProgramCache]: Analyzing trace with hash 288330018, now seen corresponding path program 1 times [2022-02-20 23:57:31,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:31,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018483068] [2022-02-20 23:57:31,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:31,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:31,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:57:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:31,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {4488#(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; {4489#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:31,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {4489#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4489#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:31,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {4489#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {4490#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:31,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {4490#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {4490#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:31,727 INFO L290 TraceCheckUtils]: 4: Hoare triple {4490#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {4491#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (<= 12 (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:31,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {4491#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (<= 12 (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4492#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (<= 12 (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:57:31,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {4492#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (<= 12 (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {4492#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (<= 12 (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:57:31,729 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4492#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (<= 12 (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} {4467#true} #274#return; {4477#(and (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1))} is VALID [2022-02-20 23:57:31,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 23:57:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:31,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {4488#(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; {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:31,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:31,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:31,794 INFO L290 TraceCheckUtils]: 3: Hoare triple {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:31,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:31,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4494#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:57:31,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {4494#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} assume true; {4494#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:57:31,798 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4494#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} {4478#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))} #276#return; {4487#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 23:57:31,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {4467#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(23, 2); {4467#true} is VALID [2022-02-20 23:57:31,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {4467#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {4467#true} is VALID [2022-02-20 23:57:31,802 INFO L272 TraceCheckUtils]: 2: Hoare triple {4467#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {4488#(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 23:57:31,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {4488#(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; {4489#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:31,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {4489#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4489#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:31,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {4489#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {4490#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:31,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {4490#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {4490#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:31,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {4490#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {4491#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (<= 12 (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:31,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {4491#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (<= 12 (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4492#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (<= 12 (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:57:31,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {4492#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (<= 12 (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {4492#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (<= 12 (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:57:31,807 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4492#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (<= 12 (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} {4467#true} #274#return; {4477#(and (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1))} is VALID [2022-02-20 23:57:31,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {4477#(and (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|)) (= (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; {4478#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))} is VALID [2022-02-20 23:57:31,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {4478#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))} assume !!(dll_circular_create_~len#1 > 1); {4478#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))} is VALID [2022-02-20 23:57:31,809 INFO L272 TraceCheckUtils]: 13: Hoare triple {4478#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {4488#(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 23:57:31,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {4488#(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; {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:31,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:31,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:31,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:31,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:31,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {4493#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4494#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:57:31,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {4494#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} assume true; {4494#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:57:31,815 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4494#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} {4478#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))} #276#return; {4487#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 23:57:31,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {4487#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |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; {4487#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 23:57:31,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {4487#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} SUMMARY for 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); srcloc: L590 {4487#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 23:57:31,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {4487#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {4487#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 23:57:31,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {4487#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} assume !(4 + (4 + dll_circular_create_~head~0#1.offset) <= #length[dll_circular_create_~head~0#1.base] && 0 <= 4 + dll_circular_create_~head~0#1.offset); {4468#false} is VALID [2022-02-20 23:57:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:57:31,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:31,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018483068] [2022-02-20 23:57:31,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018483068] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:31,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004798581] [2022-02-20 23:57:31,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:31,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:31,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:31,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:57:31,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:57:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:31,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:57:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:31,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:31,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:57:32,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:57:32,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 23:57:32,523 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:57:32,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:57:32,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {4467#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(23, 2); {4467#true} is VALID [2022-02-20 23:57:32,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {4467#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {4467#true} is VALID [2022-02-20 23:57:32,579 INFO L272 TraceCheckUtils]: 2: Hoare triple {4467#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {4467#true} is VALID [2022-02-20 23:57:32,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {4467#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; {4507#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:32,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {4507#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4507#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:32,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {4507#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {4507#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:32,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {4507#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {4507#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:32,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {4507#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {4520#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:32,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {4520#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4524#(and (<= (+ 12 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (<= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:57:32,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {4524#(and (<= (+ 12 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (<= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {4524#(and (<= (+ 12 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (<= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:57:32,585 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4524#(and (<= (+ 12 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (<= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {4467#true} #274#return; {4531#(and (<= 0 |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (<= (+ |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 12) (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:57:32,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {4531#(and (<= 0 |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (<= (+ |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 12) (select |#length| |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; {4535#(and (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:57:32,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {4535#(and (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} assume !!(dll_circular_create_~len#1 > 1); {4535#(and (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:57:32,587 INFO L272 TraceCheckUtils]: 13: Hoare triple {4535#(and (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {4542#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:32,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {4542#(and (= |old(#length)| |#length|) (= |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; {4546#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_493 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |#length|))))} is VALID [2022-02-20 23:57:32,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {4546#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_493 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |#length|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4546#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_493 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |#length|))))} is VALID [2022-02-20 23:57:32,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {4546#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_493 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |#length|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {4546#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_493 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |#length|))))} is VALID [2022-02-20 23:57:32,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {4546#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_493 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |#length|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {4546#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_493 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |#length|))))} is VALID [2022-02-20 23:57:32,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {4546#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_493 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |#length|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {4546#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_493 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |#length|))))} is VALID [2022-02-20 23:57:32,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {4546#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_493 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |#length|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4546#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_493 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |#length|))))} is VALID [2022-02-20 23:57:32,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {4546#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_493 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |#length|))))} assume true; {4546#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_493 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |#length|))))} is VALID [2022-02-20 23:57:32,602 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4546#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_493 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |#length|))))} {4535#(and (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} #276#return; {4568#(and (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:57:32,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {4568#(and (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= 0 |ULTIMATE.start_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~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; {4568#(and (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:57:32,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {4568#(and (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} SUMMARY for 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); srcloc: L590 {4568#(and (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:57:32,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {4568#(and (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {4568#(and (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:57:32,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {4568#(and (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} assume !(4 + (4 + dll_circular_create_~head~0#1.offset) <= #length[dll_circular_create_~head~0#1.base] && 0 <= 4 + dll_circular_create_~head~0#1.offset); {4468#false} is VALID [2022-02-20 23:57:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:32,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:57:32,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004798581] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:32,821 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:57:32,821 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-02-20 23:57:32,821 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390748753] [2022-02-20 23:57:32,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:57:32,822 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-02-20 23:57:32,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:32,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:32,872 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 23:57:32,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 23:57:32,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:32,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 23:57:32,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:57:32,874 INFO L87 Difference]: Start difference. First operand 169 states and 185 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:34,818 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2022-02-20 23:57:34,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:57:34,818 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-02-20 23:57:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2022-02-20 23:57:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2022-02-20 23:57:34,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 187 transitions. [2022-02-20 23:57:34,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:34,943 INFO L225 Difference]: With dead ends: 171 [2022-02-20 23:57:34,943 INFO L226 Difference]: Without dead ends: 171 [2022-02-20 23:57:34,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:57:34,944 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 23 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:34,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 1061 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 963 Invalid, 0 Unknown, 80 Unchecked, 0.7s Time] [2022-02-20 23:57:34,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-20 23:57:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2022-02-20 23:57:34,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:34,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 169 states, 90 states have (on average 1.9555555555555555) internal successors, (176), 163 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:34,947 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 169 states, 90 states have (on average 1.9555555555555555) internal successors, (176), 163 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:34,947 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 169 states, 90 states have (on average 1.9555555555555555) internal successors, (176), 163 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:34,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:34,951 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2022-02-20 23:57:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 186 transitions. [2022-02-20 23:57:34,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:34,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:34,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 90 states have (on average 1.9555555555555555) internal successors, (176), 163 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 171 states. [2022-02-20 23:57:34,955 INFO L87 Difference]: Start difference. First operand has 169 states, 90 states have (on average 1.9555555555555555) internal successors, (176), 163 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 171 states. [2022-02-20 23:57:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:34,959 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2022-02-20 23:57:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 186 transitions. [2022-02-20 23:57:34,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:34,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:34,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:34,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 90 states have (on average 1.9555555555555555) internal successors, (176), 163 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:34,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 184 transitions. [2022-02-20 23:57:34,963 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 184 transitions. Word has length 26 [2022-02-20 23:57:34,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:34,963 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 184 transitions. [2022-02-20 23:57:34,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:34,964 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 184 transitions. [2022-02-20 23:57:34,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:57:34,964 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:34,964 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:34,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:57:35,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-02-20 23:57:35,198 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:35,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2087573769, now seen corresponding path program 1 times [2022-02-20 23:57:35,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:35,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929104830] [2022-02-20 23:57:35,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:35,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:35,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:57:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:35,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {5303#(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; {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,278 INFO L290 TraceCheckUtils]: 4: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5305#(not (= |node_create_#res#1.base| 0))} is VALID [2022-02-20 23:57:35,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {5305#(not (= |node_create_#res#1.base| 0))} assume true; {5305#(not (= |node_create_#res#1.base| 0))} is VALID [2022-02-20 23:57:35,288 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5305#(not (= |node_create_#res#1.base| 0))} {5283#true} #274#return; {5293#(not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 0))} is VALID [2022-02-20 23:57:35,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 23:57:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:35,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {5303#(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; {5283#true} is VALID [2022-02-20 23:57:35,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {5283#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5283#true} is VALID [2022-02-20 23:57:35,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {5283#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {5283#true} is VALID [2022-02-20 23:57:35,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {5283#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {5283#true} is VALID [2022-02-20 23:57:35,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {5283#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {5283#true} is VALID [2022-02-20 23:57:35,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {5283#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5283#true} is VALID [2022-02-20 23:57:35,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {5283#true} assume true; {5283#true} is VALID [2022-02-20 23:57:35,307 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5283#true} {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} #276#return; {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {5283#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(23, 2); {5283#true} is VALID [2022-02-20 23:57:35,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {5283#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {5283#true} is VALID [2022-02-20 23:57:35,308 INFO L272 TraceCheckUtils]: 2: Hoare triple {5283#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {5303#(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 23:57:35,309 INFO L290 TraceCheckUtils]: 3: Hoare triple {5303#(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; {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5305#(not (= |node_create_#res#1.base| 0))} is VALID [2022-02-20 23:57:35,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {5305#(not (= |node_create_#res#1.base| 0))} assume true; {5305#(not (= |node_create_#res#1.base| 0))} is VALID [2022-02-20 23:57:35,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5305#(not (= |node_create_#res#1.base| 0))} {5283#true} #274#return; {5293#(not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 0))} is VALID [2022-02-20 23:57:35,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {5293#(not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 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; {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} assume !!(dll_circular_create_~len#1 > 1); {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,314 INFO L272 TraceCheckUtils]: 13: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {5303#(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 23:57:35,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {5303#(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; {5283#true} is VALID [2022-02-20 23:57:35,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {5283#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5283#true} is VALID [2022-02-20 23:57:35,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {5283#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {5283#true} is VALID [2022-02-20 23:57:35,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {5283#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {5283#true} is VALID [2022-02-20 23:57:35,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {5283#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {5283#true} is VALID [2022-02-20 23:57:35,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {5283#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5283#true} is VALID [2022-02-20 23:57:35,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {5283#true} assume true; {5283#true} is VALID [2022-02-20 23:57:35,316 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5283#true} {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} #276#return; {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 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; {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} SUMMARY for 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); srcloc: L590 {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} assume !(dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0); {5284#false} is VALID [2022-02-20 23:57:35,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {5284#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 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {5284#false} is VALID [2022-02-20 23:57:35,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {5284#false} assume !(dll_circular_create_~len#1 > 1); {5284#false} is VALID [2022-02-20 23:57:35,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {5284#false} assume !(1 == #valid[dll_circular_create_~last~0#1.base]); {5284#false} is VALID [2022-02-20 23:57:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:57:35,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:35,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929104830] [2022-02-20 23:57:35,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929104830] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:35,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008709125] [2022-02-20 23:57:35,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:35,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:35,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:35,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:57:35,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:57:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:35,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:57:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:35,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:35,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {5283#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(23, 2); {5283#true} is VALID [2022-02-20 23:57:35,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {5283#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {5283#true} is VALID [2022-02-20 23:57:35,508 INFO L272 TraceCheckUtils]: 2: Hoare triple {5283#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {5283#true} is VALID [2022-02-20 23:57:35,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {5283#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; {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5305#(not (= |node_create_#res#1.base| 0))} is VALID [2022-02-20 23:57:35,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {5305#(not (= |node_create_#res#1.base| 0))} assume true; {5305#(not (= |node_create_#res#1.base| 0))} is VALID [2022-02-20 23:57:35,512 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5305#(not (= |node_create_#res#1.base| 0))} {5283#true} #274#return; {5293#(not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 0))} is VALID [2022-02-20 23:57:35,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {5293#(not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 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; {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} assume !!(dll_circular_create_~len#1 > 1); {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,513 INFO L272 TraceCheckUtils]: 13: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {5283#true} is VALID [2022-02-20 23:57:35,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {5283#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; {5283#true} is VALID [2022-02-20 23:57:35,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {5283#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5283#true} is VALID [2022-02-20 23:57:35,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {5283#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {5283#true} is VALID [2022-02-20 23:57:35,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {5283#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {5283#true} is VALID [2022-02-20 23:57:35,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {5283#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {5283#true} is VALID [2022-02-20 23:57:35,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {5283#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5283#true} is VALID [2022-02-20 23:57:35,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {5283#true} assume true; {5283#true} is VALID [2022-02-20 23:57:35,515 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5283#true} {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} #276#return; {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 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; {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} SUMMARY for 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); srcloc: L590 {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} assume !(dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0); {5284#false} is VALID [2022-02-20 23:57:35,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {5284#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 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {5284#false} is VALID [2022-02-20 23:57:35,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {5284#false} assume !(dll_circular_create_~len#1 > 1); {5284#false} is VALID [2022-02-20 23:57:35,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {5284#false} assume !(1 == #valid[dll_circular_create_~last~0#1.base]); {5284#false} is VALID [2022-02-20 23:57:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:57:35,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:57:35,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {5284#false} assume !(1 == #valid[dll_circular_create_~last~0#1.base]); {5284#false} is VALID [2022-02-20 23:57:35,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {5284#false} assume !(dll_circular_create_~len#1 > 1); {5284#false} is VALID [2022-02-20 23:57:35,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {5284#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 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {5284#false} is VALID [2022-02-20 23:57:35,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} assume !(dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0); {5284#false} is VALID [2022-02-20 23:57:35,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} SUMMARY for 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); srcloc: L590 {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 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; {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,604 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5283#true} {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} #276#return; {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {5283#true} assume true; {5283#true} is VALID [2022-02-20 23:57:35,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {5283#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5283#true} is VALID [2022-02-20 23:57:35,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {5283#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {5283#true} is VALID [2022-02-20 23:57:35,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {5283#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {5283#true} is VALID [2022-02-20 23:57:35,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {5283#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {5283#true} is VALID [2022-02-20 23:57:35,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {5283#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5283#true} is VALID [2022-02-20 23:57:35,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {5283#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; {5283#true} is VALID [2022-02-20 23:57:35,605 INFO L272 TraceCheckUtils]: 13: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {5283#true} is VALID [2022-02-20 23:57:35,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} assume !!(dll_circular_create_~len#1 > 1); {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {5293#(not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 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; {5294#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:35,608 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5305#(not (= |node_create_#res#1.base| 0))} {5283#true} #274#return; {5293#(not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 0))} is VALID [2022-02-20 23:57:35,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {5305#(not (= |node_create_#res#1.base| 0))} assume true; {5305#(not (= |node_create_#res#1.base| 0))} is VALID [2022-02-20 23:57:35,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5305#(not (= |node_create_#res#1.base| 0))} is VALID [2022-02-20 23:57:35,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {5304#(not (= |node_create_~temp~0#1.base| 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {5283#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; {5304#(not (= |node_create_~temp~0#1.base| 0))} is VALID [2022-02-20 23:57:35,611 INFO L272 TraceCheckUtils]: 2: Hoare triple {5283#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {5283#true} is VALID [2022-02-20 23:57:35,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {5283#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {5283#true} is VALID [2022-02-20 23:57:35,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {5283#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(23, 2); {5283#true} is VALID [2022-02-20 23:57:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:57:35,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008709125] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:57:35,611 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:57:35,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-02-20 23:57:35,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384448348] [2022-02-20 23:57:35,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:57:35,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-02-20 23:57:35,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:35,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:35,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:35,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:57:35,636 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:35,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:57:35,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:57:35,637 INFO L87 Difference]: Start difference. First operand 169 states and 184 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:36,175 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2022-02-20 23:57:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:57:36,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-02-20 23:57:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2022-02-20 23:57:36,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2022-02-20 23:57:36,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 185 transitions. [2022-02-20 23:57:36,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:36,297 INFO L225 Difference]: With dead ends: 170 [2022-02-20 23:57:36,297 INFO L226 Difference]: Without dead ends: 170 [2022-02-20 23:57:36,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:57:36,297 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 4 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:36,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 877 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:57:36,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-02-20 23:57:36,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2022-02-20 23:57:36,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:36,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 169 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:36,301 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 169 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:36,301 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 169 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:36,304 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2022-02-20 23:57:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2022-02-20 23:57:36,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:36,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:36,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 170 states. [2022-02-20 23:57:36,305 INFO L87 Difference]: Start difference. First operand has 169 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 170 states. [2022-02-20 23:57:36,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:36,308 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2022-02-20 23:57:36,308 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2022-02-20 23:57:36,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:36,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:36,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:36,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2022-02-20 23:57:36,312 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 28 [2022-02-20 23:57:36,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:36,312 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2022-02-20 23:57:36,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:36,312 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2022-02-20 23:57:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:57:36,313 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:36,313 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:36,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:57:36,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:36,528 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:36,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash -295058062, now seen corresponding path program 1 times [2022-02-20 23:57:36,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:36,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912002235] [2022-02-20 23:57:36,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:36,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:36,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:57:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:36,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {6172#(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; {6151#true} is VALID [2022-02-20 23:57:36,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {6151#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6151#true} is VALID [2022-02-20 23:57:36,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {6151#true} is VALID [2022-02-20 23:57:36,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {6151#true} is VALID [2022-02-20 23:57:36,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {6151#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {6151#true} is VALID [2022-02-20 23:57:36,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {6151#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6151#true} is VALID [2022-02-20 23:57:36,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {6151#true} assume true; {6151#true} is VALID [2022-02-20 23:57:36,592 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6151#true} {6151#true} #274#return; {6151#true} is VALID [2022-02-20 23:57:36,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 23:57:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:36,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {6172#(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; {6151#true} is VALID [2022-02-20 23:57:36,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {6151#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6151#true} is VALID [2022-02-20 23:57:36,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {6151#true} is VALID [2022-02-20 23:57:36,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {6151#true} is VALID [2022-02-20 23:57:36,605 INFO L290 TraceCheckUtils]: 4: Hoare triple {6151#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {6151#true} is VALID [2022-02-20 23:57:36,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {6151#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6151#true} is VALID [2022-02-20 23:57:36,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {6151#true} assume true; {6151#true} is VALID [2022-02-20 23:57:36,606 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6151#true} {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} #276#return; {6170#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:57:36,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {6151#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(23, 2); {6151#true} is VALID [2022-02-20 23:57:36,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {6151#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {6151#true} is VALID [2022-02-20 23:57:36,607 INFO L272 TraceCheckUtils]: 2: Hoare triple {6151#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {6172#(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 23:57:36,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {6172#(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; {6151#true} is VALID [2022-02-20 23:57:36,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {6151#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6151#true} is VALID [2022-02-20 23:57:36,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {6151#true} is VALID [2022-02-20 23:57:36,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {6151#true} is VALID [2022-02-20 23:57:36,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {6151#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {6151#true} is VALID [2022-02-20 23:57:36,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {6151#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6151#true} is VALID [2022-02-20 23:57:36,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {6151#true} assume true; {6151#true} is VALID [2022-02-20 23:57:36,609 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6151#true} {6151#true} #274#return; {6151#true} is VALID [2022-02-20 23:57:36,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {6151#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; {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} is VALID [2022-02-20 23:57:36,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {6161#(= |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); {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} is VALID [2022-02-20 23:57:36,610 INFO L272 TraceCheckUtils]: 13: Hoare triple {6161#(= |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); {6172#(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 23:57:36,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {6172#(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; {6151#true} is VALID [2022-02-20 23:57:36,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {6151#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6151#true} is VALID [2022-02-20 23:57:36,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {6151#true} is VALID [2022-02-20 23:57:36,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {6151#true} is VALID [2022-02-20 23:57:36,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {6151#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {6151#true} is VALID [2022-02-20 23:57:36,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {6151#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6151#true} is VALID [2022-02-20 23:57:36,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {6151#true} assume true; {6151#true} is VALID [2022-02-20 23:57:36,612 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6151#true} {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} #276#return; {6170#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:57:36,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {6170#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~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; {6170#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:57:36,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {6170#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} SUMMARY for 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); srcloc: L590 {6170#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:57:36,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {6170#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {6170#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:57:36,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {6170#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} SUMMARY for 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); srcloc: L592 {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:57:36,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 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; {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:57:36,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} assume !(dll_circular_create_~len#1 > 1); {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:57:36,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} assume !(1 == #valid[dll_circular_create_~last~0#1.base]); {6152#false} is VALID [2022-02-20 23:57:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:57:36,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:36,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912002235] [2022-02-20 23:57:36,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912002235] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:36,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086356805] [2022-02-20 23:57:36,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:36,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:36,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:36,632 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:57:36,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:57:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:36,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:57:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:36,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:36,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {6151#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(23, 2); {6151#true} is VALID [2022-02-20 23:57:36,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {6151#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {6151#true} is VALID [2022-02-20 23:57:36,824 INFO L272 TraceCheckUtils]: 2: Hoare triple {6151#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {6151#true} is VALID [2022-02-20 23:57:36,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {6151#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; {6151#true} is VALID [2022-02-20 23:57:36,824 INFO L290 TraceCheckUtils]: 4: Hoare triple {6151#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6151#true} is VALID [2022-02-20 23:57:36,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {6151#true} is VALID [2022-02-20 23:57:36,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {6151#true} is VALID [2022-02-20 23:57:36,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {6151#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {6151#true} is VALID [2022-02-20 23:57:36,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {6151#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6151#true} is VALID [2022-02-20 23:57:36,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {6151#true} assume true; {6151#true} is VALID [2022-02-20 23:57:36,825 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6151#true} {6151#true} #274#return; {6151#true} is VALID [2022-02-20 23:57:36,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {6151#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; {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} is VALID [2022-02-20 23:57:36,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {6161#(= |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); {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} is VALID [2022-02-20 23:57:36,826 INFO L272 TraceCheckUtils]: 13: Hoare triple {6161#(= |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); {6151#true} is VALID [2022-02-20 23:57:36,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {6151#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; {6151#true} is VALID [2022-02-20 23:57:36,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {6151#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6151#true} is VALID [2022-02-20 23:57:36,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {6151#true} is VALID [2022-02-20 23:57:36,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {6151#true} is VALID [2022-02-20 23:57:36,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {6151#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {6151#true} is VALID [2022-02-20 23:57:36,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {6151#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6151#true} is VALID [2022-02-20 23:57:36,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {6151#true} assume true; {6151#true} is VALID [2022-02-20 23:57:36,827 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6151#true} {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} #276#return; {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} is VALID [2022-02-20 23:57:36,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~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; {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} is VALID [2022-02-20 23:57:36,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} SUMMARY for 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); srcloc: L590 {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} is VALID [2022-02-20 23:57:36,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} is VALID [2022-02-20 23:57:36,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} SUMMARY for 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); srcloc: L592 {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:57:36,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 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; {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:57:36,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} assume !(dll_circular_create_~len#1 > 1); {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:57:36,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} assume !(1 == #valid[dll_circular_create_~last~0#1.base]); {6152#false} is VALID [2022-02-20 23:57:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:57:36,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:57:36,854 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:57:36,854 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 11 [2022-02-20 23:57:36,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} assume !(1 == #valid[dll_circular_create_~last~0#1.base]); {6152#false} is VALID [2022-02-20 23:57:36,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} assume !(dll_circular_create_~len#1 > 1); {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:57:36,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 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; {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:57:36,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} SUMMARY for 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); srcloc: L592 {6171#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:57:36,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} is VALID [2022-02-20 23:57:36,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} SUMMARY for 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); srcloc: L590 {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} is VALID [2022-02-20 23:57:36,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~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; {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} is VALID [2022-02-20 23:57:36,935 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6151#true} {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} #276#return; {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} is VALID [2022-02-20 23:57:36,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {6151#true} assume true; {6151#true} is VALID [2022-02-20 23:57:36,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {6151#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6151#true} is VALID [2022-02-20 23:57:36,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {6151#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {6151#true} is VALID [2022-02-20 23:57:36,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {6151#true} is VALID [2022-02-20 23:57:36,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {6151#true} is VALID [2022-02-20 23:57:36,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {6151#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6151#true} is VALID [2022-02-20 23:57:36,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {6151#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; {6151#true} is VALID [2022-02-20 23:57:36,940 INFO L272 TraceCheckUtils]: 13: Hoare triple {6161#(= |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); {6151#true} is VALID [2022-02-20 23:57:36,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {6161#(= |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); {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} is VALID [2022-02-20 23:57:36,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {6151#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; {6161#(= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)} is VALID [2022-02-20 23:57:36,941 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6151#true} {6151#true} #274#return; {6151#true} is VALID [2022-02-20 23:57:36,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {6151#true} assume true; {6151#true} is VALID [2022-02-20 23:57:36,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {6151#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6151#true} is VALID [2022-02-20 23:57:36,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {6151#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {6151#true} is VALID [2022-02-20 23:57:36,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {6151#true} is VALID [2022-02-20 23:57:36,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {6151#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {6151#true} is VALID [2022-02-20 23:57:36,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {6151#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6151#true} is VALID [2022-02-20 23:57:36,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {6151#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; {6151#true} is VALID [2022-02-20 23:57:36,943 INFO L272 TraceCheckUtils]: 2: Hoare triple {6151#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {6151#true} is VALID [2022-02-20 23:57:36,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {6151#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {6151#true} is VALID [2022-02-20 23:57:36,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {6151#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(23, 2); {6151#true} is VALID [2022-02-20 23:57:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:57:36,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086356805] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:57:36,943 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:57:36,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-02-20 23:57:36,944 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685040730] [2022-02-20 23:57:36,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:57:36,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-02-20 23:57:36,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:36,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:36,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:36,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:57:36,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:36,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:57:36,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:57:36,971 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:37,491 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2022-02-20 23:57:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:57:37,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-02-20 23:57:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2022-02-20 23:57:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2022-02-20 23:57:37,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 191 transitions. [2022-02-20 23:57:37,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:37,595 INFO L225 Difference]: With dead ends: 174 [2022-02-20 23:57:37,595 INFO L226 Difference]: Without dead ends: 174 [2022-02-20 23:57:37,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:57:37,597 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 13 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:37,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 408 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:57:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-20 23:57:37,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2022-02-20 23:57:37,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:37,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 172 states, 93 states have (on average 1.935483870967742) internal successors, (180), 166 states have internal predecessors, (180), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:37,601 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 172 states, 93 states have (on average 1.935483870967742) internal successors, (180), 166 states have internal predecessors, (180), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:37,601 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 172 states, 93 states have (on average 1.935483870967742) internal successors, (180), 166 states have internal predecessors, (180), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:37,604 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2022-02-20 23:57:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 190 transitions. [2022-02-20 23:57:37,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:37,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:37,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 93 states have (on average 1.935483870967742) internal successors, (180), 166 states have internal predecessors, (180), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 174 states. [2022-02-20 23:57:37,605 INFO L87 Difference]: Start difference. First operand has 172 states, 93 states have (on average 1.935483870967742) internal successors, (180), 166 states have internal predecessors, (180), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 174 states. [2022-02-20 23:57:37,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:37,608 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2022-02-20 23:57:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 190 transitions. [2022-02-20 23:57:37,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:37,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:37,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:37,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 93 states have (on average 1.935483870967742) internal successors, (180), 166 states have internal predecessors, (180), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 188 transitions. [2022-02-20 23:57:37,611 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 188 transitions. Word has length 29 [2022-02-20 23:57:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:37,611 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 188 transitions. [2022-02-20 23:57:37,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 188 transitions. [2022-02-20 23:57:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:57:37,612 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:37,612 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:37,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:57:37,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:37,829 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:37,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:37,829 INFO L85 PathProgramCache]: Analyzing trace with hash -295058061, now seen corresponding path program 1 times [2022-02-20 23:57:37,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:37,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586917023] [2022-02-20 23:57:37,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:37,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:37,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:57:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:37,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {7063#(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; {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:37,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:37,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:37,952 INFO L290 TraceCheckUtils]: 3: Hoare triple {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:37,952 INFO L290 TraceCheckUtils]: 4: Hoare triple {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:37,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7065#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0))} is VALID [2022-02-20 23:57:37,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {7065#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0))} assume true; {7065#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0))} is VALID [2022-02-20 23:57:37,954 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7065#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0))} {7041#true} #274#return; {7051#(= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0)} is VALID [2022-02-20 23:57:37,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 23:57:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:37,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {7063#(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; {7041#true} is VALID [2022-02-20 23:57:37,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {7041#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7041#true} is VALID [2022-02-20 23:57:37,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {7041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {7041#true} is VALID [2022-02-20 23:57:37,971 INFO L290 TraceCheckUtils]: 3: Hoare triple {7041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {7041#true} is VALID [2022-02-20 23:57:37,971 INFO L290 TraceCheckUtils]: 4: Hoare triple {7041#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {7041#true} is VALID [2022-02-20 23:57:37,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {7041#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7041#true} is VALID [2022-02-20 23:57:37,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {7041#true} assume true; {7041#true} is VALID [2022-02-20 23:57:37,972 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7041#true} {7052#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} #276#return; {7061#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (* (- 1) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) 0))} is VALID [2022-02-20 23:57:37,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {7041#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(23, 2); {7041#true} is VALID [2022-02-20 23:57:37,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {7041#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {7041#true} is VALID [2022-02-20 23:57:37,973 INFO L272 TraceCheckUtils]: 2: Hoare triple {7041#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {7063#(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 23:57:37,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {7063#(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; {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:37,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:37,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:37,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:37,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:37,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {7064#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7065#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0))} is VALID [2022-02-20 23:57:37,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {7065#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0))} assume true; {7065#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0))} is VALID [2022-02-20 23:57:37,976 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7065#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0))} {7041#true} #274#return; {7051#(= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0)} is VALID [2022-02-20 23:57:37,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {7051#(= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 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; {7052#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:57:37,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {7052#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |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); {7052#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:57:37,977 INFO L272 TraceCheckUtils]: 13: Hoare triple {7052#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |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); {7063#(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 23:57:37,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {7063#(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; {7041#true} is VALID [2022-02-20 23:57:37,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {7041#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7041#true} is VALID [2022-02-20 23:57:37,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {7041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {7041#true} is VALID [2022-02-20 23:57:37,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {7041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {7041#true} is VALID [2022-02-20 23:57:37,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {7041#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {7041#true} is VALID [2022-02-20 23:57:37,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {7041#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7041#true} is VALID [2022-02-20 23:57:37,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {7041#true} assume true; {7041#true} is VALID [2022-02-20 23:57:37,978 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7041#true} {7052#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} #276#return; {7061#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (* (- 1) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) 0))} is VALID [2022-02-20 23:57:37,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {7061#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (* (- 1) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) 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; {7061#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (* (- 1) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) 0))} is VALID [2022-02-20 23:57:37,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {7061#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (* (- 1) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) 0))} SUMMARY for 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); srcloc: L590 {7061#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (* (- 1) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) 0))} is VALID [2022-02-20 23:57:37,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {7061#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (* (- 1) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) 0))} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {7061#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (* (- 1) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) 0))} is VALID [2022-02-20 23:57:37,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {7061#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (* (- 1) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) 0))} SUMMARY for 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); srcloc: L592 {7062#(and (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0))} is VALID [2022-02-20 23:57:37,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {7062#(and (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~last~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; {7062#(and (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0))} is VALID [2022-02-20 23:57:37,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {7062#(and (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0))} assume !(dll_circular_create_~len#1 > 1); {7062#(and (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0))} is VALID [2022-02-20 23:57:37,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {7062#(and (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0))} assume !(4 + dll_circular_create_~last~0#1.offset <= #length[dll_circular_create_~last~0#1.base] && 0 <= dll_circular_create_~last~0#1.offset); {7042#false} is VALID [2022-02-20 23:57:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:57:37,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:37,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586917023] [2022-02-20 23:57:37,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586917023] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:37,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050407509] [2022-02-20 23:57:37,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:37,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:37,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:37,983 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:57:37,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:57:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:38,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:57:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:38,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:38,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {7041#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(23, 2); {7041#true} is VALID [2022-02-20 23:57:38,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {7041#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {7041#true} is VALID [2022-02-20 23:57:38,329 INFO L272 TraceCheckUtils]: 2: Hoare triple {7041#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {7041#true} is VALID [2022-02-20 23:57:38,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {7041#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; {7078#(<= 0 |node_create_~temp~0#1.offset|)} is VALID [2022-02-20 23:57:38,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {7078#(<= 0 |node_create_~temp~0#1.offset|)} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7078#(<= 0 |node_create_~temp~0#1.offset|)} is VALID [2022-02-20 23:57:38,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {7078#(<= 0 |node_create_~temp~0#1.offset|)} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {7078#(<= 0 |node_create_~temp~0#1.offset|)} is VALID [2022-02-20 23:57:38,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {7078#(<= 0 |node_create_~temp~0#1.offset|)} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {7078#(<= 0 |node_create_~temp~0#1.offset|)} is VALID [2022-02-20 23:57:38,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {7078#(<= 0 |node_create_~temp~0#1.offset|)} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {7078#(<= 0 |node_create_~temp~0#1.offset|)} is VALID [2022-02-20 23:57:38,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {7078#(<= 0 |node_create_~temp~0#1.offset|)} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7094#(<= 0 |node_create_#res#1.offset|)} is VALID [2022-02-20 23:57:38,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {7094#(<= 0 |node_create_#res#1.offset|)} assume true; {7094#(<= 0 |node_create_#res#1.offset|)} is VALID [2022-02-20 23:57:38,331 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7094#(<= 0 |node_create_#res#1.offset|)} {7041#true} #274#return; {7101#(<= 0 |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset|)} is VALID [2022-02-20 23:57:38,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {7101#(<= 0 |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset|)} 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; {7105#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:57:38,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {7105#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} assume !!(dll_circular_create_~len#1 > 1); {7105#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:57:38,332 INFO L272 TraceCheckUtils]: 13: Hoare triple {7105#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {7041#true} is VALID [2022-02-20 23:57:38,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {7041#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; {7041#true} is VALID [2022-02-20 23:57:38,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {7041#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7041#true} is VALID [2022-02-20 23:57:38,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {7041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {7041#true} is VALID [2022-02-20 23:57:38,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {7041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {7041#true} is VALID [2022-02-20 23:57:38,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {7041#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {7041#true} is VALID [2022-02-20 23:57:38,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {7041#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7041#true} is VALID [2022-02-20 23:57:38,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {7041#true} assume true; {7041#true} is VALID [2022-02-20 23:57:38,335 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7041#true} {7105#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} #276#return; {7105#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:57:38,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {7105#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |ULTIMATE.start_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~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; {7105#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:57:38,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {7105#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} SUMMARY for 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); srcloc: L590 {7105#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:57:38,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {7105#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {7105#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:57:38,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {7105#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} SUMMARY for 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); srcloc: L592 {7148#(and (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|))} is VALID [2022-02-20 23:57:38,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {7148#(and (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (<= 0 |ULTIMATE.start_dll_circular_create_~last~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 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {7148#(and (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|))} is VALID [2022-02-20 23:57:38,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {7148#(and (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|))} assume !(dll_circular_create_~len#1 > 1); {7148#(and (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|))} is VALID [2022-02-20 23:57:38,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {7148#(and (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|))} assume !(4 + dll_circular_create_~last~0#1.offset <= #length[dll_circular_create_~last~0#1.base] && 0 <= dll_circular_create_~last~0#1.offset); {7042#false} is VALID [2022-02-20 23:57:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:57:38,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:57:38,377 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:57:38,377 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 20 treesize of output 24 [2022-02-20 23:57:38,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {7158#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} assume !(4 + dll_circular_create_~last~0#1.offset <= #length[dll_circular_create_~last~0#1.base] && 0 <= dll_circular_create_~last~0#1.offset); {7042#false} is VALID [2022-02-20 23:57:38,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {7158#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} assume !(dll_circular_create_~len#1 > 1); {7158#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:57:38,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {7158#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |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 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {7158#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:57:38,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {7168#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} SUMMARY for 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); srcloc: L592 {7158#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:57:38,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {7168#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {7168#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:57:38,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {7168#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} SUMMARY for 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); srcloc: L590 {7168#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:57:38,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {7168#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~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; {7168#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:57:38,624 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7041#true} {7168#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} #276#return; {7168#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:57:38,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {7041#true} assume true; {7041#true} is VALID [2022-02-20 23:57:38,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {7041#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7041#true} is VALID [2022-02-20 23:57:38,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {7041#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {7041#true} is VALID [2022-02-20 23:57:38,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {7041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {7041#true} is VALID [2022-02-20 23:57:38,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {7041#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {7041#true} is VALID [2022-02-20 23:57:38,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {7041#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7041#true} is VALID [2022-02-20 23:57:38,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {7041#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; {7041#true} is VALID [2022-02-20 23:57:38,625 INFO L272 TraceCheckUtils]: 13: Hoare triple {7168#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (= |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); {7041#true} is VALID [2022-02-20 23:57:38,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {7168#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (= |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); {7168#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:57:38,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {7101#(<= 0 |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset|)} 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; {7168#(and (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:57:38,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7094#(<= 0 |node_create_#res#1.offset|)} {7041#true} #274#return; {7101#(<= 0 |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset|)} is VALID [2022-02-20 23:57:38,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {7094#(<= 0 |node_create_#res#1.offset|)} assume true; {7094#(<= 0 |node_create_#res#1.offset|)} is VALID [2022-02-20 23:57:38,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {7078#(<= 0 |node_create_~temp~0#1.offset|)} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7094#(<= 0 |node_create_#res#1.offset|)} is VALID [2022-02-20 23:57:38,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {7078#(<= 0 |node_create_~temp~0#1.offset|)} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {7078#(<= 0 |node_create_~temp~0#1.offset|)} is VALID [2022-02-20 23:57:38,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {7078#(<= 0 |node_create_~temp~0#1.offset|)} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {7078#(<= 0 |node_create_~temp~0#1.offset|)} is VALID [2022-02-20 23:57:38,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {7078#(<= 0 |node_create_~temp~0#1.offset|)} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {7078#(<= 0 |node_create_~temp~0#1.offset|)} is VALID [2022-02-20 23:57:38,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {7078#(<= 0 |node_create_~temp~0#1.offset|)} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7078#(<= 0 |node_create_~temp~0#1.offset|)} is VALID [2022-02-20 23:57:38,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {7041#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; {7078#(<= 0 |node_create_~temp~0#1.offset|)} is VALID [2022-02-20 23:57:38,630 INFO L272 TraceCheckUtils]: 2: Hoare triple {7041#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {7041#true} is VALID [2022-02-20 23:57:38,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {7041#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {7041#true} is VALID [2022-02-20 23:57:38,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {7041#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(23, 2); {7041#true} is VALID [2022-02-20 23:57:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:57:38,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050407509] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:57:38,631 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:57:38,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-02-20 23:57:38,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203161567] [2022-02-20 23:57:38,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:57:38,632 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-02-20 23:57:38,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:38,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:57:38,670 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 23:57:38,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:57:38,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:38,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:57:38,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:57:38,671 INFO L87 Difference]: Start difference. First operand 172 states and 188 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:57:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:39,936 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2022-02-20 23:57:39,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:57:39,937 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-02-20 23:57:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:57:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2022-02-20 23:57:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:57:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2022-02-20 23:57:39,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 197 transitions. [2022-02-20 23:57:40,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:40,160 INFO L225 Difference]: With dead ends: 179 [2022-02-20 23:57:40,160 INFO L226 Difference]: Without dead ends: 179 [2022-02-20 23:57:40,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:57:40,163 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 26 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:40,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 1560 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:57:40,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-02-20 23:57:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 172. [2022-02-20 23:57:40,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:40,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 172 states, 93 states have (on average 1.924731182795699) internal successors, (179), 166 states have internal predecessors, (179), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:40,168 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 172 states, 93 states have (on average 1.924731182795699) internal successors, (179), 166 states have internal predecessors, (179), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:40,168 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 172 states, 93 states have (on average 1.924731182795699) internal successors, (179), 166 states have internal predecessors, (179), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:40,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:40,171 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2022-02-20 23:57:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 196 transitions. [2022-02-20 23:57:40,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:40,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:40,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 93 states have (on average 1.924731182795699) internal successors, (179), 166 states have internal predecessors, (179), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 179 states. [2022-02-20 23:57:40,172 INFO L87 Difference]: Start difference. First operand has 172 states, 93 states have (on average 1.924731182795699) internal successors, (179), 166 states have internal predecessors, (179), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 179 states. [2022-02-20 23:57:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:40,175 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2022-02-20 23:57:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 196 transitions. [2022-02-20 23:57:40,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:40,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:40,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:40,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 93 states have (on average 1.924731182795699) internal successors, (179), 166 states have internal predecessors, (179), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:40,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2022-02-20 23:57:40,179 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 29 [2022-02-20 23:57:40,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:40,179 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2022-02-20 23:57:40,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:57:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2022-02-20 23:57:40,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:57:40,180 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:40,180 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:40,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 23:57:40,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 23:57:40,409 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:40,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:40,410 INFO L85 PathProgramCache]: Analyzing trace with hash -556865325, now seen corresponding path program 1 times [2022-02-20 23:57:40,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:40,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925227011] [2022-02-20 23:57:40,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:40,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:40,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:57:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:40,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {7977#(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; {7956#true} is VALID [2022-02-20 23:57:40,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {7956#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7956#true} is VALID [2022-02-20 23:57:40,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {7956#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {7956#true} is VALID [2022-02-20 23:57:40,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {7956#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {7956#true} is VALID [2022-02-20 23:57:40,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {7956#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {7956#true} is VALID [2022-02-20 23:57:40,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {7956#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7956#true} is VALID [2022-02-20 23:57:40,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {7956#true} assume true; {7956#true} is VALID [2022-02-20 23:57:40,478 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7956#true} {7956#true} #274#return; {7956#true} is VALID [2022-02-20 23:57:40,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 23:57:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:40,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {7977#(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; {7956#true} is VALID [2022-02-20 23:57:40,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {7956#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7956#true} is VALID [2022-02-20 23:57:40,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {7956#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {7978#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:40,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {7978#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {7978#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:40,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {7978#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {7978#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:40,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {7978#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7979#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:40,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {7979#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {7979#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:40,517 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7979#(= (select |#valid| |node_create_#res#1.base|) 1)} {7956#true} #276#return; {7974#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:57:40,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {7956#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(23, 2); {7956#true} is VALID [2022-02-20 23:57:40,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {7956#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {7956#true} is VALID [2022-02-20 23:57:40,518 INFO L272 TraceCheckUtils]: 2: Hoare triple {7956#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {7977#(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 23:57:40,518 INFO L290 TraceCheckUtils]: 3: Hoare triple {7977#(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; {7956#true} is VALID [2022-02-20 23:57:40,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {7956#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7956#true} is VALID [2022-02-20 23:57:40,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {7956#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {7956#true} is VALID [2022-02-20 23:57:40,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {7956#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {7956#true} is VALID [2022-02-20 23:57:40,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {7956#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {7956#true} is VALID [2022-02-20 23:57:40,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {7956#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7956#true} is VALID [2022-02-20 23:57:40,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {7956#true} assume true; {7956#true} is VALID [2022-02-20 23:57:40,519 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7956#true} {7956#true} #274#return; {7956#true} is VALID [2022-02-20 23:57:40,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {7956#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; {7956#true} is VALID [2022-02-20 23:57:40,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {7956#true} assume !!(dll_circular_create_~len#1 > 1); {7956#true} is VALID [2022-02-20 23:57:40,520 INFO L272 TraceCheckUtils]: 13: Hoare triple {7956#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {7977#(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 23:57:40,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {7977#(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; {7956#true} is VALID [2022-02-20 23:57:40,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {7956#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7956#true} is VALID [2022-02-20 23:57:40,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {7956#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {7978#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:40,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {7978#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {7978#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:40,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {7978#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {7978#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:40,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {7978#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7979#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:40,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {7979#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {7979#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:40,523 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7979#(= (select |#valid| |node_create_#res#1.base|) 1)} {7956#true} #276#return; {7974#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:57:40,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {7974#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 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; {7975#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:57:40,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {7975#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)} SUMMARY for 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); srcloc: L590 {7975#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:57:40,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {7975#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {7975#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:57:40,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {7975#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)} SUMMARY for 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); srcloc: L592 {7975#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:57:40,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {7975#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 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; {7976#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:40,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {7976#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} assume !(dll_circular_create_~len#1 > 1); {7976#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:40,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {7976#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} SUMMARY for 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); srcloc: L588-3 {7976#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:40,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {7976#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)} assume !(1 == #valid[dll_circular_create_~head~0#1.base]); {7957#false} is VALID [2022-02-20 23:57:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:57:40,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:40,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925227011] [2022-02-20 23:57:40,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925227011] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:40,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:40,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:57:40,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565474265] [2022-02-20 23:57:40,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:40,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-02-20 23:57:40,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:40,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:40,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:40,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:57:40,545 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:40,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:57:40,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:57:40,545 INFO L87 Difference]: Start difference. First operand 172 states and 187 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:41,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:41,430 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2022-02-20 23:57:41,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:57:41,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-02-20 23:57:41,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2022-02-20 23:57:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2022-02-20 23:57:41,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 180 transitions. [2022-02-20 23:57:41,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:41,548 INFO L225 Difference]: With dead ends: 172 [2022-02-20 23:57:41,548 INFO L226 Difference]: Without dead ends: 172 [2022-02-20 23:57:41,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:57:41,548 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 23 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:41,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 638 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:57:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-02-20 23:57:41,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2022-02-20 23:57:41,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:41,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 171 states, 93 states have (on average 1.913978494623656) internal successors, (178), 165 states have internal predecessors, (178), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:41,551 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 171 states, 93 states have (on average 1.913978494623656) internal successors, (178), 165 states have internal predecessors, (178), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:41,551 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 171 states, 93 states have (on average 1.913978494623656) internal successors, (178), 165 states have internal predecessors, (178), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:41,562 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2022-02-20 23:57:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2022-02-20 23:57:41,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:41,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:41,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 93 states have (on average 1.913978494623656) internal successors, (178), 165 states have internal predecessors, (178), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 172 states. [2022-02-20 23:57:41,563 INFO L87 Difference]: Start difference. First operand has 171 states, 93 states have (on average 1.913978494623656) internal successors, (178), 165 states have internal predecessors, (178), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 172 states. [2022-02-20 23:57:41,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:41,566 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2022-02-20 23:57:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2022-02-20 23:57:41,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:41,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:41,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:41,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 93 states have (on average 1.913978494623656) internal successors, (178), 165 states have internal predecessors, (178), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 186 transitions. [2022-02-20 23:57:41,569 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 186 transitions. Word has length 30 [2022-02-20 23:57:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:41,569 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 186 transitions. [2022-02-20 23:57:41,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 186 transitions. [2022-02-20 23:57:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:57:41,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:41,570 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:41,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:57:41,570 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:41,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:41,570 INFO L85 PathProgramCache]: Analyzing trace with hash -556865324, now seen corresponding path program 1 times [2022-02-20 23:57:41,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:41,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912303928] [2022-02-20 23:57:41,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:41,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:41,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:57:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:41,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {8695#(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; {8674#true} is VALID [2022-02-20 23:57:41,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {8674#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8674#true} is VALID [2022-02-20 23:57:41,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {8674#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {8674#true} is VALID [2022-02-20 23:57:41,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {8674#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {8674#true} is VALID [2022-02-20 23:57:41,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {8674#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {8674#true} is VALID [2022-02-20 23:57:41,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {8674#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8674#true} is VALID [2022-02-20 23:57:41,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {8674#true} assume true; {8674#true} is VALID [2022-02-20 23:57:41,636 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8674#true} {8674#true} #274#return; {8674#true} is VALID [2022-02-20 23:57:41,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 23:57:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:41,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {8695#(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; {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:41,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:41,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:41,675 INFO L290 TraceCheckUtils]: 3: Hoare triple {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:41,675 INFO L290 TraceCheckUtils]: 4: Hoare triple {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:41,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8697#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} is VALID [2022-02-20 23:57:41,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {8697#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} assume true; {8697#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} is VALID [2022-02-20 23:57:41,677 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8697#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} {8674#true} #276#return; {8692#(and (= (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0))} is VALID [2022-02-20 23:57:41,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {8674#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(23, 2); {8674#true} is VALID [2022-02-20 23:57:41,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {8674#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {8674#true} is VALID [2022-02-20 23:57:41,678 INFO L272 TraceCheckUtils]: 2: Hoare triple {8674#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {8695#(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 23:57:41,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {8695#(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; {8674#true} is VALID [2022-02-20 23:57:41,678 INFO L290 TraceCheckUtils]: 4: Hoare triple {8674#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8674#true} is VALID [2022-02-20 23:57:41,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {8674#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {8674#true} is VALID [2022-02-20 23:57:41,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {8674#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {8674#true} is VALID [2022-02-20 23:57:41,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {8674#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {8674#true} is VALID [2022-02-20 23:57:41,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {8674#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8674#true} is VALID [2022-02-20 23:57:41,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {8674#true} assume true; {8674#true} is VALID [2022-02-20 23:57:41,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8674#true} {8674#true} #274#return; {8674#true} is VALID [2022-02-20 23:57:41,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {8674#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; {8674#true} is VALID [2022-02-20 23:57:41,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {8674#true} assume !!(dll_circular_create_~len#1 > 1); {8674#true} is VALID [2022-02-20 23:57:41,680 INFO L272 TraceCheckUtils]: 13: Hoare triple {8674#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {8695#(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 23:57:41,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {8695#(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; {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:41,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:41,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:41,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:41,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:57:41,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {8696#(and (= (select |#length| |node_create_~temp~0#1.base|) 12) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8697#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} is VALID [2022-02-20 23:57:41,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {8697#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} assume true; {8697#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} is VALID [2022-02-20 23:57:41,684 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8697#(and (<= 0 |node_create_#res#1.offset|) (= (select |#length| |node_create_#res#1.base|) 12) (<= |node_create_#res#1.offset| 0))} {8674#true} #276#return; {8692#(and (= (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0))} is VALID [2022-02-20 23:57:41,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {8692#(and (= (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 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; {8693#(and (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 23:57:41,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {8693#(and (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))} SUMMARY for 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); srcloc: L590 {8693#(and (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 23:57:41,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {8693#(and (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= |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; {8693#(and (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 23:57:41,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {8693#(and (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))} SUMMARY for 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); srcloc: L592 {8693#(and (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 23:57:41,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {8693#(and (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= |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; {8694#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:57:41,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {8694#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (- 12)) 0))} assume !(dll_circular_create_~len#1 > 1); {8694#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:57:41,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {8694#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (- 12)) 0))} SUMMARY for 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); srcloc: L588-3 {8694#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:57:41,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {8694#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (- 12)) 0))} assume !(4 + (4 + dll_circular_create_~head~0#1.offset) <= #length[dll_circular_create_~head~0#1.base] && 0 <= 4 + dll_circular_create_~head~0#1.offset); {8675#false} is VALID [2022-02-20 23:57:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:57:41,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:41,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912303928] [2022-02-20 23:57:41,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912303928] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:41,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:41,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:57:41,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787923305] [2022-02-20 23:57:41,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:41,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-02-20 23:57:41,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:41,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:41,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:41,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:57:41,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:41,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:57:41,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:57:41,713 INFO L87 Difference]: Start difference. First operand 171 states and 186 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:42,674 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2022-02-20 23:57:42,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:57:42,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-02-20 23:57:42,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2022-02-20 23:57:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2022-02-20 23:57:42,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 178 transitions. [2022-02-20 23:57:42,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:42,788 INFO L225 Difference]: With dead ends: 170 [2022-02-20 23:57:42,788 INFO L226 Difference]: Without dead ends: 170 [2022-02-20 23:57:42,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:57:42,789 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 20 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:42,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 668 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:57:42,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-02-20 23:57:42,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-02-20 23:57:42,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:42,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 170 states, 93 states have (on average 1.903225806451613) internal successors, (177), 164 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:42,792 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 170 states, 93 states have (on average 1.903225806451613) internal successors, (177), 164 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:42,792 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 170 states, 93 states have (on average 1.903225806451613) internal successors, (177), 164 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:42,794 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2022-02-20 23:57:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 185 transitions. [2022-02-20 23:57:42,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:42,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:42,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 93 states have (on average 1.903225806451613) internal successors, (177), 164 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 170 states. [2022-02-20 23:57:42,795 INFO L87 Difference]: Start difference. First operand has 170 states, 93 states have (on average 1.903225806451613) internal successors, (177), 164 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 170 states. [2022-02-20 23:57:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:42,798 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2022-02-20 23:57:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 185 transitions. [2022-02-20 23:57:42,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:42,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:42,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:42,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 93 states have (on average 1.903225806451613) internal successors, (177), 164 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:57:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 185 transitions. [2022-02-20 23:57:42,801 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 185 transitions. Word has length 30 [2022-02-20 23:57:42,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:42,801 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 185 transitions. [2022-02-20 23:57:42,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 185 transitions. [2022-02-20 23:57:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:57:42,802 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:42,802 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:42,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:57:42,802 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:42,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:42,802 INFO L85 PathProgramCache]: Analyzing trace with hash 311753782, now seen corresponding path program 1 times [2022-02-20 23:57:42,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:42,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235687463] [2022-02-20 23:57:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:42,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:42,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:57:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:42,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {9413#(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; {9385#true} is VALID [2022-02-20 23:57:42,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {9385#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9385#true} is VALID [2022-02-20 23:57:42,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {9385#true} is VALID [2022-02-20 23:57:42,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {9385#true} is VALID [2022-02-20 23:57:42,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {9385#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {9385#true} is VALID [2022-02-20 23:57:42,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {9385#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9385#true} is VALID [2022-02-20 23:57:42,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {9385#true} assume true; {9385#true} is VALID [2022-02-20 23:57:42,886 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9385#true} {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} #274#return; {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:42,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 23:57:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:42,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {9413#(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; {9385#true} is VALID [2022-02-20 23:57:42,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {9385#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9385#true} is VALID [2022-02-20 23:57:42,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {9385#true} is VALID [2022-02-20 23:57:42,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {9385#true} is VALID [2022-02-20 23:57:42,901 INFO L290 TraceCheckUtils]: 4: Hoare triple {9385#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {9385#true} is VALID [2022-02-20 23:57:42,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {9385#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9385#true} is VALID [2022-02-20 23:57:42,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {9385#true} assume true; {9385#true} is VALID [2022-02-20 23:57:42,902 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9385#true} {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} #276#return; {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:42,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 23:57:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:42,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {9413#(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; {9385#true} is VALID [2022-02-20 23:57:42,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {9385#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9385#true} is VALID [2022-02-20 23:57:42,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {9385#true} is VALID [2022-02-20 23:57:42,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {9385#true} is VALID [2022-02-20 23:57:42,914 INFO L290 TraceCheckUtils]: 4: Hoare triple {9385#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {9385#true} is VALID [2022-02-20 23:57:42,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {9385#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9385#true} is VALID [2022-02-20 23:57:42,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {9385#true} assume true; {9385#true} is VALID [2022-02-20 23:57:42,914 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9385#true} {9386#false} #276#return; {9386#false} is VALID [2022-02-20 23:57:42,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {9385#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(23, 2); {9385#true} is VALID [2022-02-20 23:57:42,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {9385#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:42,916 INFO L272 TraceCheckUtils]: 2: Hoare triple {9387#(= (+ (- 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); {9413#(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 23:57:42,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {9413#(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; {9385#true} is VALID [2022-02-20 23:57:42,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {9385#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9385#true} is VALID [2022-02-20 23:57:42,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {9385#true} is VALID [2022-02-20 23:57:42,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {9385#true} is VALID [2022-02-20 23:57:42,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {9385#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {9385#true} is VALID [2022-02-20 23:57:42,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {9385#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9385#true} is VALID [2022-02-20 23:57:42,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {9385#true} assume true; {9385#true} is VALID [2022-02-20 23:57:42,917 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9385#true} {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} #274#return; {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:42,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {9387#(= (+ (- 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; {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:42,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} assume !!(dll_circular_create_~len#1 > 1); {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:42,918 INFO L272 TraceCheckUtils]: 13: Hoare triple {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {9413#(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 23:57:42,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {9413#(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; {9385#true} is VALID [2022-02-20 23:57:42,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {9385#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9385#true} is VALID [2022-02-20 23:57:42,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {9385#true} is VALID [2022-02-20 23:57:42,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {9385#true} is VALID [2022-02-20 23:57:42,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {9385#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {9385#true} is VALID [2022-02-20 23:57:42,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {9385#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9385#true} is VALID [2022-02-20 23:57:42,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {9385#true} assume true; {9385#true} is VALID [2022-02-20 23:57:42,920 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9385#true} {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} #276#return; {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:42,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#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; {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:42,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} SUMMARY for 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); srcloc: L590 {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:42,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:42,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} SUMMARY for 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); srcloc: L592 {9387#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:57:42,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {9387#(= (+ (- 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_~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; {9404#(<= |ULTIMATE.start_dll_circular_create_~len#1| 1)} is VALID [2022-02-20 23:57:42,922 INFO L290 TraceCheckUtils]: 27: Hoare triple {9404#(<= |ULTIMATE.start_dll_circular_create_~len#1| 1)} assume !!(dll_circular_create_~len#1 > 1); {9386#false} is VALID [2022-02-20 23:57:42,922 INFO L272 TraceCheckUtils]: 28: Hoare triple {9386#false} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {9413#(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 23:57:42,922 INFO L290 TraceCheckUtils]: 29: Hoare triple {9413#(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; {9385#true} is VALID [2022-02-20 23:57:42,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {9385#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9385#true} is VALID [2022-02-20 23:57:42,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {9385#true} is VALID [2022-02-20 23:57:42,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {9385#true} is VALID [2022-02-20 23:57:42,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {9385#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {9385#true} is VALID [2022-02-20 23:57:42,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {9385#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9385#true} is VALID [2022-02-20 23:57:42,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {9385#true} assume true; {9385#true} is VALID [2022-02-20 23:57:42,944 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9385#true} {9386#false} #276#return; {9386#false} is VALID [2022-02-20 23:57:42,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {9386#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; {9386#false} is VALID [2022-02-20 23:57:42,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {9386#false} SUMMARY for 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); srcloc: L590 {9386#false} is VALID [2022-02-20 23:57:42,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {9386#false} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {9386#false} is VALID [2022-02-20 23:57:42,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {9386#false} assume !(1 == #valid[dll_circular_create_~head~0#1.base]); {9386#false} is VALID [2022-02-20 23:57:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 23:57:42,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:42,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235687463] [2022-02-20 23:57:42,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235687463] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:42,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386201158] [2022-02-20 23:57:42,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:42,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:42,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:42,946 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:57:42,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:57:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:43,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:57:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:43,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:43,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {9385#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(23, 2); {9385#true} is VALID [2022-02-20 23:57:43,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {9385#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:57:43,234 INFO L272 TraceCheckUtils]: 2: Hoare triple {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {9385#true} is VALID [2022-02-20 23:57:43,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {9385#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; {9385#true} is VALID [2022-02-20 23:57:43,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {9385#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9385#true} is VALID [2022-02-20 23:57:43,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {9385#true} is VALID [2022-02-20 23:57:43,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {9385#true} is VALID [2022-02-20 23:57:43,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {9385#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {9385#true} is VALID [2022-02-20 23:57:43,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {9385#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9385#true} is VALID [2022-02-20 23:57:43,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {9385#true} assume true; {9385#true} is VALID [2022-02-20 23:57:43,235 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9385#true} {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} #274#return; {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:57:43,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} 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; {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:57:43,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} assume !!(dll_circular_create_~len#1 > 1); {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:57:43,236 INFO L272 TraceCheckUtils]: 13: Hoare triple {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {9385#true} is VALID [2022-02-20 23:57:43,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {9385#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; {9385#true} is VALID [2022-02-20 23:57:43,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {9385#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9385#true} is VALID [2022-02-20 23:57:43,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {9385#true} is VALID [2022-02-20 23:57:43,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {9385#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {9385#true} is VALID [2022-02-20 23:57:43,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {9385#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {9385#true} is VALID [2022-02-20 23:57:43,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {9385#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9385#true} is VALID [2022-02-20 23:57:43,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {9385#true} assume true; {9385#true} is VALID [2022-02-20 23:57:43,237 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9385#true} {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} #276#return; {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:57:43,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} 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; {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:57:43,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} SUMMARY for 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); srcloc: L590 {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:57:43,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:57:43,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} SUMMARY for 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); srcloc: L592 {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:57:43,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {9420#(<= |ULTIMATE.start_dll_circular_create_~len#1| 2)} 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; {9404#(<= |ULTIMATE.start_dll_circular_create_~len#1| 1)} is VALID [2022-02-20 23:57:43,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {9404#(<= |ULTIMATE.start_dll_circular_create_~len#1| 1)} assume !!(dll_circular_create_~len#1 > 1); {9386#false} is VALID [2022-02-20 23:57:43,239 INFO L272 TraceCheckUtils]: 28: Hoare triple {9386#false} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {9386#false} is VALID [2022-02-20 23:57:43,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {9386#false} ~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; {9386#false} is VALID [2022-02-20 23:57:43,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {9386#false} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9386#false} is VALID [2022-02-20 23:57:43,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {9386#false} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {9386#false} is VALID [2022-02-20 23:57:43,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {9386#false} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {9386#false} is VALID [2022-02-20 23:57:43,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {9386#false} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {9386#false} is VALID [2022-02-20 23:57:43,240 INFO L290 TraceCheckUtils]: 34: Hoare triple {9386#false} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9386#false} is VALID [2022-02-20 23:57:43,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {9386#false} assume true; {9386#false} is VALID [2022-02-20 23:57:43,240 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9386#false} {9386#false} #276#return; {9386#false} is VALID [2022-02-20 23:57:43,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {9386#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; {9386#false} is VALID [2022-02-20 23:57:43,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {9386#false} SUMMARY for 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); srcloc: L590 {9386#false} is VALID [2022-02-20 23:57:43,240 INFO L290 TraceCheckUtils]: 39: Hoare triple {9386#false} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {9386#false} is VALID [2022-02-20 23:57:43,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {9386#false} assume !(1 == #valid[dll_circular_create_~head~0#1.base]); {9386#false} is VALID [2022-02-20 23:57:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:57:43,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:57:43,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386201158] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:43,241 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:57:43,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-02-20 23:57:43,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494253789] [2022-02-20 23:57:43,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:43,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-02-20 23:57:43,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:43,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:43,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:43,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:57:43,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:43,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:57:43,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:57:43,279 INFO L87 Difference]: Start difference. First operand 170 states and 185 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:43,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:43,406 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-02-20 23:57:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:57:43,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-02-20 23:57:43,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2022-02-20 23:57:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2022-02-20 23:57:43,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 170 transitions. [2022-02-20 23:57:43,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:43,522 INFO L225 Difference]: With dead ends: 158 [2022-02-20 23:57:43,522 INFO L226 Difference]: Without dead ends: 158 [2022-02-20 23:57:43,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:57:43,523 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 147 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:43,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 193 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:57:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-20 23:57:43,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-02-20 23:57:43,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:43,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 158 states, 86 states have (on average 1.8953488372093024) internal successors, (163), 153 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:43,526 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 158 states, 86 states have (on average 1.8953488372093024) internal successors, (163), 153 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:43,526 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 158 states, 86 states have (on average 1.8953488372093024) internal successors, (163), 153 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:43,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:43,528 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-02-20 23:57:43,528 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2022-02-20 23:57:43,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:43,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:43,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 86 states have (on average 1.8953488372093024) internal successors, (163), 153 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 158 states. [2022-02-20 23:57:43,530 INFO L87 Difference]: Start difference. First operand has 158 states, 86 states have (on average 1.8953488372093024) internal successors, (163), 153 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 158 states. [2022-02-20 23:57:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:43,532 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-02-20 23:57:43,532 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2022-02-20 23:57:43,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:43,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:43,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:43,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 86 states have (on average 1.8953488372093024) internal successors, (163), 153 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2022-02-20 23:57:43,535 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 41 [2022-02-20 23:57:43,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:43,535 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2022-02-20 23:57:43,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:43,535 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2022-02-20 23:57:43,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 23:57:43,536 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:43,536 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:43,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-20 23:57:43,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:43,754 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:43,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:43,754 INFO L85 PathProgramCache]: Analyzing trace with hash -670127466, now seen corresponding path program 1 times [2022-02-20 23:57:43,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:43,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165903410] [2022-02-20 23:57:43,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:43,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:43,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:57:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:43,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {10198#(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; {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,905 INFO L290 TraceCheckUtils]: 4: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:43,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:43,907 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #274#return; {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:43,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 23:57:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:43,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {10198#(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; {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:43,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:43,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:43,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:43,954 INFO L290 TraceCheckUtils]: 4: Hoare triple {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:43,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:43,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:43,956 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #276#return; {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:43,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 23:57:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:43,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {10198#(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; {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:43,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:43,981 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} #278#return; {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} is VALID [2022-02-20 23:57:43,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {10169#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(23, 2); {10169#true} is VALID [2022-02-20 23:57:43,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {10169#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:43,983 INFO L272 TraceCheckUtils]: 2: Hoare triple {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {10198#(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 23:57:43,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {10198#(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; {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:43,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:43,988 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #274#return; {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:43,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#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; {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:43,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !!(dll_circular_create_~len#1 > 1); {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:43,989 INFO L272 TraceCheckUtils]: 13: Hoare triple {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~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); {10198#(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 23:57:43,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {10198#(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; {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:43,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:43,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:43,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:43,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:43,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {10201#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:43,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:43,994 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #276#return; {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:43,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 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; {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:43,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for 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); srcloc: L590 {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:43,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:43,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for 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); srcloc: L592 {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:43,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 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; {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:43,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(dll_circular_create_~len#1 > 1); {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:43,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for 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); srcloc: L588-3 {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:43,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for 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); srcloc: L597 {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:43,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} 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; {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:43,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~ret18#1.base, main_#t~ret18#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;call write~init~$Pointer$(main_#t~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} is VALID [2022-02-20 23:57:43,998 INFO L272 TraceCheckUtils]: 32: Hoare triple {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {10198#(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 23:57:43,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {10198#(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; {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:43,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:44,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:44,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:44,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:44,001 INFO L290 TraceCheckUtils]: 38: Hoare triple {10199#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:44,002 INFO L290 TraceCheckUtils]: 39: Hoare triple {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:44,003 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10200#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} #278#return; {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} is VALID [2022-02-20 23:57:44,003 INFO L290 TraceCheckUtils]: 41: Hoare triple {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0; {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} is VALID [2022-02-20 23:57:44,004 INFO L290 TraceCheckUtils]: 42: Hoare triple {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} assume !(1 == #valid[dll_circular_insert_~head#1.base]); {10170#false} is VALID [2022-02-20 23:57:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:57:44,004 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:44,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165903410] [2022-02-20 23:57:44,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165903410] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:44,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675817091] [2022-02-20 23:57:44,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:44,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:44,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:44,006 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:57:44,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 23:57:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:44,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 23:57:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:44,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:44,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:57:44,219 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 23:57:44,304 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:57:44,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-20 23:57:44,398 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 9 treesize of output 7 [2022-02-20 23:57:44,768 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:57:44,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:57:44,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {10169#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(23, 2); {10169#true} is VALID [2022-02-20 23:57:44,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {10169#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:44,784 INFO L272 TraceCheckUtils]: 2: Hoare triple {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {10212#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:57:44,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {10212#(= |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; {10216#(exists ((v_ArrVal_1582 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582) |#valid|))} is VALID [2022-02-20 23:57:44,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {10216#(exists ((v_ArrVal_1582 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582) |#valid|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {10216#(exists ((v_ArrVal_1582 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582) |#valid|))} is VALID [2022-02-20 23:57:44,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {10216#(exists ((v_ArrVal_1582 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582) |#valid|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {10216#(exists ((v_ArrVal_1582 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582) |#valid|))} is VALID [2022-02-20 23:57:44,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {10216#(exists ((v_ArrVal_1582 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582) |#valid|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {10216#(exists ((v_ArrVal_1582 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582) |#valid|))} is VALID [2022-02-20 23:57:44,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {10216#(exists ((v_ArrVal_1582 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582) |#valid|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {10216#(exists ((v_ArrVal_1582 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582) |#valid|))} is VALID [2022-02-20 23:57:44,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {10216#(exists ((v_ArrVal_1582 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582) |#valid|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {10232#(exists ((v_ArrVal_1582 Int)) (= (store |old(#valid)| |node_create_#res#1.base| v_ArrVal_1582) |#valid|))} is VALID [2022-02-20 23:57:44,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {10232#(exists ((v_ArrVal_1582 Int)) (= (store |old(#valid)| |node_create_#res#1.base| v_ArrVal_1582) |#valid|))} assume true; {10232#(exists ((v_ArrVal_1582 Int)) (= (store |old(#valid)| |node_create_#res#1.base| v_ArrVal_1582) |#valid|))} is VALID [2022-02-20 23:57:44,790 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10232#(exists ((v_ArrVal_1582 Int)) (= (store |old(#valid)| |node_create_#res#1.base| v_ArrVal_1582) |#valid|))} {10171#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #274#return; {10239#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (or (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:57:44,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {10239#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (or (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |ULTIMATE.start_main_~#s~0#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; {10243#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)))} is VALID [2022-02-20 23:57:44,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {10243#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)))} assume !!(dll_circular_create_~len#1 > 1); {10243#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)))} is VALID [2022-02-20 23:57:44,792 INFO L272 TraceCheckUtils]: 13: Hoare triple {10243#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {10212#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:57:44,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {10212#(= |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; {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:44,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:44,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:44,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:44,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:44,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:44,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:44,798 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10202#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {10243#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)))} #276#return; {10274#(or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:57:44,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {10274#(or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 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; {10274#(or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:57:44,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {10274#(or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} SUMMARY for 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); srcloc: L590 {10274#(or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:57:44,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {10274#(or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {10274#(or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:57:44,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {10274#(or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} SUMMARY for 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); srcloc: L592 {10274#(or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:57:44,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {10274#(or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 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; {10274#(or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:57:44,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {10274#(or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} assume !(dll_circular_create_~len#1 > 1); {10274#(or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:57:44,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {10274#(or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} SUMMARY for 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); srcloc: L588-3 {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:44,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for 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); srcloc: L597 {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:44,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} 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; {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:44,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {10188#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~ret18#1.base, main_#t~ret18#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;call write~init~$Pointer$(main_#t~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} is VALID [2022-02-20 23:57:44,804 INFO L272 TraceCheckUtils]: 32: Hoare triple {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {10212#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:57:44,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {10212#(= |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; {10311#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:57:44,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {10311#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {10311#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:57:44,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {10311#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {10311#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:57:44,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {10311#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {10311#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:57:44,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {10311#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {10311#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:57:44,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {10311#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {10311#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:57:44,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {10311#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} assume true; {10311#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:57:44,810 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10311#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} #278#return; {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} is VALID [2022-02-20 23:57:44,810 INFO L290 TraceCheckUtils]: 41: Hoare triple {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0; {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} is VALID [2022-02-20 23:57:44,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {10189#(= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))} assume !(1 == #valid[dll_circular_insert_~head#1.base]); {10170#false} is VALID [2022-02-20 23:57:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:57:44,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:57:47,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675817091] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:47,285 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:57:47,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 16 [2022-02-20 23:57:47,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968455886] [2022-02-20 23:57:47,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:57:47,286 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.6875) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-02-20 23:57:47,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:47,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 3.6875) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:57:47,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:47,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 23:57:47,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:47,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 23:57:47,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=312, Unknown=1, NotChecked=0, Total=380 [2022-02-20 23:57:47,346 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand has 17 states, 16 states have (on average 3.6875) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:57:49,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:49,191 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2022-02-20 23:57:49,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:57:49,191 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.6875) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-02-20 23:57:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.6875) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:57:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2022-02-20 23:57:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.6875) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:57:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2022-02-20 23:57:49,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 188 transitions. [2022-02-20 23:57:49,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:49,323 INFO L225 Difference]: With dead ends: 166 [2022-02-20 23:57:49,323 INFO L226 Difference]: Without dead ends: 166 [2022-02-20 23:57:49,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=89, Invalid=416, Unknown=1, NotChecked=0, Total=506 [2022-02-20 23:57:49,323 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 199 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:49,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 772 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 633 Invalid, 0 Unknown, 237 Unchecked, 0.6s Time] [2022-02-20 23:57:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-02-20 23:57:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 148. [2022-02-20 23:57:49,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:49,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 148 states, 86 states have (on average 1.7790697674418605) internal successors, (153), 143 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:49,326 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 148 states, 86 states have (on average 1.7790697674418605) internal successors, (153), 143 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:49,326 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 148 states, 86 states have (on average 1.7790697674418605) internal successors, (153), 143 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:49,328 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2022-02-20 23:57:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2022-02-20 23:57:49,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:49,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:49,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 86 states have (on average 1.7790697674418605) internal successors, (153), 143 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 166 states. [2022-02-20 23:57:49,329 INFO L87 Difference]: Start difference. First operand has 148 states, 86 states have (on average 1.7790697674418605) internal successors, (153), 143 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 166 states. [2022-02-20 23:57:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:49,331 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2022-02-20 23:57:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2022-02-20 23:57:49,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:49,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:49,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:49,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 86 states have (on average 1.7790697674418605) internal successors, (153), 143 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2022-02-20 23:57:49,334 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 43 [2022-02-20 23:57:49,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:49,334 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2022-02-20 23:57:49,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.6875) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:57:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2022-02-20 23:57:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 23:57:49,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:49,335 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:49,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-20 23:57:49,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:49,551 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:49,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash -670127465, now seen corresponding path program 1 times [2022-02-20 23:57:49,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:49,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660868880] [2022-02-20 23:57:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:49,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:57:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:49,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {11090#(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; {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,726 INFO L290 TraceCheckUtils]: 4: Hoare triple {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {11092#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:57:49,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {11092#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} assume true; {11092#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:57:49,729 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11092#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} {11062#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} #274#return; {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 23:57:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:49,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {11090#(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; {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:57:49,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} assume true; {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:57:49,782 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} #276#return; {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 23:57:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:49,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {11090#(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; {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:57:49,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} assume true; {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:57:49,809 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} {11080#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_circular_insert_~head#1.base|) (= (select |#length| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 4))} #278#return; {11089#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 4))} is VALID [2022-02-20 23:57:49,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {11060#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(23, 2); {11060#true} is VALID [2022-02-20 23:57:49,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {11060#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {11062#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,811 INFO L272 TraceCheckUtils]: 2: Hoare triple {11062#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {11090#(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 23:57:49,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {11090#(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; {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {11091#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {11092#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:57:49,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {11092#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} assume true; {11092#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:57:49,816 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11092#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} {11062#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} #274#return; {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} 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; {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} assume !!(dll_circular_create_~len#1 > 1); {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,818 INFO L272 TraceCheckUtils]: 13: Hoare triple {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {11090#(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 23:57:49,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {11090#(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; {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:57:49,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} assume true; {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:57:49,823 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} #276#return; {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} 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; {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} SUMMARY for 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); srcloc: L590 {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0; {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} SUMMARY for 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); srcloc: L592 {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} 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; {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} assume !(dll_circular_create_~len#1 > 1); {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} SUMMARY for 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); srcloc: L588-3 {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} SUMMARY for 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); srcloc: L597 {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} 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; {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:57:49,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {11071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} main_#t~ret18#1.base, main_#t~ret18#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;call write~init~$Pointer$(main_#t~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {11080#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_circular_insert_~head#1.base|) (= (select |#length| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 4))} is VALID [2022-02-20 23:57:49,828 INFO L272 TraceCheckUtils]: 32: Hoare triple {11080#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_circular_insert_~head#1.base|) (= (select |#length| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 4))} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {11090#(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 23:57:49,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {11090#(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; {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L577-1 {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L580 {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L581 {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:57:49,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {11093#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:57:49,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} assume true; {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:57:49,833 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11094#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} {11080#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_dll_circular_insert_~head#1.base|) (= (select |#length| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 4))} #278#return; {11089#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 4))} is VALID [2022-02-20 23:57:49,834 INFO L290 TraceCheckUtils]: 41: Hoare triple {11089#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 4))} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0; {11089#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 4))} is VALID [2022-02-20 23:57:49,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {11089#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 4))} assume !(4 + dll_circular_insert_~head#1.offset <= #length[dll_circular_insert_~head#1.base] && 0 <= dll_circular_insert_~head#1.offset); {11061#false} is VALID [2022-02-20 23:57:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 23:57:49,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:49,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660868880] [2022-02-20 23:57:49,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660868880] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:49,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574433105] [2022-02-20 23:57:49,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:49,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:49,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:49,837 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:57:49,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 23:57:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:50,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 23:57:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:50,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:50,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:57:50,102 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 23:57:50,333 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 23:57:50,517 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 23:57:50,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:57:50,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-20 23:57:50,718 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 466923 column 46: unknown constant v_#length_BEFORE_CALL_8 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) 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 23:57:50,721 INFO L158 Benchmark]: Toolchain (without parser) took 26907.93ms. Allocated memory was 92.3MB in the beginning and 285.2MB in the end (delta: 192.9MB). Free memory was 68.9MB in the beginning and 212.6MB in the end (delta: -143.8MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2022-02-20 23:57:50,721 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 75.5MB. Free memory was 51.4MB in the beginning and 51.4MB in the end (delta: 47.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:57:50,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.79ms. Allocated memory is still 92.3MB. Free memory was 68.7MB in the beginning and 56.9MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 23:57:50,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.61ms. Allocated memory is still 92.3MB. Free memory was 56.9MB in the beginning and 53.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:57:50,721 INFO L158 Benchmark]: Boogie Preprocessor took 35.71ms. Allocated memory is still 92.3MB. Free memory was 53.9MB in the beginning and 51.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:57:50,721 INFO L158 Benchmark]: RCFGBuilder took 730.20ms. Allocated memory is still 92.3MB. Free memory was 50.9MB in the beginning and 46.2MB in the end (delta: 4.6MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2022-02-20 23:57:50,722 INFO L158 Benchmark]: TraceAbstraction took 25745.95ms. Allocated memory was 92.3MB in the beginning and 285.2MB in the end (delta: 192.9MB). Free memory was 45.8MB in the beginning and 212.6MB in the end (delta: -166.8MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2022-02-20 23:57:50,723 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.19ms. Allocated memory is still 75.5MB. Free memory was 51.4MB in the beginning and 51.4MB in the end (delta: 47.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.79ms. Allocated memory is still 92.3MB. Free memory was 68.7MB in the beginning and 56.9MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.61ms. Allocated memory is still 92.3MB. Free memory was 56.9MB in the beginning and 53.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.71ms. Allocated memory is still 92.3MB. Free memory was 53.9MB in the beginning and 51.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 730.20ms. Allocated memory is still 92.3MB. Free memory was 50.9MB in the beginning and 46.2MB in the end (delta: 4.6MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * TraceAbstraction took 25745.95ms. Allocated memory was 92.3MB in the beginning and 285.2MB in the end (delta: 192.9MB). Free memory was 45.8MB in the beginning and 212.6MB in the end (delta: -166.8MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 466923 column 46: unknown constant v_#length_BEFORE_CALL_8 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 466923 column 46: unknown constant v_#length_BEFORE_CALL_8: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:57:50,738 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 1 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:57:52,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:57:52,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:57:52,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:57:52,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:57:52,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:57:52,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:57:52,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:57:52,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:57:52,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:57:52,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:57:52,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:57:52,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:57:52,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:57:52,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:57:52,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:57:52,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:57:52,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:57:52,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:57:52,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:57:52,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:57:52,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:57:52,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:57:52,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:57:52,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:57:52,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:57:52,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:57:52,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:57:52,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:57:52,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:57:52,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:57:52,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:57:52,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:57:52,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:57:52,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:57:52,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:57:52,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:57:52,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:57:52,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:57:52,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:57:52,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:57:52,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:57:52,575 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:57:52,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:57:52,576 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:57:52,576 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:57:52,577 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:57:52,577 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:57:52,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:57:52,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:57:52,578 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:57:52,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:57:52,579 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:57:52,579 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:57:52,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:57:52,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:57:52,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:57:52,580 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:57:52,580 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:57:52,580 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:57:52,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:57:52,580 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:57:52,580 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:57:52,580 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:57:52,581 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:57:52,581 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:57:52,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:57:52,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:57:52,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:57:52,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:57:52,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:57:52,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:57:52,582 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:57:52,582 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:57:52,582 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:57:52,582 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2022-02-20 23:57:52,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:57:52,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:57:52,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:57:52,864 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:57:52,864 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:57:52,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-02-20 23:57:52,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591c2a7c6/81d96466859b4b50915a392c3f385334/FLAG8d343c02d [2022-02-20 23:57:53,322 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:57:53,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-02-20 23:57:53,340 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591c2a7c6/81d96466859b4b50915a392c3f385334/FLAG8d343c02d [2022-02-20 23:57:53,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591c2a7c6/81d96466859b4b50915a392c3f385334 [2022-02-20 23:57:53,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:57:53,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:57:53,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:57:53,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:57:53,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:57:53,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:57:53" (1/1) ... [2022-02-20 23:57:53,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7145d8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:53, skipping insertion in model container [2022-02-20 23:57:53,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:57:53" (1/1) ... [2022-02-20 23:57:53,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:57:53,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:57:53,928 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_insert_unequal.i[25148,25161] [2022-02-20 23:57:53,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:57:53,937 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:57:53,973 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_insert_unequal.i[25148,25161] [2022-02-20 23:57:53,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:57:53,994 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:57:53,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:53 WrapperNode [2022-02-20 23:57:53,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:57:53,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:57:53,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:57:53,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:57:54,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:53" (1/1) ... [2022-02-20 23:57:54,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:53" (1/1) ... [2022-02-20 23:57:54,036 INFO L137 Inliner]: procedures = 130, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 192 [2022-02-20 23:57:54,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:57:54,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:57:54,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:57:54,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:57:54,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:53" (1/1) ... [2022-02-20 23:57:54,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:53" (1/1) ... [2022-02-20 23:57:54,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:53" (1/1) ... [2022-02-20 23:57:54,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:53" (1/1) ... [2022-02-20 23:57:54,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:53" (1/1) ... [2022-02-20 23:57:54,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:53" (1/1) ... [2022-02-20 23:57:54,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:53" (1/1) ... [2022-02-20 23:57:54,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:57:54,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:57:54,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:57:54,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:57:54,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:53" (1/1) ... [2022-02-20 23:57:54,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:57:54,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:54,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:57:54,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:57:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:57:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 23:57:54,122 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 23:57:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:57:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:57:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:57:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:57:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:57:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:57:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:57:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:57:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:57:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:57:54,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:57:54,272 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:57:54,273 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:57:54,848 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:57:54,853 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:57:54,854 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 23:57:54,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:57:54 BoogieIcfgContainer [2022-02-20 23:57:54,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:57:54,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:57:54,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:57:54,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:57:54,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:57:53" (1/3) ... [2022-02-20 23:57:54,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb70f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:57:54, skipping insertion in model container [2022-02-20 23:57:54,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:53" (2/3) ... [2022-02-20 23:57:54,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb70f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:57:54, skipping insertion in model container [2022-02-20 23:57:54,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:57:54" (3/3) ... [2022-02-20 23:57:54,870 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2022-02-20 23:57:54,873 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:57:54,874 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 82 error locations. [2022-02-20 23:57:54,900 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:57:54,904 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:57:54,904 INFO L340 AbstractCegarLoop]: Starting to check reachability of 82 error locations. [2022-02-20 23:57:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 87 states have (on average 2.160919540229885) internal successors, (188), 169 states have internal predecessors, (188), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:57:54,922 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:54,922 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:57:54,923 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:54,926 INFO L85 PathProgramCache]: Analyzing trace with hash 897735090, now seen corresponding path program 1 times [2022-02-20 23:57:54,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:57:54,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746062248] [2022-02-20 23:57:54,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:54,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:57:54,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:57:54,953 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 23:57:54,986 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 23:57:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:55,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:57:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:55,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:55,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:57:55,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {177#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(23bv32, 2bv32); {177#true} is VALID [2022-02-20 23:57:55,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {177#true} is VALID [2022-02-20 23:57:55,142 INFO L272 TraceCheckUtils]: 2: Hoare triple {177#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {177#true} is VALID [2022-02-20 23:57:55,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#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; {191#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:57:55,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {191#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {191#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:57:55,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[~temp~0#1.base]); {178#false} is VALID [2022-02-20 23:57:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:55,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:57:55,146 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:57:55,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746062248] [2022-02-20 23:57:55,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746062248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:55,146 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:55,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:57:55,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389020606] [2022-02-20 23:57:55,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:55,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:57:55,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:55,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:55,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:55,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:57:55,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:57:55,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:57:55,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:55,183 INFO L87 Difference]: Start difference. First operand has 174 states, 87 states have (on average 2.160919540229885) internal successors, (188), 169 states have internal predecessors, (188), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:55,933 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2022-02-20 23:57:55,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:57:55,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:57:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:55,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2022-02-20 23:57:55,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2022-02-20 23:57:55,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2022-02-20 23:57:56,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:56,161 INFO L225 Difference]: With dead ends: 171 [2022-02-20 23:57:56,161 INFO L226 Difference]: Without dead ends: 168 [2022-02-20 23:57:56,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:56,165 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 10 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:56,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 269 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:57:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-02-20 23:57:56,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-02-20 23:57:56,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:56,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 168 states, 85 states have (on average 2.0588235294117645) internal successors, (175), 163 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:56,189 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 168 states, 85 states have (on average 2.0588235294117645) internal successors, (175), 163 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:56,190 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 168 states, 85 states have (on average 2.0588235294117645) internal successors, (175), 163 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:56,196 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2022-02-20 23:57:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2022-02-20 23:57:56,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:56,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:56,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 85 states have (on average 2.0588235294117645) internal successors, (175), 163 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 168 states. [2022-02-20 23:57:56,198 INFO L87 Difference]: Start difference. First operand has 168 states, 85 states have (on average 2.0588235294117645) internal successors, (175), 163 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 168 states. [2022-02-20 23:57:56,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:56,204 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2022-02-20 23:57:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2022-02-20 23:57:56,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:56,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:56,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:56,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 85 states have (on average 2.0588235294117645) internal successors, (175), 163 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2022-02-20 23:57:56,212 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 6 [2022-02-20 23:57:56,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:56,212 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2022-02-20 23:57:56,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2022-02-20 23:57:56,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:57:56,213 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:56,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:57:56,222 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 23:57:56,419 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 23:57:56,420 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:56,421 INFO L85 PathProgramCache]: Analyzing trace with hash 897735091, now seen corresponding path program 1 times [2022-02-20 23:57:56,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:57:56,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599907297] [2022-02-20 23:57:56,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:56,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:57:56,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:57:56,423 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 23:57:56,430 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 23:57:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:56,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:57:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:56,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:56,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:57:56,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {872#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(23bv32, 2bv32); {872#true} is VALID [2022-02-20 23:57:56,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {872#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {872#true} is VALID [2022-02-20 23:57:56,643 INFO L272 TraceCheckUtils]: 2: Hoare triple {872#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {872#true} is VALID [2022-02-20 23:57:56,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {872#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; {886#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:57:56,645 INFO L290 TraceCheckUtils]: 4: Hoare triple {886#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {886#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:57:56,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {886#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~temp~0#1.offset), #length[~temp~0#1.base]) && ~bvule32(~temp~0#1.offset, ~bvadd32(4bv32, ~temp~0#1.offset))) && ~bvule32(0bv32, ~temp~0#1.offset)); {873#false} is VALID [2022-02-20 23:57:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:56,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:57:56,646 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:57:56,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599907297] [2022-02-20 23:57:56,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599907297] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:56,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:56,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:57:56,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384902214] [2022-02-20 23:57:56,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:56,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:57:56,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:56,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:56,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:56,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:57:56,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:57:56,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:57:56,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:56,655 INFO L87 Difference]: Start difference. First operand 168 states and 181 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:57,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:57,441 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2022-02-20 23:57:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:57:57,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:57:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2022-02-20 23:57:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2022-02-20 23:57:57,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 181 transitions. [2022-02-20 23:57:57,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:57,636 INFO L225 Difference]: With dead ends: 165 [2022-02-20 23:57:57,636 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 23:57:57,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:57,637 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 5 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:57,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 271 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:57:57,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 23:57:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-02-20 23:57:57,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:57,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 165 states, 85 states have (on average 2.023529411764706) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:57,643 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 165 states, 85 states have (on average 2.023529411764706) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:57,644 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 165 states, 85 states have (on average 2.023529411764706) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:57,658 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2022-02-20 23:57:57,658 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2022-02-20 23:57:57,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:57,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:57,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 85 states have (on average 2.023529411764706) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 165 states. [2022-02-20 23:57:57,662 INFO L87 Difference]: Start difference. First operand has 165 states, 85 states have (on average 2.023529411764706) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 165 states. [2022-02-20 23:57:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:57,669 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2022-02-20 23:57:57,669 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2022-02-20 23:57:57,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:57,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:57,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:57,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 85 states have (on average 2.023529411764706) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2022-02-20 23:57:57,678 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 6 [2022-02-20 23:57:57,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:57,680 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2022-02-20 23:57:57,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2022-02-20 23:57:57,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:57:57,681 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:57,681 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:57,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:57:57,887 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 23:57:57,887 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:57,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash 165946077, now seen corresponding path program 1 times [2022-02-20 23:57:57,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:57:57,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638765122] [2022-02-20 23:57:57,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:57,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:57:57,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:57:57,904 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 23:57:57,912 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 23:57:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:57,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:57:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:57,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:58,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {1552#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(23bv32, 2bv32); {1552#true} is VALID [2022-02-20 23:57:58,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {1552#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {1560#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 23:57:58,035 INFO L272 TraceCheckUtils]: 2: Hoare triple {1560#(= |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); {1552#true} is VALID [2022-02-20 23:57:58,035 INFO L290 TraceCheckUtils]: 3: Hoare triple {1552#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; {1552#true} is VALID [2022-02-20 23:57:58,035 INFO L290 TraceCheckUtils]: 4: Hoare triple {1552#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1552#true} is VALID [2022-02-20 23:57:58,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {1552#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {1552#true} is VALID [2022-02-20 23:57:58,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {1552#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {1552#true} is VALID [2022-02-20 23:57:58,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {1552#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {1552#true} is VALID [2022-02-20 23:57:58,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {1552#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1552#true} is VALID [2022-02-20 23:57:58,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {1552#true} assume true; {1552#true} is VALID [2022-02-20 23:57:58,037 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1552#true} {1560#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} #274#return; {1560#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 23:57:58,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {1560#(= |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; {1560#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 23:57:58,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {1560#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {1553#false} is VALID [2022-02-20 23:57:58,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {1553#false} assume !(1bv1 == #valid[dll_circular_create_~last~0#1.base]); {1553#false} is VALID [2022-02-20 23:57:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:58,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:57:58,039 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:57:58,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638765122] [2022-02-20 23:57:58,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638765122] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:58,039 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:58,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:57:58,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932914093] [2022-02-20 23:57:58,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:58,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2022-02-20 23:57:58,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:58,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:57:58,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:58,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:57:58,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:57:58,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:57:58,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:58,065 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:57:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:58,476 INFO L93 Difference]: Finished difference Result 176 states and 191 transitions. [2022-02-20 23:57:58,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:57:58,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2022-02-20 23:57:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:57:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2022-02-20 23:57:58,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:57:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2022-02-20 23:57:58,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 192 transitions. [2022-02-20 23:57:58,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:58,628 INFO L225 Difference]: With dead ends: 176 [2022-02-20 23:57:58,629 INFO L226 Difference]: Without dead ends: 176 [2022-02-20 23:57:58,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:58,651 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:58,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 349 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:57:58,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-02-20 23:57:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2022-02-20 23:57:58,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:58,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 166 states, 86 states have (on average 2.011627906976744) internal successors, (173), 161 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:58,674 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 166 states, 86 states have (on average 2.011627906976744) internal successors, (173), 161 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:58,674 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 166 states, 86 states have (on average 2.011627906976744) internal successors, (173), 161 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:58,693 INFO L93 Difference]: Finished difference Result 176 states and 191 transitions. [2022-02-20 23:57:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2022-02-20 23:57:58,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:58,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:58,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 86 states have (on average 2.011627906976744) internal successors, (173), 161 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 176 states. [2022-02-20 23:57:58,695 INFO L87 Difference]: Start difference. First operand has 166 states, 86 states have (on average 2.011627906976744) internal successors, (173), 161 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 176 states. [2022-02-20 23:57:58,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:58,703 INFO L93 Difference]: Finished difference Result 176 states and 191 transitions. [2022-02-20 23:57:58,703 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2022-02-20 23:57:58,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:58,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:58,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:58,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 86 states have (on average 2.011627906976744) internal successors, (173), 161 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2022-02-20 23:57:58,711 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 14 [2022-02-20 23:57:58,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:58,711 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2022-02-20 23:57:58,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:57:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2022-02-20 23:57:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:57:58,712 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:58,712 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:58,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:57:58,921 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 23:57:58,922 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:57:58,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:58,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1886331456, now seen corresponding path program 1 times [2022-02-20 23:57:58,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:57:58,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536537350] [2022-02-20 23:57:58,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:58,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:57:58,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:57:58,925 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 23:57:58,927 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 23:57:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:59,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:57:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:59,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:59,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:57:59,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {2290#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(23bv32, 2bv32); {2290#true} is VALID [2022-02-20 23:57:59,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {2290#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {2290#true} is VALID [2022-02-20 23:57:59,116 INFO L272 TraceCheckUtils]: 2: Hoare triple {2290#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {2290#true} is VALID [2022-02-20 23:57:59,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {2290#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; {2290#true} is VALID [2022-02-20 23:57:59,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {2290#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2290#true} is VALID [2022-02-20 23:57:59,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {2290#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {2290#true} is VALID [2022-02-20 23:57:59,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {2290#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {2290#true} is VALID [2022-02-20 23:57:59,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {2290#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {2290#true} is VALID [2022-02-20 23:57:59,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {2290#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2290#true} is VALID [2022-02-20 23:57:59,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {2290#true} assume true; {2290#true} is VALID [2022-02-20 23:57:59,118 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2290#true} {2290#true} #274#return; {2290#true} is VALID [2022-02-20 23:57:59,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {2290#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; {2290#true} is VALID [2022-02-20 23:57:59,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {2290#true} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {2290#true} is VALID [2022-02-20 23:57:59,118 INFO L272 TraceCheckUtils]: 13: Hoare triple {2290#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {2290#true} is VALID [2022-02-20 23:57:59,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {2290#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; {2337#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:57:59,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {2337#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2337#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:57:59,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {2337#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {2337#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:57:59,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {2337#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {2337#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:57:59,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {2337#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {2337#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:57:59,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {2337#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2353#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:57:59,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {2353#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} assume true; {2353#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:57:59,122 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2353#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} {2290#true} #276#return; {2360#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:57:59,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {2360#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (_ bv1 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; {2364#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:57:59,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {2364#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[dll_circular_create_~new_head~0#1.base]); {2291#false} is VALID [2022-02-20 23:57:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:57:59,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:57:59,124 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:57:59,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536537350] [2022-02-20 23:57:59,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536537350] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:59,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:59,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:57:59,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73815069] [2022-02-20 23:57:59,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:59,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 23:57:59,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:59,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:57:59,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:59,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:57:59,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:57:59,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:57:59,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:57:59,147 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:00,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:00,893 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2022-02-20 23:58:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:58:00,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 23:58:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2022-02-20 23:58:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2022-02-20 23:58:00,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 181 transitions. [2022-02-20 23:58:01,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:01,098 INFO L225 Difference]: With dead ends: 166 [2022-02-20 23:58:01,098 INFO L226 Difference]: Without dead ends: 166 [2022-02-20 23:58:01,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:01,099 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 20 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:01,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 514 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:58:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-02-20 23:58:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2022-02-20 23:58:01,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:01,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 165 states, 86 states have (on average 2.0) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:01,104 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 165 states, 86 states have (on average 2.0) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:01,104 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 165 states, 86 states have (on average 2.0) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:01,107 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2022-02-20 23:58:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2022-02-20 23:58:01,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:01,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:01,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 86 states have (on average 2.0) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 166 states. [2022-02-20 23:58:01,109 INFO L87 Difference]: Start difference. First operand has 165 states, 86 states have (on average 2.0) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 166 states. [2022-02-20 23:58:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:01,113 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2022-02-20 23:58:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2022-02-20 23:58:01,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:01,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:01,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:01,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 86 states have (on average 2.0) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2022-02-20 23:58:01,118 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 24 [2022-02-20 23:58:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:01,118 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2022-02-20 23:58:01,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2022-02-20 23:58:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:58:01,119 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:01,119 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:01,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:01,326 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 23:58:01,327 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:58:01,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1886331457, now seen corresponding path program 1 times [2022-02-20 23:58:01,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:01,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632484371] [2022-02-20 23:58:01,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:01,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:01,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:01,329 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 23:58:01,331 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 23:58:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:01,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:58:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:01,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:01,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:58:01,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {3032#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(23bv32, 2bv32); {3032#true} is VALID [2022-02-20 23:58:01,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {3032#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {3032#true} is VALID [2022-02-20 23:58:01,579 INFO L272 TraceCheckUtils]: 2: Hoare triple {3032#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {3032#true} is VALID [2022-02-20 23:58:01,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {3032#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; {3032#true} is VALID [2022-02-20 23:58:01,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {3032#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3032#true} is VALID [2022-02-20 23:58:01,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {3032#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {3032#true} is VALID [2022-02-20 23:58:01,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {3032#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {3032#true} is VALID [2022-02-20 23:58:01,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {3032#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {3032#true} is VALID [2022-02-20 23:58:01,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {3032#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3032#true} is VALID [2022-02-20 23:58:01,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {3032#true} assume true; {3032#true} is VALID [2022-02-20 23:58:01,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3032#true} {3032#true} #274#return; {3032#true} is VALID [2022-02-20 23:58:01,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {3032#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; {3032#true} is VALID [2022-02-20 23:58:01,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {3032#true} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {3032#true} is VALID [2022-02-20 23:58:01,581 INFO L272 TraceCheckUtils]: 13: Hoare triple {3032#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {3032#true} is VALID [2022-02-20 23:58:01,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {3032#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; {3079#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:01,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {3079#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3079#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:01,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {3079#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {3079#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:01,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {3079#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {3079#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:01,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {3079#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {3079#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:01,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {3079#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3095#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:01,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {3095#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)))} assume true; {3095#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:01,587 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3095#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)))} {3032#true} #276#return; {3102#(and (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:01,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {3102#(and (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (_ bv12 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; {3106#(and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:01,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {3106#(and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, dll_circular_create_~new_head~0#1.offset), #length[dll_circular_create_~new_head~0#1.base]) && ~bvule32(dll_circular_create_~new_head~0#1.offset, ~bvadd32(4bv32, dll_circular_create_~new_head~0#1.offset))) && ~bvule32(0bv32, dll_circular_create_~new_head~0#1.offset)); {3033#false} is VALID [2022-02-20 23:58:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:01,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:01,588 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:01,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632484371] [2022-02-20 23:58:01,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632484371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:01,589 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:01,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:58:01,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133763640] [2022-02-20 23:58:01,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:01,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 23:58:01,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:01,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:01,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:01,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:58:01,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:01,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:58:01,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:58:01,616 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:03,650 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:58:03,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:58:03,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 23:58:03,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2022-02-20 23:58:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2022-02-20 23:58:03,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 180 transitions. [2022-02-20 23:58:03,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:03,917 INFO L225 Difference]: With dead ends: 165 [2022-02-20 23:58:03,917 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 23:58:03,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:03,918 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 19 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:03,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 538 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 23:58:03,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 23:58:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2022-02-20 23:58:03,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:03,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 164 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 159 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:03,926 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 164 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 159 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:03,926 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 164 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 159 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:03,929 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:58:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2022-02-20 23:58:03,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:03,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:03,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 159 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 165 states. [2022-02-20 23:58:03,931 INFO L87 Difference]: Start difference. First operand has 164 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 159 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 165 states. [2022-02-20 23:58:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:03,935 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:58:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2022-02-20 23:58:03,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:03,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:03,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:03,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 159 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2022-02-20 23:58:03,944 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 24 [2022-02-20 23:58:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:03,944 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2022-02-20 23:58:03,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2022-02-20 23:58:03,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:58:03,946 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:03,947 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:03,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-02-20 23:58:04,156 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 23:58:04,158 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:58:04,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:04,159 INFO L85 PathProgramCache]: Analyzing trace with hash 288330017, now seen corresponding path program 1 times [2022-02-20 23:58:04,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:04,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136074457] [2022-02-20 23:58:04,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:04,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:04,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:04,160 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 23:58:04,162 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 23:58:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:04,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:58:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:04,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:04,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:58:04,568 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:58:04,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-20 23:58:04,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {3770#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(23bv32, 2bv32); {3770#true} is VALID [2022-02-20 23:58:04,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {3770#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {3770#true} is VALID [2022-02-20 23:58:04,593 INFO L272 TraceCheckUtils]: 2: Hoare triple {3770#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {3770#true} is VALID [2022-02-20 23:58:04,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {3770#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; {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3800#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {3800#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} assume true; {3800#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,597 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3800#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} {3770#true} #274#return; {3807#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {3807#(= (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; {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,598 INFO L272 TraceCheckUtils]: 13: Hoare triple {3811#(= (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); {3818#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:58:04,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {3818#(= |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; {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_168 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_168) |#valid|))))} is VALID [2022-02-20 23:58:04,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_168 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_168) |#valid|))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_168 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_168) |#valid|))))} is VALID [2022-02-20 23:58:04,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_168 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_168) |#valid|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_168 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_168) |#valid|))))} is VALID [2022-02-20 23:58:04,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_168 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_168) |#valid|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_168 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_168) |#valid|))))} is VALID [2022-02-20 23:58:04,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_168 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_168) |#valid|))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_168 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_168) |#valid|))))} is VALID [2022-02-20 23:58:04,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_168 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_168) |#valid|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_168 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_168) |#valid|))))} is VALID [2022-02-20 23:58:04,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_168 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_168) |#valid|))))} assume true; {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_168 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_168) |#valid|))))} is VALID [2022-02-20 23:58:04,611 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3822#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_168 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_168) |#valid|))))} {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} #276#return; {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 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; {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} SUMMARY for 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); srcloc: L590 {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32; {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[dll_circular_create_~head~0#1.base]); {3771#false} is VALID [2022-02-20 23:58:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:04,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:04,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[dll_circular_create_~head~0#1.base]); {3771#false} is VALID [2022-02-20 23:58:04,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32; {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} SUMMARY for 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); srcloc: L590 {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 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; {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,930 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} #276#return; {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume true; {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:58:04,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:58:04,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:58:04,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:58:04,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:58:04,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:58:04,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} ~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; {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:58:04,937 INFO L272 TraceCheckUtils]: 13: Hoare triple {3811#(= (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); {3871#(forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:58:04,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {3807#(= (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; {3811#(= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,939 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3800#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} {3770#true} #274#return; {3807#(= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {3800#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} assume true; {3800#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3800#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {3770#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; {3784#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,945 INFO L272 TraceCheckUtils]: 2: Hoare triple {3770#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {3770#true} is VALID [2022-02-20 23:58:04,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {3770#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {3770#true} is VALID [2022-02-20 23:58:04,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {3770#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(23bv32, 2bv32); {3770#true} is VALID [2022-02-20 23:58:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:04,946 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:04,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136074457] [2022-02-20 23:58:04,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136074457] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:04,946 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:58:04,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-02-20 23:58:04,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776235166] [2022-02-20 23:58:04,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:04,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-02-20 23:58:04,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:04,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:58:04,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:04,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:58:04,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:04,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:58:04,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:58:04,986 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:58:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:07,342 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2022-02-20 23:58:07,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:58:07,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-02-20 23:58:07,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:58:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2022-02-20 23:58:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:58:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2022-02-20 23:58:07,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 187 transitions. [2022-02-20 23:58:07,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:07,524 INFO L225 Difference]: With dead ends: 171 [2022-02-20 23:58:07,524 INFO L226 Difference]: Without dead ends: 171 [2022-02-20 23:58:07,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:58:07,525 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 5 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:07,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 754 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 418 Invalid, 0 Unknown, 188 Unchecked, 0.6s Time] [2022-02-20 23:58:07,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-20 23:58:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2022-02-20 23:58:07,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:07,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 169 states, 90 states have (on average 1.9666666666666666) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:07,528 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 169 states, 90 states have (on average 1.9666666666666666) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:07,529 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 169 states, 90 states have (on average 1.9666666666666666) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:07,535 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2022-02-20 23:58:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 186 transitions. [2022-02-20 23:58:07,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:07,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:07,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 90 states have (on average 1.9666666666666666) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 171 states. [2022-02-20 23:58:07,537 INFO L87 Difference]: Start difference. First operand has 169 states, 90 states have (on average 1.9666666666666666) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 171 states. [2022-02-20 23:58:07,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:07,541 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2022-02-20 23:58:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 186 transitions. [2022-02-20 23:58:07,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:07,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:07,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:07,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 90 states have (on average 1.9666666666666666) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:07,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 185 transitions. [2022-02-20 23:58:07,546 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 185 transitions. Word has length 26 [2022-02-20 23:58:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:07,546 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 185 transitions. [2022-02-20 23:58:07,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:58:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 185 transitions. [2022-02-20 23:58:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:58:07,547 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:07,547 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:07,555 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 23:58:07,751 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 23:58:07,752 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:58:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:07,752 INFO L85 PathProgramCache]: Analyzing trace with hash 288330018, now seen corresponding path program 1 times [2022-02-20 23:58:07,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:07,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013478944] [2022-02-20 23:58:07,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:07,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:07,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:07,754 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 23:58:07,755 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 23:58:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:07,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:58:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:07,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:07,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:58:07,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:58:08,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:08,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:08,219 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:58:08,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:58:08,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {4617#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(23bv32, 2bv32); {4617#true} is VALID [2022-02-20 23:58:08,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {4617#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {4617#true} is VALID [2022-02-20 23:58:08,254 INFO L272 TraceCheckUtils]: 2: Hoare triple {4617#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {4617#true} is VALID [2022-02-20 23:58:08,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {4617#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; {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:08,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:08,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:08,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:08,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:08,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4647#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:08,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {4647#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {4647#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:08,259 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4647#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {4617#true} #274#return; {4654#(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)) (= (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:08,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {4654#(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)) (= (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (_ bv12 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; {4658#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:08,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {4658#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {4658#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:08,260 INFO L272 TraceCheckUtils]: 13: Hoare triple {4658#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {4665#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:58:08,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~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; {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} is VALID [2022-02-20 23:58:08,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} is VALID [2022-02-20 23:58:08,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} is VALID [2022-02-20 23:58:08,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} is VALID [2022-02-20 23:58:08,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} is VALID [2022-02-20 23:58:08,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} is VALID [2022-02-20 23:58:08,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} assume true; {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} is VALID [2022-02-20 23:58:08,282 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} {4658#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} #276#return; {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:08,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 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; {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:08,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} SUMMARY for 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); srcloc: L590 {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:08,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32; {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:08,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset)), #length[dll_circular_create_~head~0#1.base]) && ~bvule32(~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset))); {4618#false} is VALID [2022-02-20 23:58:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:08,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:12,625 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:12,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013478944] [2022-02-20 23:58:12,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013478944] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:12,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [721014405] [2022-02-20 23:58:12,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:12,626 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:58:12,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:58:12,627 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:58:12,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-02-20 23:58:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:12,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:58:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:12,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:12,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:58:12,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:58:13,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:13,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:13,099 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:58:13,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:58:13,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {4617#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(23bv32, 2bv32); {4617#true} is VALID [2022-02-20 23:58:13,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {4617#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {4617#true} is VALID [2022-02-20 23:58:13,127 INFO L272 TraceCheckUtils]: 2: Hoare triple {4617#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {4617#true} is VALID [2022-02-20 23:58:13,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {4617#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; {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:13,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:13,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:13,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:13,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:13,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {4631#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4647#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:13,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {4647#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {4647#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:13,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4647#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {4617#true} #274#return; {4654#(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)) (= (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:13,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {4654#(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)) (= (select |#length| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (_ bv12 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; {4658#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:13,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {4658#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {4658#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:13,134 INFO L272 TraceCheckUtils]: 13: Hoare triple {4658#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {4665#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:58:13,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~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; {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} is VALID [2022-02-20 23:58:13,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} is VALID [2022-02-20 23:58:13,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} is VALID [2022-02-20 23:58:13,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} is VALID [2022-02-20 23:58:13,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} is VALID [2022-02-20 23:58:13,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} is VALID [2022-02-20 23:58:13,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} assume true; {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} is VALID [2022-02-20 23:58:13,144 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4669#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_223 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_223)))))} {4658#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} #276#return; {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:13,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 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; {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:13,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} SUMMARY for 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); srcloc: L590 {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:13,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32; {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:13,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {4691#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset)), #length[dll_circular_create_~head~0#1.base]) && ~bvule32(~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset))); {4618#false} is VALID [2022-02-20 23:58:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:13,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:15,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [721014405] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:15,383 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:58:15,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-02-20 23:58:15,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562457825] [2022-02-20 23:58:15,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:15,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-02-20 23:58:15,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:15,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:15,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:15,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:58:15,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:15,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:58:15,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=85, Unknown=2, NotChecked=0, Total=110 [2022-02-20 23:58:15,431 INFO L87 Difference]: Start difference. First operand 169 states and 185 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:19,025 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2022-02-20 23:58:19,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:58:19,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-02-20 23:58:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2022-02-20 23:58:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2022-02-20 23:58:19,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 187 transitions. [2022-02-20 23:58:19,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:19,223 INFO L225 Difference]: With dead ends: 171 [2022-02-20 23:58:19,224 INFO L226 Difference]: Without dead ends: 171 [2022-02-20 23:58:19,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=31, Invalid=123, Unknown=2, NotChecked=0, Total=156 [2022-02-20 23:58:19,224 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 2 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:19,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 622 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 649 Invalid, 0 Unknown, 102 Unchecked, 1.2s Time] [2022-02-20 23:58:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-20 23:58:19,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2022-02-20 23:58:19,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:19,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 169 states, 90 states have (on average 1.9555555555555555) internal successors, (176), 163 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:19,227 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 169 states, 90 states have (on average 1.9555555555555555) internal successors, (176), 163 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:19,227 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 169 states, 90 states have (on average 1.9555555555555555) internal successors, (176), 163 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:19,230 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2022-02-20 23:58:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 186 transitions. [2022-02-20 23:58:19,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:19,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:19,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 90 states have (on average 1.9555555555555555) internal successors, (176), 163 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 171 states. [2022-02-20 23:58:19,255 INFO L87 Difference]: Start difference. First operand has 169 states, 90 states have (on average 1.9555555555555555) internal successors, (176), 163 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 171 states. [2022-02-20 23:58:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:19,265 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2022-02-20 23:58:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 186 transitions. [2022-02-20 23:58:19,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:19,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:19,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:19,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 90 states have (on average 1.9555555555555555) internal successors, (176), 163 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 184 transitions. [2022-02-20 23:58:19,276 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 184 transitions. Word has length 26 [2022-02-20 23:58:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:19,276 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 184 transitions. [2022-02-20 23:58:19,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 184 transitions. [2022-02-20 23:58:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:58:19,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:19,277 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:19,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-02-20 23:58:19,490 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 23:58:19,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:19,684 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:58:19,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:19,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2087573769, now seen corresponding path program 1 times [2022-02-20 23:58:19,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:19,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135561385] [2022-02-20 23:58:19,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:19,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:19,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:19,686 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 23:58:19,688 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 23:58:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:19,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:58:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:19,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:19,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {5496#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(23bv32, 2bv32); {5496#true} is VALID [2022-02-20 23:58:19,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {5496#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {5496#true} is VALID [2022-02-20 23:58:19,901 INFO L272 TraceCheckUtils]: 2: Hoare triple {5496#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {5496#true} is VALID [2022-02-20 23:58:19,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {5496#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; {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:19,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:19,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:19,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:19,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:19,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5526#(not (= |node_create_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:19,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {5526#(not (= |node_create_#res#1.base| (_ bv0 32)))} assume true; {5526#(not (= |node_create_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:19,905 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5526#(not (= |node_create_#res#1.base| (_ bv0 32)))} {5496#true} #274#return; {5533#(not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:19,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {5533#(not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| (_ bv0 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; {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:19,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:19,906 INFO L272 TraceCheckUtils]: 13: Hoare triple {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {5496#true} is VALID [2022-02-20 23:58:19,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {5496#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; {5496#true} is VALID [2022-02-20 23:58:19,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {5496#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5496#true} is VALID [2022-02-20 23:58:19,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {5496#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {5496#true} is VALID [2022-02-20 23:58:19,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {5496#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {5496#true} is VALID [2022-02-20 23:58:19,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {5496#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {5496#true} is VALID [2022-02-20 23:58:19,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {5496#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5496#true} is VALID [2022-02-20 23:58:19,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {5496#true} assume true; {5496#true} is VALID [2022-02-20 23:58:19,908 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5496#true} {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} #276#return; {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:19,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 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; {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:19,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} SUMMARY for 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); srcloc: L590 {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:19,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} assume !(dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32); {5497#false} is VALID [2022-02-20 23:58:19,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {5497#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; {5497#false} is VALID [2022-02-20 23:58:19,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {5497#false} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {5497#false} is VALID [2022-02-20 23:58:19,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {5497#false} assume !(1bv1 == #valid[dll_circular_create_~last~0#1.base]); {5497#false} is VALID [2022-02-20 23:58:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:19,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:20,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {5497#false} assume !(1bv1 == #valid[dll_circular_create_~last~0#1.base]); {5497#false} is VALID [2022-02-20 23:58:20,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {5497#false} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {5497#false} is VALID [2022-02-20 23:58:20,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {5497#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; {5497#false} is VALID [2022-02-20 23:58:20,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} assume !(dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32); {5497#false} is VALID [2022-02-20 23:58:20,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} SUMMARY for 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); srcloc: L590 {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:20,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 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; {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:20,017 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5496#true} {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} #276#return; {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:20,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {5496#true} assume true; {5496#true} is VALID [2022-02-20 23:58:20,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {5496#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5496#true} is VALID [2022-02-20 23:58:20,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {5496#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {5496#true} is VALID [2022-02-20 23:58:20,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {5496#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {5496#true} is VALID [2022-02-20 23:58:20,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {5496#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {5496#true} is VALID [2022-02-20 23:58:20,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {5496#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5496#true} is VALID [2022-02-20 23:58:20,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {5496#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; {5496#true} is VALID [2022-02-20 23:58:20,018 INFO L272 TraceCheckUtils]: 13: Hoare triple {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {5496#true} is VALID [2022-02-20 23:58:20,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:20,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {5533#(not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| (_ bv0 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; {5537#(not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:20,020 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5526#(not (= |node_create_#res#1.base| (_ bv0 32)))} {5496#true} #274#return; {5533#(not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:20,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {5526#(not (= |node_create_#res#1.base| (_ bv0 32)))} assume true; {5526#(not (= |node_create_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:20,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5526#(not (= |node_create_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:20,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:20,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:20,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:20,022 INFO L290 TraceCheckUtils]: 4: Hoare triple {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:20,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {5496#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; {5510#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:20,023 INFO L272 TraceCheckUtils]: 2: Hoare triple {5496#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {5496#true} is VALID [2022-02-20 23:58:20,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {5496#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {5496#true} is VALID [2022-02-20 23:58:20,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {5496#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(23bv32, 2bv32); {5496#true} is VALID [2022-02-20 23:58:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:20,024 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:20,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135561385] [2022-02-20 23:58:20,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135561385] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:20,024 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:58:20,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-02-20 23:58:20,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443874665] [2022-02-20 23:58:20,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:20,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-02-20 23:58:20,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:20,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:20,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:20,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:58:20,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:20,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:58:20,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:58:20,057 INFO L87 Difference]: Start difference. First operand 169 states and 184 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:21,472 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2022-02-20 23:58:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:58:21,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-02-20 23:58:21,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2022-02-20 23:58:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2022-02-20 23:58:21,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 185 transitions. [2022-02-20 23:58:21,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:21,654 INFO L225 Difference]: With dead ends: 170 [2022-02-20 23:58:21,654 INFO L226 Difference]: Without dead ends: 170 [2022-02-20 23:58:21,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:21,655 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 4 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:21,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 824 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-02-20 23:58:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2022-02-20 23:58:21,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:21,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 169 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:21,658 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 169 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:21,658 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 169 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:21,661 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2022-02-20 23:58:21,661 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2022-02-20 23:58:21,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:21,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:21,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 170 states. [2022-02-20 23:58:21,663 INFO L87 Difference]: Start difference. First operand has 169 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 170 states. [2022-02-20 23:58:21,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:21,665 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2022-02-20 23:58:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2022-02-20 23:58:21,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:21,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:21,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:21,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2022-02-20 23:58:21,668 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 28 [2022-02-20 23:58:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:21,668 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2022-02-20 23:58:21,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2022-02-20 23:58:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:58:21,669 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:21,669 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:21,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-02-20 23:58:21,876 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 23:58:21,876 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:58:21,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:21,877 INFO L85 PathProgramCache]: Analyzing trace with hash -295058062, now seen corresponding path program 1 times [2022-02-20 23:58:21,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:21,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535669058] [2022-02-20 23:58:21,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:21,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:21,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:21,879 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 23:58:21,915 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 23:58:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:21,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:58:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:21,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:22,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {6347#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(23bv32, 2bv32); {6347#true} is VALID [2022-02-20 23:58:22,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {6347#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {6347#true} is VALID [2022-02-20 23:58:22,065 INFO L272 TraceCheckUtils]: 2: Hoare triple {6347#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {6347#true} is VALID [2022-02-20 23:58:22,065 INFO L290 TraceCheckUtils]: 3: Hoare triple {6347#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; {6347#true} is VALID [2022-02-20 23:58:22,066 INFO L290 TraceCheckUtils]: 4: Hoare triple {6347#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6347#true} is VALID [2022-02-20 23:58:22,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {6347#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {6347#true} is VALID [2022-02-20 23:58:22,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {6347#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {6347#true} is VALID [2022-02-20 23:58:22,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {6347#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {6347#true} is VALID [2022-02-20 23:58:22,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {6347#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6347#true} is VALID [2022-02-20 23:58:22,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {6347#true} assume true; {6347#true} is VALID [2022-02-20 23:58:22,076 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6347#true} {6347#true} #274#return; {6347#true} is VALID [2022-02-20 23:58:22,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {6347#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; {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} is VALID [2022-02-20 23:58:22,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} is VALID [2022-02-20 23:58:22,078 INFO L272 TraceCheckUtils]: 13: Hoare triple {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~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); {6347#true} is VALID [2022-02-20 23:58:22,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {6347#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; {6347#true} is VALID [2022-02-20 23:58:22,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {6347#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6347#true} is VALID [2022-02-20 23:58:22,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {6347#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {6347#true} is VALID [2022-02-20 23:58:22,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {6347#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {6347#true} is VALID [2022-02-20 23:58:22,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {6347#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {6347#true} is VALID [2022-02-20 23:58:22,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {6347#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6347#true} is VALID [2022-02-20 23:58:22,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {6347#true} assume true; {6347#true} is VALID [2022-02-20 23:58:22,082 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6347#true} {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} #276#return; {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} is VALID [2022-02-20 23:58:22,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#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; {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} is VALID [2022-02-20 23:58:22,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} SUMMARY for 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); srcloc: L590 {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} is VALID [2022-02-20 23:58:22,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |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; {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} is VALID [2022-02-20 23:58:22,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} SUMMARY for 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); srcloc: L592 {6428#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:58:22,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {6428#(= (_ bv1 1) (select |#valid| |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; {6428#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:58:22,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {6428#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {6428#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:58:22,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {6428#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} assume !(1bv1 == #valid[dll_circular_create_~last~0#1.base]); {6348#false} is VALID [2022-02-20 23:58:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:58:22,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:22,113 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:58:22,114 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 11 [2022-02-20 23:58:22,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {6428#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} assume !(1bv1 == #valid[dll_circular_create_~last~0#1.base]); {6348#false} is VALID [2022-02-20 23:58:22,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {6428#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {6428#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:58:22,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {6428#(= (_ bv1 1) (select |#valid| |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; {6428#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:58:22,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} SUMMARY for 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); srcloc: L592 {6428#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:58:22,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |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; {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} is VALID [2022-02-20 23:58:22,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} SUMMARY for 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); srcloc: L590 {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} is VALID [2022-02-20 23:58:22,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#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; {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} is VALID [2022-02-20 23:58:22,182 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6347#true} {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} #276#return; {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} is VALID [2022-02-20 23:58:22,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {6347#true} assume true; {6347#true} is VALID [2022-02-20 23:58:22,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {6347#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6347#true} is VALID [2022-02-20 23:58:22,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {6347#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {6347#true} is VALID [2022-02-20 23:58:22,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {6347#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {6347#true} is VALID [2022-02-20 23:58:22,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {6347#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {6347#true} is VALID [2022-02-20 23:58:22,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {6347#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6347#true} is VALID [2022-02-20 23:58:22,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {6347#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; {6347#true} is VALID [2022-02-20 23:58:22,184 INFO L272 TraceCheckUtils]: 13: Hoare triple {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~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); {6347#true} is VALID [2022-02-20 23:58:22,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} is VALID [2022-02-20 23:58:22,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {6347#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; {6385#(= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)} is VALID [2022-02-20 23:58:22,185 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6347#true} {6347#true} #274#return; {6347#true} is VALID [2022-02-20 23:58:22,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {6347#true} assume true; {6347#true} is VALID [2022-02-20 23:58:22,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {6347#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6347#true} is VALID [2022-02-20 23:58:22,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {6347#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {6347#true} is VALID [2022-02-20 23:58:22,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {6347#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {6347#true} is VALID [2022-02-20 23:58:22,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {6347#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {6347#true} is VALID [2022-02-20 23:58:22,186 INFO L290 TraceCheckUtils]: 4: Hoare triple {6347#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6347#true} is VALID [2022-02-20 23:58:22,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {6347#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; {6347#true} is VALID [2022-02-20 23:58:22,186 INFO L272 TraceCheckUtils]: 2: Hoare triple {6347#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {6347#true} is VALID [2022-02-20 23:58:22,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {6347#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {6347#true} is VALID [2022-02-20 23:58:22,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {6347#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(23bv32, 2bv32); {6347#true} is VALID [2022-02-20 23:58:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:58:22,188 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:22,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535669058] [2022-02-20 23:58:22,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535669058] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:22,189 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:58:22,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-02-20 23:58:22,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521297008] [2022-02-20 23:58:22,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:22,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 29 [2022-02-20 23:58:22,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:22,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 23:58:22,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:22,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:58:22,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:22,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:58:22,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:58:22,221 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 23:58:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:23,192 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2022-02-20 23:58:23,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:58:23,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 29 [2022-02-20 23:58:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 23:58:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2022-02-20 23:58:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 23:58:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2022-02-20 23:58:23,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 191 transitions. [2022-02-20 23:58:23,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:23,331 INFO L225 Difference]: With dead ends: 174 [2022-02-20 23:58:23,331 INFO L226 Difference]: Without dead ends: 174 [2022-02-20 23:58:23,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:58:23,331 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 9 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:23,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 422 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:58:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-20 23:58:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2022-02-20 23:58:23,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:23,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 172 states, 93 states have (on average 1.935483870967742) internal successors, (180), 166 states have internal predecessors, (180), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:23,334 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 172 states, 93 states have (on average 1.935483870967742) internal successors, (180), 166 states have internal predecessors, (180), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:23,334 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 172 states, 93 states have (on average 1.935483870967742) internal successors, (180), 166 states have internal predecessors, (180), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:23,337 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2022-02-20 23:58:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 190 transitions. [2022-02-20 23:58:23,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:23,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:23,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 93 states have (on average 1.935483870967742) internal successors, (180), 166 states have internal predecessors, (180), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 174 states. [2022-02-20 23:58:23,338 INFO L87 Difference]: Start difference. First operand has 172 states, 93 states have (on average 1.935483870967742) internal successors, (180), 166 states have internal predecessors, (180), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 174 states. [2022-02-20 23:58:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:23,340 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2022-02-20 23:58:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 190 transitions. [2022-02-20 23:58:23,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:23,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:23,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:23,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 93 states have (on average 1.935483870967742) internal successors, (180), 166 states have internal predecessors, (180), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:58:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 188 transitions. [2022-02-20 23:58:23,359 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 188 transitions. Word has length 29 [2022-02-20 23:58:23,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:23,359 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 188 transitions. [2022-02-20 23:58:23,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 23:58:23,360 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 188 transitions. [2022-02-20 23:58:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:58:23,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:23,360 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:23,378 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 23:58:23,567 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 23:58:23,567 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 78 more)] === [2022-02-20 23:58:23,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:23,568 INFO L85 PathProgramCache]: Analyzing trace with hash -295058061, now seen corresponding path program 1 times [2022-02-20 23:58:23,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:23,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621748709] [2022-02-20 23:58:23,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:23,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:23,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:23,584 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 23:58:23,585 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 23:58:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:23,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:58:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:23,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:23,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {7217#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(23bv32, 2bv32); {7217#true} is VALID [2022-02-20 23:58:23,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {7217#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {7217#true} is VALID [2022-02-20 23:58:23,877 INFO L272 TraceCheckUtils]: 2: Hoare triple {7217#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {7217#true} is VALID [2022-02-20 23:58:23,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {7217#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; {7231#(= |node_create_~temp~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:23,878 INFO L290 TraceCheckUtils]: 4: Hoare triple {7231#(= |node_create_~temp~0#1.offset| (_ bv0 32))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {7231#(= |node_create_~temp~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:23,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {7231#(= |node_create_~temp~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {7231#(= |node_create_~temp~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:23,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {7231#(= |node_create_~temp~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {7231#(= |node_create_~temp~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:23,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {7231#(= |node_create_~temp~0#1.offset| (_ bv0 32))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {7231#(= |node_create_~temp~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:23,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {7231#(= |node_create_~temp~0#1.offset| (_ bv0 32))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7247#(= |node_create_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:23,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {7247#(= |node_create_#res#1.offset| (_ bv0 32))} assume true; {7247#(= |node_create_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:23,881 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7247#(= |node_create_#res#1.offset| (_ bv0 32))} {7217#true} #274#return; {7254#(= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:23,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {7254#(= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| (_ bv0 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; {7258#(and (= |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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:23,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {7258#(and (= |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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {7258#(and (= |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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:23,882 INFO L272 TraceCheckUtils]: 13: Hoare triple {7258#(and (= |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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {7217#true} is VALID [2022-02-20 23:58:23,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {7217#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; {7217#true} is VALID [2022-02-20 23:58:23,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {7217#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {7217#true} is VALID [2022-02-20 23:58:23,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {7217#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {7217#true} is VALID [2022-02-20 23:58:23,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {7217#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {7217#true} is VALID [2022-02-20 23:58:23,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {7217#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {7217#true} is VALID [2022-02-20 23:58:23,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {7217#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7217#true} is VALID [2022-02-20 23:58:23,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {7217#true} assume true; {7217#true} is VALID [2022-02-20 23:58:23,884 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7217#true} {7258#(and (= |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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} #276#return; {7258#(and (= |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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:23,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {7258#(and (= |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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_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~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; {7258#(and (= |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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:23,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {7258#(and (= |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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} SUMMARY for 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); srcloc: L590 {7258#(and (= |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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:23,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {7258#(and (= |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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32; {7258#(and (= |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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} is VALID [2022-02-20 23:58:23,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {7258#(and (= |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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))} SUMMARY for 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); srcloc: L592 {7301#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv0 32)) (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:23,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {7301#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv0 32)) (bvule (_ bv8 32) (select |#length| |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; {7301#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv0 32)) (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:23,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {7301#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv0 32)) (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {7301#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv0 32)) (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:23,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {7301#(and (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv0 32)) (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, dll_circular_create_~last~0#1.offset), #length[dll_circular_create_~last~0#1.base]) && ~bvule32(dll_circular_create_~last~0#1.offset, ~bvadd32(4bv32, dll_circular_create_~last~0#1.offset))) && ~bvule32(0bv32, dll_circular_create_~last~0#1.offset)); {7218#false} is VALID [2022-02-20 23:58:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:23,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:23,970 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:58:23,971 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 22 treesize of output 26 [2022-02-20 23:58:24,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {7311#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, dll_circular_create_~last~0#1.offset), #length[dll_circular_create_~last~0#1.base]) && ~bvule32(dll_circular_create_~last~0#1.offset, ~bvadd32(4bv32, dll_circular_create_~last~0#1.offset))) && ~bvule32(0bv32, dll_circular_create_~last~0#1.offset)); {7218#false} is VALID [2022-02-20 23:58:24,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {7311#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {7311#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:24,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {7311#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (select |#length| |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; {7311#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:24,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {7321#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))))} SUMMARY for 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); srcloc: L592 {7311#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:58:24,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {7321#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32; {7321#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 23:58:24,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {7321#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))))} SUMMARY for 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); srcloc: L590 {7321#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 23:58:24,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {7321#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 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; {7321#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 23:58:24,431 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7217#true} {7321#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))))} #276#return; {7321#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 23:58:24,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {7217#true} assume true; {7217#true} is VALID [2022-02-20 23:58:24,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {7217#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7217#true} is VALID [2022-02-20 23:58:24,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {7217#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {7217#true} is VALID [2022-02-20 23:58:24,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {7217#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {7217#true} is VALID [2022-02-20 23:58:24,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {7217#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {7217#true} is VALID [2022-02-20 23:58:24,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {7217#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {7217#true} is VALID [2022-02-20 23:58:24,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {7217#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; {7217#true} is VALID [2022-02-20 23:58:24,432 INFO L272 TraceCheckUtils]: 13: Hoare triple {7321#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {7217#true} is VALID [2022-02-20 23:58:24,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {7321#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {7321#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 23:58:24,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {7364#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset|)) (bvule |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset|)))} 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; {7321#(and (bvule |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvule (bvadd |ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 23:58:24,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7371#(and (bvule |node_create_#res#1.offset| (bvadd (_ bv4 32) |node_create_#res#1.offset|)) (bvule (bvadd (_ bv4 32) |node_create_#res#1.offset|) (bvadd |node_create_#res#1.offset| (_ bv8 32))))} {7217#true} #274#return; {7364#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset|)) (bvule |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset|)))} is VALID [2022-02-20 23:58:24,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {7371#(and (bvule |node_create_#res#1.offset| (bvadd (_ bv4 32) |node_create_#res#1.offset|)) (bvule (bvadd (_ bv4 32) |node_create_#res#1.offset|) (bvadd |node_create_#res#1.offset| (_ bv8 32))))} assume true; {7371#(and (bvule |node_create_#res#1.offset| (bvadd (_ bv4 32) |node_create_#res#1.offset|)) (bvule (bvadd (_ bv4 32) |node_create_#res#1.offset|) (bvadd |node_create_#res#1.offset| (_ bv8 32))))} is VALID [2022-02-20 23:58:24,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {7378#(and (bvule (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (bvadd |node_create_~temp~0#1.offset| (_ bv8 32))) (bvule |node_create_~temp~0#1.offset| (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7371#(and (bvule |node_create_#res#1.offset| (bvadd (_ bv4 32) |node_create_#res#1.offset|)) (bvule (bvadd (_ bv4 32) |node_create_#res#1.offset|) (bvadd |node_create_#res#1.offset| (_ bv8 32))))} is VALID [2022-02-20 23:58:24,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {7378#(and (bvule (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (bvadd |node_create_~temp~0#1.offset| (_ bv8 32))) (bvule |node_create_~temp~0#1.offset| (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L581 {7378#(and (bvule (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (bvadd |node_create_~temp~0#1.offset| (_ bv8 32))) (bvule |node_create_~temp~0#1.offset| (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)))} is VALID [2022-02-20 23:58:24,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {7378#(and (bvule (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (bvadd |node_create_~temp~0#1.offset| (_ bv8 32))) (bvule |node_create_~temp~0#1.offset| (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {7378#(and (bvule (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (bvadd |node_create_~temp~0#1.offset| (_ bv8 32))) (bvule |node_create_~temp~0#1.offset| (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)))} is VALID [2022-02-20 23:58:24,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {7378#(and (bvule (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (bvadd |node_create_~temp~0#1.offset| (_ bv8 32))) (bvule |node_create_~temp~0#1.offset| (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L577-1 {7378#(and (bvule (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (bvadd |node_create_~temp~0#1.offset| (_ bv8 32))) (bvule |node_create_~temp~0#1.offset| (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)))} is VALID [2022-02-20 23:58:24,449 INFO L290 TraceCheckUtils]: 4: Hoare triple {7378#(and (bvule (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (bvadd |node_create_~temp~0#1.offset| (_ bv8 32))) (bvule |node_create_~temp~0#1.offset| (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {7378#(and (bvule (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (bvadd |node_create_~temp~0#1.offset| (_ bv8 32))) (bvule |node_create_~temp~0#1.offset| (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)))} is VALID [2022-02-20 23:58:24,449 INFO L290 TraceCheckUtils]: 3: Hoare triple {7217#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; {7378#(and (bvule (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (bvadd |node_create_~temp~0#1.offset| (_ bv8 32))) (bvule |node_create_~temp~0#1.offset| (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)))} is VALID [2022-02-20 23:58:24,450 INFO L272 TraceCheckUtils]: 2: Hoare triple {7217#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {7217#true} is VALID [2022-02-20 23:58:24,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {7217#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);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; {7217#true} is VALID [2022-02-20 23:58:24,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {7217#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(23bv32, 2bv32); {7217#true} is VALID [2022-02-20 23:58:24,450 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:24,450 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:24,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621748709] [2022-02-20 23:58:24,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621748709] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:24,450 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:58:24,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-02-20 23:58:24,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250957941] [2022-02-20 23:58:24,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:24,451 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-02-20 23:58:24,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:24,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:24,538 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 23:58:24,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:58:24,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:24,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:58:24,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:58:24,539 INFO L87 Difference]: Start difference. First operand 172 states and 188 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)