./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:59:23,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:59:23,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:59:23,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:59:23,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:59:23,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:59:23,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:59:23,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:59:23,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:59:23,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:59:23,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:59:23,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:59:23,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:59:23,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:59:23,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:59:23,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:59:23,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:59:23,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:59:23,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:59:23,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:59:23,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:59:23,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:59:23,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:59:23,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:59:23,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:59:23,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:59:23,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:59:23,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:59:23,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:59:23,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:59:23,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:59:23,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:59:23,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:59:23,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:59:23,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:59:23,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:59:23,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:59:23,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:59:23,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:59:23,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:59:23,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:59:23,149 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:59:23,179 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:59:23,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:59:23,180 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:59:23,180 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:59:23,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:59:23,181 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:59:23,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:59:23,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:59:23,182 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:59:23,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:59:23,183 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:59:23,183 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:59:23,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:59:23,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:59:23,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:59:23,184 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:59:23,184 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:59:23,184 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:59:23,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:59:23,184 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:59:23,185 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:59:23,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:59:23,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:59:23,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:59:23,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:59:23,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:59:23,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:59:23,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:59:23,187 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:59:23,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:59:23,187 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2022-02-20 23:59:23,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:59:23,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:59:23,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:59:23,446 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:59:23,447 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:59:23,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-02-20 23:59:23,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa42365e5/af67abbb0fa445e1b3912c499e48e23d/FLAG0dcf4059e [2022-02-20 23:59:23,942 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:59:23,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-02-20 23:59:23,953 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa42365e5/af67abbb0fa445e1b3912c499e48e23d/FLAG0dcf4059e [2022-02-20 23:59:23,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa42365e5/af67abbb0fa445e1b3912c499e48e23d [2022-02-20 23:59:23,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:59:23,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:59:23,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:59:23,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:59:23,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:59:23,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:59:23" (1/1) ... [2022-02-20 23:59:23,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cec764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:23, skipping insertion in model container [2022-02-20 23:59:23,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:59:23" (1/1) ... [2022-02-20 23:59:23,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:59:24,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:59:24,269 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/sll2c_update_all_reverse.i[24436,24449] [2022-02-20 23:59:24,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:59:24,290 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:59:24,358 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/sll2c_update_all_reverse.i[24436,24449] [2022-02-20 23:59:24,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:59:24,400 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:59:24,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:24 WrapperNode [2022-02-20 23:59:24,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:59:24,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:59:24,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:59:24,404 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:59:24,410 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:59:24" (1/1) ... [2022-02-20 23:59:24,438 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:59:24" (1/1) ... [2022-02-20 23:59:24,464 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2022-02-20 23:59:24,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:59:24,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:59:24,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:59:24,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:59:24,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:24" (1/1) ... [2022-02-20 23:59:24,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:24" (1/1) ... [2022-02-20 23:59:24,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:24" (1/1) ... [2022-02-20 23:59:24,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:24" (1/1) ... [2022-02-20 23:59:24,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:24" (1/1) ... [2022-02-20 23:59:24,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:24" (1/1) ... [2022-02-20 23:59:24,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:24" (1/1) ... [2022-02-20 23:59:24,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:59:24,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:59:24,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:59:24,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:59:24,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:24" (1/1) ... [2022-02-20 23:59:24,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:59:24,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:24,546 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:59:24,559 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:59:24,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:59:24,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:59:24,585 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 23:59:24,585 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 23:59:24,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:59:24,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:59:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:59:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:59:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:59:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:59:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:59:24,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:59:24,674 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:59:24,676 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:59:24,997 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:59:25,004 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:59:25,004 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 23:59:25,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:59:25 BoogieIcfgContainer [2022-02-20 23:59:25,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:59:25,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:59:25,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:59:25,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:59:25,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:59:23" (1/3) ... [2022-02-20 23:59:25,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b4ba16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:59:25, skipping insertion in model container [2022-02-20 23:59:25,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:24" (2/3) ... [2022-02-20 23:59:25,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b4ba16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:59:25, skipping insertion in model container [2022-02-20 23:59:25,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:59:25" (3/3) ... [2022-02-20 23:59:25,013 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-02-20 23:59:25,017 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:59:25,017 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-02-20 23:59:25,046 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:59:25,051 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:59:25,051 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-02-20 23:59:25,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 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:59:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:59:25,075 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:25,076 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:59:25,076 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:25,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2022-02-20 23:59:25,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:25,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190220123] [2022-02-20 23:59:25,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:25,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:25,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {86#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {86#true} is VALID [2022-02-20 23:59:25,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {86#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {86#true} is VALID [2022-02-20 23:59:25,296 INFO L272 TraceCheckUtils]: 2: Hoare triple {86#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {86#true} is VALID [2022-02-20 23:59:25,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {86#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {88#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:25,300 INFO L290 TraceCheckUtils]: 4: Hoare triple {88#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {88#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:25,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {88#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(1 == #valid[~temp~0#1.base]); {87#false} is VALID [2022-02-20 23:59:25,303 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:59:25,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:25,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190220123] [2022-02-20 23:59:25,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190220123] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:25,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:25,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:59:25,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901965086] [2022-02-20 23:59:25,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:25,311 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:59:25,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:25,323 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:59:25,333 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:59:25,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:59:25,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:25,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:59:25,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:25,362 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 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:59:25,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:25,552 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-02-20 23:59:25,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:59:25,552 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:59:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:25,554 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:59:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-20 23:59:25,561 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:59:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-20 23:59:25,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2022-02-20 23:59:25,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:25,662 INFO L225 Difference]: With dead ends: 81 [2022-02-20 23:59:25,662 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 23:59:25,664 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:59:25,666 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:25,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 23:59:25,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-20 23:59:25,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:25,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 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:59:25,696 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 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:59:25,696 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 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:59:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:25,702 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2022-02-20 23:59:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-02-20 23:59:25,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:25,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:25,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 78 states. [2022-02-20 23:59:25,704 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 78 states. [2022-02-20 23:59:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:25,709 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2022-02-20 23:59:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-02-20 23:59:25,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:25,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:25,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:25,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 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:59:25,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-02-20 23:59:25,715 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2022-02-20 23:59:25,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:25,716 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-02-20 23:59:25,716 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:59:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-02-20 23:59:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:59:25,717 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:25,717 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:59:25,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:59:25,717 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:25,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:25,718 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2022-02-20 23:59:25,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:25,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404282271] [2022-02-20 23:59:25,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:25,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:25,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {406#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {406#true} is VALID [2022-02-20 23:59:25,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {406#true} is VALID [2022-02-20 23:59:25,789 INFO L272 TraceCheckUtils]: 2: Hoare triple {406#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {406#true} is VALID [2022-02-20 23:59:25,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {406#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {408#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:59:25,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {408#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {408#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:59:25,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {408#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} assume !(4 + ~temp~0#1.offset <= #length[~temp~0#1.base] && 0 <= ~temp~0#1.offset); {407#false} is VALID [2022-02-20 23:59:25,798 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:59:25,798 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:25,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404282271] [2022-02-20 23:59:25,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404282271] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:25,799 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:25,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:59:25,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305208509] [2022-02-20 23:59:25,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:25,801 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:59:25,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:25,801 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:59:25,809 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:59:25,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:59:25,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:25,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:59:25,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:25,811 INFO L87 Difference]: Start difference. First operand 78 states and 85 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:59:25,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:25,959 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-02-20 23:59:25,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:59:25,959 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:59:25,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:25,960 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:59:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-02-20 23:59:25,963 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:59:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-02-20 23:59:25,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2022-02-20 23:59:26,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:26,038 INFO L225 Difference]: With dead ends: 76 [2022-02-20 23:59:26,038 INFO L226 Difference]: Without dead ends: 76 [2022-02-20 23:59:26,038 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:59:26,039 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:26,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-20 23:59:26,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-02-20 23:59:26,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:26,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 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:59:26,046 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 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:59:26,046 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 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:59:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:26,050 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-02-20 23:59:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-02-20 23:59:26,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:26,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:26,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 76 states. [2022-02-20 23:59:26,052 INFO L87 Difference]: Start difference. First operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 76 states. [2022-02-20 23:59:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:26,055 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-02-20 23:59:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-02-20 23:59:26,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:26,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:26,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:26,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 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:59:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-02-20 23:59:26,060 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2022-02-20 23:59:26,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:26,060 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-02-20 23:59:26,060 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:59:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-02-20 23:59:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:59:26,061 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:26,061 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:26,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:59:26,062 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:26,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:26,063 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2022-02-20 23:59:26,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:26,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489294836] [2022-02-20 23:59:26,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:26,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:26,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:26,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {725#(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(8);~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; {715#true} is VALID [2022-02-20 23:59:26,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {715#true} is VALID [2022-02-20 23:59:26,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {715#true} is VALID [2022-02-20 23:59:26,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {715#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {715#true} is VALID [2022-02-20 23:59:26,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {715#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {715#true} is VALID [2022-02-20 23:59:26,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} assume true; {715#true} is VALID [2022-02-20 23:59:26,169 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {715#true} {717#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #169#return; {717#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:59:26,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {715#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {715#true} is VALID [2022-02-20 23:59:26,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {717#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:59:26,171 INFO L272 TraceCheckUtils]: 2: Hoare triple {717#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {725#(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:59:26,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {725#(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(8);~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; {715#true} is VALID [2022-02-20 23:59:26,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {715#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {715#true} is VALID [2022-02-20 23:59:26,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {715#true} is VALID [2022-02-20 23:59:26,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {715#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {715#true} is VALID [2022-02-20 23:59:26,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {715#true} is VALID [2022-02-20 23:59:26,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {715#true} assume true; {715#true} is VALID [2022-02-20 23:59:26,174 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {715#true} {717#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #169#return; {717#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:59:26,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {717#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {717#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:59:26,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {717#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} assume !(sll_circular_create_~len#1 > 1); {716#false} is VALID [2022-02-20 23:59:26,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {716#false} assume !(1 == #valid[sll_circular_create_~last~0#1.base]); {716#false} is VALID [2022-02-20 23:59:26,175 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:59:26,175 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:26,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489294836] [2022-02-20 23:59:26,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489294836] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:26,176 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:26,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:59:26,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012262953] [2022-02-20 23:59:26,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:26,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2022-02-20 23:59:26,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:26,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:59:26,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:26,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:59:26,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:26,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:59:26,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:59:26,191 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:59:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:26,382 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-02-20 23:59:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:59:26,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2022-02-20 23:59:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:59:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-02-20 23:59:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:59:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-02-20 23:59:26,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2022-02-20 23:59:26,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:26,476 INFO L225 Difference]: With dead ends: 83 [2022-02-20 23:59:26,476 INFO L226 Difference]: Without dead ends: 83 [2022-02-20 23:59:26,476 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:59:26,478 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:26,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-20 23:59:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-02-20 23:59:26,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:26,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 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:59:26,483 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 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:59:26,484 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 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:59:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:26,487 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-02-20 23:59:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-02-20 23:59:26,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:26,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:26,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 83 states. [2022-02-20 23:59:26,489 INFO L87 Difference]: Start difference. First operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 83 states. [2022-02-20 23:59:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:26,492 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-02-20 23:59:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-02-20 23:59:26,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:26,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:26,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:26,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 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:59:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-02-20 23:59:26,495 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2022-02-20 23:59:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:26,496 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-02-20 23:59:26,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:59:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-02-20 23:59:26,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:59:26,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:26,497 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:26,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:59:26,497 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:26,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:26,498 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2022-02-20 23:59:26,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:26,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216730852] [2022-02-20 23:59:26,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:26,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:26,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:26,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {1072#(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(8);~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; {1054#true} is VALID [2022-02-20 23:59:26,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {1054#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1054#true} is VALID [2022-02-20 23:59:26,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {1054#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1054#true} is VALID [2022-02-20 23:59:26,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {1054#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1054#true} is VALID [2022-02-20 23:59:26,588 INFO L290 TraceCheckUtils]: 4: Hoare triple {1054#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1054#true} is VALID [2022-02-20 23:59:26,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {1054#true} assume true; {1054#true} is VALID [2022-02-20 23:59:26,588 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1054#true} {1054#true} #169#return; {1054#true} is VALID [2022-02-20 23:59:26,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:26,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {1072#(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(8);~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; {1054#true} is VALID [2022-02-20 23:59:26,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {1054#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1054#true} is VALID [2022-02-20 23:59:26,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {1054#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1073#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:26,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {1073#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1073#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:26,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {1073#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1074#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:26,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {1074#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:26,624 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1074#(= (select |#valid| |node_create_#res#1.base|) 1)} {1054#true} #171#return; {1070#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:59:26,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {1054#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {1054#true} is VALID [2022-02-20 23:59:26,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {1054#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {1054#true} is VALID [2022-02-20 23:59:26,626 INFO L272 TraceCheckUtils]: 2: Hoare triple {1054#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1072#(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:59:26,626 INFO L290 TraceCheckUtils]: 3: Hoare triple {1072#(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(8);~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; {1054#true} is VALID [2022-02-20 23:59:26,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {1054#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1054#true} is VALID [2022-02-20 23:59:26,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {1054#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1054#true} is VALID [2022-02-20 23:59:26,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {1054#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1054#true} is VALID [2022-02-20 23:59:26,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {1054#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1054#true} is VALID [2022-02-20 23:59:26,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {1054#true} assume true; {1054#true} is VALID [2022-02-20 23:59:26,627 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1054#true} {1054#true} #169#return; {1054#true} is VALID [2022-02-20 23:59:26,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {1054#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1054#true} is VALID [2022-02-20 23:59:26,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {1054#true} assume !!(sll_circular_create_~len#1 > 1); {1054#true} is VALID [2022-02-20 23:59:26,629 INFO L272 TraceCheckUtils]: 12: Hoare triple {1054#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1072#(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:59:26,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {1072#(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(8);~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; {1054#true} is VALID [2022-02-20 23:59:26,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {1054#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1054#true} is VALID [2022-02-20 23:59:26,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {1054#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1073#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:26,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {1073#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1073#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:26,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {1073#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1074#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:26,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {1074#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {1074#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:26,632 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1074#(= (select |#valid| |node_create_#res#1.base|) 1)} {1054#true} #171#return; {1070#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:59:26,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {1070#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {1071#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:59:26,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {1071#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)} assume !(1 == #valid[sll_circular_create_~new_head~0#1.base]); {1055#false} is VALID [2022-02-20 23:59:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:59:26,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:26,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216730852] [2022-02-20 23:59:26,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216730852] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:26,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:26,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:59:26,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741156408] [2022-02-20 23:59:26,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:26,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2022-02-20 23:59:26,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:26,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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:59:26,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:26,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:59:26,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:26,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:59:26,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:59:26,654 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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:59:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:27,083 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-02-20 23:59:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:59:27,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2022-02-20 23:59:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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:59:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-02-20 23:59:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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:59:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-02-20 23:59:27,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 106 transitions. [2022-02-20 23:59:27,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:27,175 INFO L225 Difference]: With dead ends: 97 [2022-02-20 23:59:27,175 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 23:59:27,175 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:59:27,176 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:27,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 268 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:59:27,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 23:59:27,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-02-20 23:59:27,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:27,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 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:59:27,181 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 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:59:27,181 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 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:59:27,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:27,184 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-02-20 23:59:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-02-20 23:59:27,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:27,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:27,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 97 states. [2022-02-20 23:59:27,186 INFO L87 Difference]: Start difference. First operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 97 states. [2022-02-20 23:59:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:27,189 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-02-20 23:59:27,190 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-02-20 23:59:27,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:27,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:27,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:27,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 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:59:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-02-20 23:59:27,193 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2022-02-20 23:59:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:27,193 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-02-20 23:59:27,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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:59:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-02-20 23:59:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:59:27,194 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:27,194 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:27,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:59:27,195 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2022-02-20 23:59:27,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:27,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232544957] [2022-02-20 23:59:27,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:27,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:27,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:27,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {1464#(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(8);~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; {1446#true} is VALID [2022-02-20 23:59:27,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {1446#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1446#true} is VALID [2022-02-20 23:59:27,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {1446#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1446#true} is VALID [2022-02-20 23:59:27,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {1446#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1446#true} is VALID [2022-02-20 23:59:27,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {1446#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1446#true} is VALID [2022-02-20 23:59:27,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-02-20 23:59:27,282 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1446#true} {1446#true} #169#return; {1446#true} is VALID [2022-02-20 23:59:27,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:27,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {1464#(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(8);~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; {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:27,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:27,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:27,323 INFO L290 TraceCheckUtils]: 3: Hoare triple {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:27,324 INFO L290 TraceCheckUtils]: 4: Hoare triple {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1466#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:27,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {1466#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} assume true; {1466#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:27,325 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1466#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} {1446#true} #171#return; {1462#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 8))} is VALID [2022-02-20 23:59:27,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {1446#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {1446#true} is VALID [2022-02-20 23:59:27,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {1446#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {1446#true} is VALID [2022-02-20 23:59:27,326 INFO L272 TraceCheckUtils]: 2: Hoare triple {1446#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1464#(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:59:27,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {1464#(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(8);~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; {1446#true} is VALID [2022-02-20 23:59:27,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {1446#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1446#true} is VALID [2022-02-20 23:59:27,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {1446#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1446#true} is VALID [2022-02-20 23:59:27,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {1446#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1446#true} is VALID [2022-02-20 23:59:27,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {1446#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1446#true} is VALID [2022-02-20 23:59:27,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-02-20 23:59:27,328 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1446#true} {1446#true} #169#return; {1446#true} is VALID [2022-02-20 23:59:27,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {1446#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1446#true} is VALID [2022-02-20 23:59:27,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {1446#true} assume !!(sll_circular_create_~len#1 > 1); {1446#true} is VALID [2022-02-20 23:59:27,329 INFO L272 TraceCheckUtils]: 12: Hoare triple {1446#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1464#(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:59:27,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {1464#(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(8);~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; {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:27,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:27,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:27,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:27,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {1465#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1466#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:27,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {1466#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} assume true; {1466#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:27,334 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1466#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} {1446#true} #171#return; {1462#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 8))} is VALID [2022-02-20 23:59:27,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {1462#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 8))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {1463#(and (= (+ (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 23:59:27,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {1463#(and (= (+ (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))} assume !(4 + sll_circular_create_~new_head~0#1.offset <= #length[sll_circular_create_~new_head~0#1.base] && 0 <= sll_circular_create_~new_head~0#1.offset); {1447#false} is VALID [2022-02-20 23:59:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:27,337 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:27,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232544957] [2022-02-20 23:59:27,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232544957] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:27,338 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:27,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:59:27,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012226300] [2022-02-20 23:59:27,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:27,339 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 22 [2022-02-20 23:59:27,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:27,339 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:59:27,356 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:59:27,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:59:27,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:27,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:59:27,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:59:27,357 INFO L87 Difference]: Start difference. First operand 76 states and 83 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:59:27,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:27,765 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-02-20 23:59:27,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:59:27,765 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 22 [2022-02-20 23:59:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:27,766 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:59:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-02-20 23:59:27,767 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:59:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-02-20 23:59:27,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 85 transitions. [2022-02-20 23:59:27,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:27,848 INFO L225 Difference]: With dead ends: 76 [2022-02-20 23:59:27,848 INFO L226 Difference]: Without dead ends: 76 [2022-02-20 23:59:27,848 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:59:27,849 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:27,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:59:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-20 23:59:27,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-02-20 23:59:27,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:27,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 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:59:27,853 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 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:59:27,853 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 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:59:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:27,855 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-02-20 23:59:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-02-20 23:59:27,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:27,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:27,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 76 states. [2022-02-20 23:59:27,856 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 76 states. [2022-02-20 23:59:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:27,858 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-02-20 23:59:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-02-20 23:59:27,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:27,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:27,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:27,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:27,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 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:59:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-02-20 23:59:27,861 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2022-02-20 23:59:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:27,861 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-02-20 23:59:27,861 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:59:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-02-20 23:59:27,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:59:27,862 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:27,862 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:27,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:59:27,862 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:27,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:27,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2022-02-20 23:59:27,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:27,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343908629] [2022-02-20 23:59:27,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:27,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:27,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:28,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {1792#(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(8);~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; {1774#true} is VALID [2022-02-20 23:59:28,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1774#true} is VALID [2022-02-20 23:59:28,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {1774#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:28,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:28,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1794#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:28,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {1794#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {1794#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:28,006 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1794#(= (select |#valid| |node_create_#res#1.base|) 1)} {1774#true} #169#return; {1783#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:59:28,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:28,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {1792#(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(8);~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; {1795#(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:59:28,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {1795#(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); {1795#(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:59:28,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {1795#(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: L576-1 {1795#(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:59:28,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {1795#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1795#(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:59:28,062 INFO L290 TraceCheckUtils]: 4: Hoare triple {1795#(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; {1796#(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:59:28,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {1796#(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; {1796#(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:59:28,070 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1796#(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|))} {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} #171#return; {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {1774#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {1774#true} is VALID [2022-02-20 23:59:28,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {1774#true} is VALID [2022-02-20 23:59:28,071 INFO L272 TraceCheckUtils]: 2: Hoare triple {1774#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1792#(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:59:28,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {1792#(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(8);~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; {1774#true} is VALID [2022-02-20 23:59:28,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {1774#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1774#true} is VALID [2022-02-20 23:59:28,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {1774#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:28,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:28,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1794#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:28,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {1794#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {1794#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:28,075 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1794#(= (select |#valid| |node_create_#res#1.base|) 1)} {1774#true} #169#return; {1783#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:59:28,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {1783#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !!(sll_circular_create_~len#1 > 1); {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,076 INFO L272 TraceCheckUtils]: 12: Hoare triple {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1792#(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:59:28,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {1792#(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(8);~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; {1795#(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:59:28,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {1795#(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); {1795#(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:59:28,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {1795#(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: L576-1 {1795#(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:59:28,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {1795#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1795#(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:59:28,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {1795#(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; {1796#(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:59:28,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {1796#(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; {1796#(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:59:28,082 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1796#(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|))} {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} #171#return; {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !(sll_circular_create_~len#1 > 1); {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !(1 == #valid[sll_circular_create_~last~0#1.base]); {1775#false} is VALID [2022-02-20 23:59:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:59:28,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:28,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343908629] [2022-02-20 23:59:28,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343908629] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:28,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810834504] [2022-02-20 23:59:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:28,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:28,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:28,087 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:59:28,103 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:59:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:28,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:59:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:28,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:28,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:28,705 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:59:28,705 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:59:28,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {1774#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {1774#true} is VALID [2022-02-20 23:59:28,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {1774#true} is VALID [2022-02-20 23:59:28,735 INFO L272 TraceCheckUtils]: 2: Hoare triple {1774#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1774#true} is VALID [2022-02-20 23:59:28,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {1774#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:28,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:28,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {1793#(= 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: L576-1 {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:28,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:28,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {1793#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1794#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:28,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {1794#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {1794#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:28,739 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1794#(= (select |#valid| |node_create_#res#1.base|) 1)} {1774#true} #169#return; {1783#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:59:28,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {1783#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !!(sll_circular_create_~len#1 > 1); {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,741 INFO L272 TraceCheckUtils]: 12: Hoare triple {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1836#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:59:28,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {1836#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {1840#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_242 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_242) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:28,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {1840#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_242 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_242) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1840#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_242 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_242) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:28,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {1840#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_242 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_242) |#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: L576-1 {1840#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_242 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_242) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:28,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {1840#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_242 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_242) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {1840#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_242 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_242) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:28,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {1840#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_242 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_242) |#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; {1840#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_242 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_242) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:28,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {1840#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_242 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_242) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume true; {1840#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_242 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_242) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:28,757 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1840#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_242 Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_242) |#valid|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} #171#return; {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !(sll_circular_create_~len#1 > 1); {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} is VALID [2022-02-20 23:59:28,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {1784#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)} assume !(1 == #valid[sll_circular_create_~last~0#1.base]); {1775#false} is VALID [2022-02-20 23:59:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:28,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:28,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810834504] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:28,912 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:59:28,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-02-20 23:59:28,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904218660] [2022-02-20 23:59:28,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:28,913 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 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 25 [2022-02-20 23:59:28,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:28,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 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:59:28,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:28,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:59:28,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:59:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:59:28,950 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 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:59:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:29,534 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-02-20 23:59:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:59:29,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 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 25 [2022-02-20 23:59:29,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 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:59:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-02-20 23:59:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 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:59:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-02-20 23:59:29,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-02-20 23:59:29,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:29,639 INFO L225 Difference]: With dead ends: 94 [2022-02-20 23:59:29,639 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 23:59:29,639 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:59:29,640 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 67 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:29,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 350 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 2 Unchecked, 0.2s Time] [2022-02-20 23:59:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 23:59:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2022-02-20 23:59:29,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:29,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 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:59:29,644 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 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:59:29,644 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 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:59:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:29,647 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-02-20 23:59:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-02-20 23:59:29,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:29,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:29,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 94 states. [2022-02-20 23:59:29,648 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 94 states. [2022-02-20 23:59:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:29,651 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-02-20 23:59:29,651 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-02-20 23:59:29,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:29,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:29,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:29,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 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:59:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-02-20 23:59:29,654 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2022-02-20 23:59:29,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:29,654 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-02-20 23:59:29,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 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:59:29,654 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-02-20 23:59:29,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:59:29,655 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:29,655 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:29,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 23:59:29,867 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:59:29,867 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:29,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2022-02-20 23:59:29,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:29,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689136795] [2022-02-20 23:59:29,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:29,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:29,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:30,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {2272#(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(8);~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; {2273#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-20 23:59:30,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {2273#(= |node_create_~temp~0#1.offset| 0)} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2273#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-20 23:59:30,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {2273#(= |node_create_~temp~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2274#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 23:59:30,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {2274#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2275#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 8) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:30,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {2275#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 8) (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2276#(and (<= 8 (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:59:30,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {2276#(and (<= 8 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {2276#(and (<= 8 (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:59:30,054 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2276#(and (<= 8 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {2253#true} #169#return; {2262#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:59:30,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:30,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {2272#(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(8);~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; {2277#(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:59:30,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {2277#(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); {2277#(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:59:30,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {2277#(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: L576-1 {2277#(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:59:30,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {2277#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2277#(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:59:30,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {2277#(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; {2278#(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:59:30,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {2278#(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; {2278#(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:59:30,129 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2278#(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)))} {2263#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #171#return; {2271#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:30,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {2253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {2253#true} is VALID [2022-02-20 23:59:30,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {2253#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {2253#true} is VALID [2022-02-20 23:59:30,131 INFO L272 TraceCheckUtils]: 2: Hoare triple {2253#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2272#(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:59:30,131 INFO L290 TraceCheckUtils]: 3: Hoare triple {2272#(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(8);~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; {2273#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-20 23:59:30,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {2273#(= |node_create_~temp~0#1.offset| 0)} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2273#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-20 23:59:30,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {2273#(= |node_create_~temp~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2274#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 23:59:30,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {2274#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2275#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 8) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:30,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {2275#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 8) (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2276#(and (<= 8 (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:59:30,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {2276#(and (<= 8 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {2276#(and (<= 8 (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:59:30,135 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2276#(and (<= 8 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {2253#true} #169#return; {2262#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:59:30,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {2262#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2263#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:59:30,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {2263#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} assume !!(sll_circular_create_~len#1 > 1); {2263#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:59:30,137 INFO L272 TraceCheckUtils]: 12: Hoare triple {2263#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {2272#(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:59:30,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {2272#(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(8);~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; {2277#(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:59:30,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {2277#(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); {2277#(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:59:30,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {2277#(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: L576-1 {2277#(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:59:30,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {2277#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2277#(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:59:30,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {2277#(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; {2278#(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:59:30,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {2278#(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; {2278#(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:59:30,145 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2278#(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)))} {2263#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #171#return; {2271#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:30,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {2271#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {2271#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:30,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {2271#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {2271#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:30,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {2271#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {2271#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:30,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {2271#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(sll_circular_create_~len#1 > 1); {2271#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:30,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {2271#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(4 + sll_circular_create_~last~0#1.offset <= #length[sll_circular_create_~last~0#1.base] && 0 <= sll_circular_create_~last~0#1.offset); {2254#false} is VALID [2022-02-20 23:59:30,148 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:59:30,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:30,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689136795] [2022-02-20 23:59:30,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689136795] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:30,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474557676] [2022-02-20 23:59:30,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:30,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:30,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:30,150 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:59:30,179 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:59:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:30,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 23:59:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:30,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:30,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:30,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:30,731 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:59:30,744 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:59:30,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:59:30,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {2253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {2253#true} is VALID [2022-02-20 23:59:30,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {2253#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {2253#true} is VALID [2022-02-20 23:59:30,802 INFO L272 TraceCheckUtils]: 2: Hoare triple {2253#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2253#true} is VALID [2022-02-20 23:59:30,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {2253#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {2291#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:30,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {2291#(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); {2291#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:30,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {2291#(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: L576-1 {2291#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:30,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {2291#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2301#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|) (<= (+ |node_create_~temp~0#1.offset| 8) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:30,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {2301#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|) (<= (+ |node_create_~temp~0#1.offset| 8) (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2305#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:59:30,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {2305#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {2305#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:59:30,807 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2305#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} {2253#true} #169#return; {2312#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:59:30,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {2312#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2316#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:30,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {2316#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !!(sll_circular_create_~len#1 > 1); {2316#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:30,809 INFO L272 TraceCheckUtils]: 12: Hoare triple {2316#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {2323#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:30,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {2323#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {2327#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_343 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_343) |#length|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:30,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {2327#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_343 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_343) |#length|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2327#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_343 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_343) |#length|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:30,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {2327#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_343 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_343) |#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: L576-1 {2327#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_343 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_343) |#length|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:30,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {2327#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_343 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_343) |#length|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2327#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_343 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_343) |#length|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:30,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {2327#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_343 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_343) |#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; {2327#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_343 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_343) |#length|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:30,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {2327#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_343 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_343) |#length|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume true; {2327#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_343 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_343) |#length|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:30,814 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2327#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_343 Int)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_343) |#length|)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} {2316#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} #171#return; {2346#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:30,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {2346#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {2346#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:30,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {2346#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {2346#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:30,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {2346#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {2346#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:30,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {2346#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(sll_circular_create_~len#1 > 1); {2346#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:30,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {2346#(and (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(4 + sll_circular_create_~last~0#1.offset <= #length[sll_circular_create_~last~0#1.base] && 0 <= sll_circular_create_~last~0#1.offset); {2254#false} is VALID [2022-02-20 23:59:30,817 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:59:30,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:31,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474557676] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:31,022 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:59:31,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-02-20 23:59:31,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655535968] [2022-02-20 23:59:31,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:31,023 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 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 25 [2022-02-20 23:59:31,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:31,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 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:59:31,074 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:59:31,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 23:59:31,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:31,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 23:59:31,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:59:31,076 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 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:59:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:32,105 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-02-20 23:59:32,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:59:32,106 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 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 25 [2022-02-20 23:59:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 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:59:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-02-20 23:59:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 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:59:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-02-20 23:59:32,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 103 transitions. [2022-02-20 23:59:32,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:32,198 INFO L225 Difference]: With dead ends: 94 [2022-02-20 23:59:32,198 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 23:59:32,198 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:59:32,199 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 161 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:32,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 520 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 345 Invalid, 0 Unknown, 35 Unchecked, 0.3s Time] [2022-02-20 23:59:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 23:59:32,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2022-02-20 23:59:32,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:32,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 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:59:32,203 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 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:59:32,203 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 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:59:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:32,206 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-02-20 23:59:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-02-20 23:59:32,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:32,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:32,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 94 states. [2022-02-20 23:59:32,207 INFO L87 Difference]: Start difference. First operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 94 states. [2022-02-20 23:59:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:32,209 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-02-20 23:59:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-02-20 23:59:32,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:32,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:32,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:32,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 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:59:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-02-20 23:59:32,211 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 25 [2022-02-20 23:59:32,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:32,212 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-02-20 23:59:32,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 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:59:32,212 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-02-20 23:59:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:59:32,212 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:32,213 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:32,239 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:59:32,427 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:59:32,428 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:32,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2022-02-20 23:59:32,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:32,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728671538] [2022-02-20 23:59:32,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:32,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:32,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:32,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {2762#(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(8);~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; {2740#true} is VALID [2022-02-20 23:59:32,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2740#true} is VALID [2022-02-20 23:59:32,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2740#true} is VALID [2022-02-20 23:59:32,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {2740#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2740#true} is VALID [2022-02-20 23:59:32,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {2740#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2740#true} is VALID [2022-02-20 23:59:32,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-02-20 23:59:32,528 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2740#true} {2740#true} #169#return; {2740#true} is VALID [2022-02-20 23:59:32,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:32,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {2762#(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(8);~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; {2740#true} is VALID [2022-02-20 23:59:32,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2740#true} is VALID [2022-02-20 23:59:32,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2763#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:32,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {2763#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2763#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:32,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {2763#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2764#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:32,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {2764#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {2764#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:32,571 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2764#(= (select |#valid| |node_create_#res#1.base|) 1)} {2740#true} #171#return; {2756#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:59:32,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {2740#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {2740#true} is VALID [2022-02-20 23:59:32,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {2740#true} is VALID [2022-02-20 23:59:32,572 INFO L272 TraceCheckUtils]: 2: Hoare triple {2740#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2762#(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:59:32,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {2762#(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(8);~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; {2740#true} is VALID [2022-02-20 23:59:32,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {2740#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2740#true} is VALID [2022-02-20 23:59:32,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {2740#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2740#true} is VALID [2022-02-20 23:59:32,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {2740#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2740#true} is VALID [2022-02-20 23:59:32,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {2740#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2740#true} is VALID [2022-02-20 23:59:32,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-02-20 23:59:32,576 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2740#true} {2740#true} #169#return; {2740#true} is VALID [2022-02-20 23:59:32,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {2740#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2740#true} is VALID [2022-02-20 23:59:32,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {2740#true} assume !!(sll_circular_create_~len#1 > 1); {2740#true} is VALID [2022-02-20 23:59:32,577 INFO L272 TraceCheckUtils]: 12: Hoare triple {2740#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {2762#(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:59:32,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {2762#(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(8);~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; {2740#true} is VALID [2022-02-20 23:59:32,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {2740#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2740#true} is VALID [2022-02-20 23:59:32,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {2740#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {2763#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:32,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {2763#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {2763#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:32,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {2763#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2764#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:32,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {2764#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {2764#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:32,580 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2764#(= (select |#valid| |node_create_#res#1.base|) 1)} {2740#true} #171#return; {2756#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:59:32,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {2756#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {2757#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:59:32,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {2757#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {2757#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:59:32,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {2757#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {2758#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:59:32,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {2758#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)} assume !(sll_circular_create_~len#1 > 1); {2758#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:59:32,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {2758#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {2758#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:59:32,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {2758#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2759#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:32,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {2759#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|) 1)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {2760#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:59:32,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {2760#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {2761#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)} is VALID [2022-02-20 23:59:32,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {2761#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)} assume !(sll_circular_update_at_~index#1 > 0); {2761#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)} is VALID [2022-02-20 23:59:32,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {2761#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)} assume !(1 == #valid[sll_circular_update_at_~head#1.base]); {2741#false} is VALID [2022-02-20 23:59:32,585 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:59:32,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:32,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728671538] [2022-02-20 23:59:32,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728671538] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:32,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:32,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:59:32,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208628246] [2022-02-20 23:59:32,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:32,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 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:59:32,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:32,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 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:59:32,606 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:59:32,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:59:32,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:32,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:59:32,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:59:32,607 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 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:59:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:33,536 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-02-20 23:59:33,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:59:33,537 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 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:59:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 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:59:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 157 transitions. [2022-02-20 23:59:33,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 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:59:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 157 transitions. [2022-02-20 23:59:33,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 157 transitions. [2022-02-20 23:59:33,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:33,690 INFO L225 Difference]: With dead ends: 142 [2022-02-20 23:59:33,690 INFO L226 Difference]: Without dead ends: 142 [2022-02-20 23:59:33,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:59:33,691 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 312 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:33,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 479 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:59:33,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-02-20 23:59:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 76. [2022-02-20 23:59:33,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:33,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 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:59:33,695 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 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:59:33,696 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 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:59:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:33,704 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-02-20 23:59:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2022-02-20 23:59:33,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:33,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:33,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 142 states. [2022-02-20 23:59:33,705 INFO L87 Difference]: Start difference. First operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 142 states. [2022-02-20 23:59:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:33,710 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-02-20 23:59:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2022-02-20 23:59:33,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:33,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:33,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:33,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 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:59:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-02-20 23:59:33,720 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 30 [2022-02-20 23:59:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:33,720 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-02-20 23:59:33,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 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:59:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-02-20 23:59:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:59:33,723 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:33,723 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:33,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:59:33,724 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:33,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2022-02-20 23:59:33,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:33,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622271952] [2022-02-20 23:59:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:33,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:33,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:33,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {3300#(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(8);~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; {3280#true} is VALID [2022-02-20 23:59:33,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {3280#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3280#true} is VALID [2022-02-20 23:59:33,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {3280#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3280#true} is VALID [2022-02-20 23:59:33,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {3280#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3280#true} is VALID [2022-02-20 23:59:33,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {3280#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3280#true} is VALID [2022-02-20 23:59:33,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-02-20 23:59:33,833 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3280#true} {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #169#return; {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:33,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:33,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {3300#(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(8);~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; {3280#true} is VALID [2022-02-20 23:59:33,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {3280#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3280#true} is VALID [2022-02-20 23:59:33,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {3280#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3280#true} is VALID [2022-02-20 23:59:33,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {3280#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3280#true} is VALID [2022-02-20 23:59:33,863 INFO L290 TraceCheckUtils]: 4: Hoare triple {3280#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3280#true} is VALID [2022-02-20 23:59:33,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-02-20 23:59:33,864 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3280#true} {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #171#return; {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:33,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {3280#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {3280#true} is VALID [2022-02-20 23:59:33,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {3280#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:33,866 INFO L272 TraceCheckUtils]: 2: Hoare triple {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {3300#(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:59:33,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {3300#(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(8);~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; {3280#true} is VALID [2022-02-20 23:59:33,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {3280#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3280#true} is VALID [2022-02-20 23:59:33,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {3280#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3280#true} is VALID [2022-02-20 23:59:33,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {3280#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3280#true} is VALID [2022-02-20 23:59:33,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {3280#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3280#true} is VALID [2022-02-20 23:59:33,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-02-20 23:59:33,867 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3280#true} {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #169#return; {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:33,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:33,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} assume !!(sll_circular_create_~len#1 > 1); {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:33,869 INFO L272 TraceCheckUtils]: 12: Hoare triple {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {3300#(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:59:33,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {3300#(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(8);~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; {3280#true} is VALID [2022-02-20 23:59:33,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {3280#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3280#true} is VALID [2022-02-20 23:59:33,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {3280#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3280#true} is VALID [2022-02-20 23:59:33,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {3280#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3280#true} is VALID [2022-02-20 23:59:33,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {3280#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3280#true} is VALID [2022-02-20 23:59:33,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-02-20 23:59:33,871 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3280#true} {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #171#return; {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:33,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:33,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:33,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {3282#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:33,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:33,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:33,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:33,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {3298#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:33,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {3298#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {3299#(<= 1 |ULTIMATE.start_sll_circular_update_at_~index#1|)} is VALID [2022-02-20 23:59:33,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {3299#(<= 1 |ULTIMATE.start_sll_circular_update_at_~index#1|)} assume !(sll_circular_update_at_~index#1 > 0); {3281#false} is VALID [2022-02-20 23:59:33,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {3281#false} assume !(4 + (4 + sll_circular_update_at_~head#1.offset) <= #length[sll_circular_update_at_~head#1.base] && 0 <= 4 + sll_circular_update_at_~head#1.offset); {3281#false} is VALID [2022-02-20 23:59:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:59:33,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:33,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622271952] [2022-02-20 23:59:33,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622271952] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:33,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486041153] [2022-02-20 23:59:33,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:33,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:33,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:33,878 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:59:33,910 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:59:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:33,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:59:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:34,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:34,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {3280#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {3280#true} is VALID [2022-02-20 23:59:34,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {3280#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:34,118 INFO L272 TraceCheckUtils]: 2: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {3280#true} is VALID [2022-02-20 23:59:34,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {3280#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {3280#true} is VALID [2022-02-20 23:59:34,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {3280#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3280#true} is VALID [2022-02-20 23:59:34,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {3280#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3280#true} is VALID [2022-02-20 23:59:34,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {3280#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3280#true} is VALID [2022-02-20 23:59:34,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {3280#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3280#true} is VALID [2022-02-20 23:59:34,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-02-20 23:59:34,120 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3280#true} {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #169#return; {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:34,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:34,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_circular_create_~len#1 > 1); {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:34,120 INFO L272 TraceCheckUtils]: 12: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {3280#true} is VALID [2022-02-20 23:59:34,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {3280#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {3280#true} is VALID [2022-02-20 23:59:34,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {3280#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3280#true} is VALID [2022-02-20 23:59:34,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {3280#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3280#true} is VALID [2022-02-20 23:59:34,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {3280#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3280#true} is VALID [2022-02-20 23:59:34,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {3280#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3280#true} is VALID [2022-02-20 23:59:34,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-02-20 23:59:34,122 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3280#true} {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #171#return; {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:34,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:34,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:34,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:34,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:34,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:34,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:34,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {3297#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {3298#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:34,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {3298#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {3299#(<= 1 |ULTIMATE.start_sll_circular_update_at_~index#1|)} is VALID [2022-02-20 23:59:34,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {3299#(<= 1 |ULTIMATE.start_sll_circular_update_at_~index#1|)} assume !(sll_circular_update_at_~index#1 > 0); {3281#false} is VALID [2022-02-20 23:59:34,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {3281#false} assume !(4 + (4 + sll_circular_update_at_~head#1.offset) <= #length[sll_circular_update_at_~head#1.base] && 0 <= 4 + sll_circular_update_at_~head#1.offset); {3281#false} is VALID [2022-02-20 23:59:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:59:34,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:34,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486041153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:34,126 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:59:34,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-02-20 23:59:34,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456796870] [2022-02-20 23:59:34,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:34,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 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), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-02-20 23:59:34,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:34,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 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), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:34,144 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:59:34,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:59:34,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:34,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:59:34,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:59:34,145 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 5 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), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:34,307 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-02-20 23:59:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:59:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 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), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-02-20 23:59:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 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), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-02-20 23:59:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 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), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-02-20 23:59:34,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 111 transitions. [2022-02-20 23:59:34,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:34,388 INFO L225 Difference]: With dead ends: 104 [2022-02-20 23:59:34,388 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 23:59:34,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:59:34,388 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 117 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:34,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 216 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 23:59:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2022-02-20 23:59:34,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:34,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 79 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 75 states have internal predecessors, (85), 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:59:34,392 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 79 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 75 states have internal predecessors, (85), 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:59:34,392 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 79 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 75 states have internal predecessors, (85), 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:59:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:34,394 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-02-20 23:59:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-02-20 23:59:34,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:34,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:34,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 75 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 104 states. [2022-02-20 23:59:34,395 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 75 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 104 states. [2022-02-20 23:59:34,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:34,398 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-02-20 23:59:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-02-20 23:59:34,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:34,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:34,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:34,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 75 states have internal predecessors, (85), 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:59:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-02-20 23:59:34,419 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 30 [2022-02-20 23:59:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:34,420 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-02-20 23:59:34,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-02-20 23:59:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:59:34,420 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:34,420 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:34,446 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:59:34,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:34,621 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:34,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866881, now seen corresponding path program 1 times [2022-02-20 23:59:34,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:34,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22845445] [2022-02-20 23:59:34,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:34,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:34,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {3809#(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(8);~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; {3787#true} is VALID [2022-02-20 23:59:34,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {3787#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3787#true} is VALID [2022-02-20 23:59:34,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {3787#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3787#true} is VALID [2022-02-20 23:59:34,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {3787#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3787#true} is VALID [2022-02-20 23:59:34,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {3787#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3787#true} is VALID [2022-02-20 23:59:34,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {3787#true} assume true; {3787#true} is VALID [2022-02-20 23:59:34,753 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3787#true} {3787#true} #169#return; {3787#true} is VALID [2022-02-20 23:59:34,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:34,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {3809#(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(8);~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; {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:34,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:34,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:34,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:34,790 INFO L290 TraceCheckUtils]: 4: Hoare triple {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3811#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:34,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {3811#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} assume true; {3811#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:34,791 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3811#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} {3787#true} #171#return; {3803#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 8))} is VALID [2022-02-20 23:59:34,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {3787#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {3787#true} is VALID [2022-02-20 23:59:34,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {3787#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {3787#true} is VALID [2022-02-20 23:59:34,793 INFO L272 TraceCheckUtils]: 2: Hoare triple {3787#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {3809#(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:59:34,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {3809#(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(8);~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; {3787#true} is VALID [2022-02-20 23:59:34,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {3787#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3787#true} is VALID [2022-02-20 23:59:34,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {3787#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3787#true} is VALID [2022-02-20 23:59:34,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {3787#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3787#true} is VALID [2022-02-20 23:59:34,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {3787#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3787#true} is VALID [2022-02-20 23:59:34,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {3787#true} assume true; {3787#true} is VALID [2022-02-20 23:59:34,794 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3787#true} {3787#true} #169#return; {3787#true} is VALID [2022-02-20 23:59:34,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {3787#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3787#true} is VALID [2022-02-20 23:59:34,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {3787#true} assume !!(sll_circular_create_~len#1 > 1); {3787#true} is VALID [2022-02-20 23:59:34,798 INFO L272 TraceCheckUtils]: 12: Hoare triple {3787#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {3809#(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:59:34,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {3809#(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(8);~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; {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:34,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:34,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:34,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:34,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {3810#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3811#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:34,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {3811#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} assume true; {3811#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:34,802 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3811#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} {3787#true} #171#return; {3803#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 8))} is VALID [2022-02-20 23:59:34,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {3803#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 8))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {3804#(and (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 23:59:34,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {3804#(and (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {3804#(and (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 23:59:34,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {3804#(and (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {3805#(and (= (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:59:34,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {3805#(and (= (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))} assume !(sll_circular_create_~len#1 > 1); {3805#(and (= (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:59:34,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {3805#(and (= (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {3805#(and (= (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:59:34,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {3805#(and (= (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3806#(and (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_#res#1.base|) 8))} is VALID [2022-02-20 23:59:34,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {3806#(and (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_#res#1.base|) 8))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {3807#(and (= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:34,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {3807#(and (= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {3808#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:59:34,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {3808#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (- 8)) 0))} assume !!(sll_circular_update_at_~index#1 > 0); {3808#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:59:34,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {3808#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (- 8)) 0))} assume !(4 + sll_circular_update_at_~head#1.offset <= #length[sll_circular_update_at_~head#1.base] && 0 <= sll_circular_update_at_~head#1.offset); {3788#false} is VALID [2022-02-20 23:59:34,808 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:59:34,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:34,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22845445] [2022-02-20 23:59:34,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22845445] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:34,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:34,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:59:34,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888796811] [2022-02-20 23:59:34,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:34,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 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:59:34,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:34,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 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:59:34,836 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:59:34,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:59:34,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:34,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:59:34,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:59:34,837 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 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:59:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:35,799 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2022-02-20 23:59:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:59:35,800 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 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:59:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:35,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 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:59:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2022-02-20 23:59:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 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:59:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2022-02-20 23:59:35,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 138 transitions. [2022-02-20 23:59:35,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:35,946 INFO L225 Difference]: With dead ends: 127 [2022-02-20 23:59:35,946 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 23:59:35,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:59:35,947 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 307 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:35,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 500 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:59:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 23:59:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 79. [2022-02-20 23:59:35,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:35,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 75 states have internal predecessors, (83), 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:59:35,951 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 75 states have internal predecessors, (83), 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:59:35,952 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 75 states have internal predecessors, (83), 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:59:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:35,954 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2022-02-20 23:59:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2022-02-20 23:59:35,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:35,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:35,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 75 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 127 states. [2022-02-20 23:59:35,955 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 75 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 127 states. [2022-02-20 23:59:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:35,957 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2022-02-20 23:59:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2022-02-20 23:59:35,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:35,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:35,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:35,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 75 states have internal predecessors, (83), 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:59:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-02-20 23:59:35,959 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 30 [2022-02-20 23:59:35,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:35,959 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-02-20 23:59:35,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 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:59:35,960 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-02-20 23:59:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:59:35,960 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:35,960 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:35,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:59:35,961 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:35,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2022-02-20 23:59:35,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:35,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909030349] [2022-02-20 23:59:35,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:35,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:36,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:36,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {4313#(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(8);~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; {4285#true} is VALID [2022-02-20 23:59:36,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {4285#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4285#true} is VALID [2022-02-20 23:59:36,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {4285#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,176 INFO L290 TraceCheckUtils]: 4: Hoare triple {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4315#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:36,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {4315#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {4315#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:36,177 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4315#(= (select |#valid| |node_create_#res#1.base|) 1)} {4285#true} #169#return; {4294#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:59:36,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:36,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {4313#(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(8);~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; {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {4316#(= 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: L576-1 {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4317#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} is VALID [2022-02-20 23:59:36,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {4317#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} assume true; {4317#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} is VALID [2022-02-20 23:59:36,234 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4317#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} {4295#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #171#return; {4303#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 23:59:36,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {4285#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {4285#true} is VALID [2022-02-20 23:59:36,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {4285#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {4285#true} is VALID [2022-02-20 23:59:36,235 INFO L272 TraceCheckUtils]: 2: Hoare triple {4285#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {4313#(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:59:36,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {4313#(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(8);~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; {4285#true} is VALID [2022-02-20 23:59:36,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {4285#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4285#true} is VALID [2022-02-20 23:59:36,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {4285#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4315#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:36,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {4315#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {4315#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:36,238 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4315#(= (select |#valid| |node_create_#res#1.base|) 1)} {4285#true} #169#return; {4294#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:59:36,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {4294#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4295#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:59:36,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {4295#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} assume !!(sll_circular_create_~len#1 > 1); {4295#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:59:36,240 INFO L272 TraceCheckUtils]: 12: Hoare triple {4295#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {4313#(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:59:36,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {4313#(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(8);~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; {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {4316#(= 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: L576-1 {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4317#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} is VALID [2022-02-20 23:59:36,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {4317#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} assume true; {4317#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} is VALID [2022-02-20 23:59:36,244 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4317#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} {4295#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #171#return; {4303#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 23:59:36,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {4303#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {4304#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:36,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {4304#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {4305#(and (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} is VALID [2022-02-20 23:59:36,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {4305#(and (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {4306#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:36,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {4306#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(sll_circular_create_~len#1 > 1); {4306#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:36,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {4306#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {4307#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:59:36,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {4307#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4308#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1)} is VALID [2022-02-20 23:59:36,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {4308#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {4309#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1)} is VALID [2022-02-20 23:59:36,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {4309#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4310#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) 1)} is VALID [2022-02-20 23:59:36,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {4310#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) 1)} assume !!(sll_circular_update_at_~index#1 > 0); {4310#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) 1)} is VALID [2022-02-20 23:59:36,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {4310#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) 1)} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {4311#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) 1)} is VALID [2022-02-20 23:59:36,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {4311#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) 1)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {4312#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)} is VALID [2022-02-20 23:59:36,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {4312#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)} assume !(sll_circular_update_at_~index#1 > 0); {4312#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)} is VALID [2022-02-20 23:59:36,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {4312#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)} assume !(1 == #valid[sll_circular_update_at_~head#1.base]); {4286#false} is VALID [2022-02-20 23:59:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:36,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:36,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909030349] [2022-02-20 23:59:36,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909030349] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:36,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863075440] [2022-02-20 23:59:36,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:36,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:36,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:36,253 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:59:36,281 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:59:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:36,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 53 conjunts are in the unsatisfiable core [2022-02-20 23:59:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:36,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:36,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:36,501 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:59:36,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:59:36,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:59:36,567 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:59:36,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-02-20 23:59:36,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 23:59:36,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {4285#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {4285#true} is VALID [2022-02-20 23:59:36,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {4285#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {4285#true} is VALID [2022-02-20 23:59:36,754 INFO L272 TraceCheckUtils]: 2: Hoare triple {4285#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {4285#true} is VALID [2022-02-20 23:59:36,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {4285#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,755 INFO L290 TraceCheckUtils]: 4: Hoare triple {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {4314#(= 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: L576-1 {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {4314#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4315#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:36,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {4315#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {4315#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:36,758 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4315#(= (select |#valid| |node_create_#res#1.base|) 1)} {4285#true} #169#return; {4294#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:59:36,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {4294#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4295#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:59:36,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {4295#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} assume !!(sll_circular_create_~len#1 > 1); {4295#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:59:36,759 INFO L272 TraceCheckUtils]: 12: Hoare triple {4295#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {4357#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:59:36,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {4357#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {4316#(= 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: L576-1 {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:36,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {4316#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4317#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} is VALID [2022-02-20 23:59:36,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {4317#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} assume true; {4317#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} is VALID [2022-02-20 23:59:36,763 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4317#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} {4295#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #171#return; {4303#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 23:59:36,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {4303#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {4304#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:36,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {4304#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {4305#(and (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} is VALID [2022-02-20 23:59:36,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {4305#(and (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {4306#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:36,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {4306#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(sll_circular_create_~len#1 > 1); {4306#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:36,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {4306#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {4394#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} is VALID [2022-02-20 23:59:36,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {4394#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4398#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} is VALID [2022-02-20 23:59:36,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {4398#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {4402#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:36,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4406#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)))} is VALID [2022-02-20 23:59:36,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {4406#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)))} assume !!(sll_circular_update_at_~index#1 > 0); {4406#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)))} is VALID [2022-02-20 23:59:36,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {4406#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)))} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {4311#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) 1)} is VALID [2022-02-20 23:59:36,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {4311#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) 1)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {4312#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)} is VALID [2022-02-20 23:59:36,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {4312#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)} assume !(sll_circular_update_at_~index#1 > 0); {4312#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)} is VALID [2022-02-20 23:59:36,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {4312#(= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)} assume !(1 == #valid[sll_circular_update_at_~head#1.base]); {4286#false} is VALID [2022-02-20 23:59:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:36,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:36,831 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-02-20 23:59:36,832 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 19 treesize of output 18 [2022-02-20 23:59:36,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_702) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-02-20 23:59:36,863 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_702) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-02-20 23:59:36,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:36,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-20 23:59:36,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-02-20 23:59:36,906 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:59:36,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863075440] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:36,996 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:59:36,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 23 [2022-02-20 23:59:36,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534688776] [2022-02-20 23:59:36,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:36,997 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 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 33 [2022-02-20 23:59:36,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:36,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 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:59:37,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:37,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 23:59:37,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:37,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 23:59:37,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=549, Unknown=2, NotChecked=94, Total=702 [2022-02-20 23:59:37,037 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 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:59:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:38,921 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2022-02-20 23:59:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:59:38,921 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 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 33 [2022-02-20 23:59:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 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:59:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 134 transitions. [2022-02-20 23:59:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 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:59:38,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 134 transitions. [2022-02-20 23:59:38,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 134 transitions. [2022-02-20 23:59:39,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:39,033 INFO L225 Difference]: With dead ends: 125 [2022-02-20 23:59:39,033 INFO L226 Difference]: Without dead ends: 125 [2022-02-20 23:59:39,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=1039, Unknown=2, NotChecked=134, Total=1332 [2022-02-20 23:59:39,034 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 165 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:39,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 938 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:59:39,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-20 23:59:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2022-02-20 23:59:39,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:39,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 89 states have internal predecessors, (101), 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:59:39,038 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 89 states have internal predecessors, (101), 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:59:39,039 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 89 states have internal predecessors, (101), 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:59:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:39,041 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2022-02-20 23:59:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2022-02-20 23:59:39,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:39,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:39,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 89 states have internal predecessors, (101), 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 125 states. [2022-02-20 23:59:39,042 INFO L87 Difference]: Start difference. First operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 89 states have internal predecessors, (101), 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 125 states. [2022-02-20 23:59:39,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:39,051 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2022-02-20 23:59:39,051 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2022-02-20 23:59:39,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:39,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:39,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:39,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 89 states have internal predecessors, (101), 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:59:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2022-02-20 23:59:39,055 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 33 [2022-02-20 23:59:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:39,056 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2022-02-20 23:59:39,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 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:59:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2022-02-20 23:59:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:59:39,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:39,058 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:39,082 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:59:39,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:39,258 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:39,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:39,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829058, now seen corresponding path program 1 times [2022-02-20 23:59:39,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:39,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441340193] [2022-02-20 23:59:39,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:39,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:39,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:39,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {4984#(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(8);~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; {4985#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:39,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {4985#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4985#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:39,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {4985#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {4986#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:39,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {4986#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4986#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:39,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {4986#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4987#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:59:39,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {4987#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {4987#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:59:39,641 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4987#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {4956#true} #169#return; {4965#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:59:39,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:39,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {4984#(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(8);~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; {4988#(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:59:39,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {4988#(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); {4988#(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:59:39,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {4988#(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: L576-1 {4988#(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:59:39,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {4988#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4988#(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:59:39,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {4988#(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; {4989#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:59:39,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {4989#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} assume true; {4989#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:59:39,738 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4989#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} {4966#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #171#return; {4974#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:39,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {4956#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {4956#true} is VALID [2022-02-20 23:59:39,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {4956#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {4956#true} is VALID [2022-02-20 23:59:39,740 INFO L272 TraceCheckUtils]: 2: Hoare triple {4956#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {4984#(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:59:39,740 INFO L290 TraceCheckUtils]: 3: Hoare triple {4984#(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(8);~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; {4985#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:39,741 INFO L290 TraceCheckUtils]: 4: Hoare triple {4985#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4985#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:39,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {4985#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {4986#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:39,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {4986#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4986#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:39,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {4986#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4987#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:59:39,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {4987#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {4987#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:59:39,744 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4987#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {4956#true} #169#return; {4965#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:59:39,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {4965#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4966#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:59:39,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {4966#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} assume !!(sll_circular_create_~len#1 > 1); {4966#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:59:39,746 INFO L272 TraceCheckUtils]: 12: Hoare triple {4966#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {4984#(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:59:39,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {4984#(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(8);~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; {4988#(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:59:39,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {4988#(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); {4988#(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:59:39,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {4988#(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: L576-1 {4988#(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:59:39,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {4988#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4988#(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:59:39,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {4988#(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; {4989#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:59:39,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {4989#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} assume true; {4989#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:59:39,753 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4989#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} {4966#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #171#return; {4974#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:39,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {4974#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {4975#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:39,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {4975#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {4976#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} is VALID [2022-02-20 23:59:39,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {4976#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {4977#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:59:39,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {4977#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} assume !(sll_circular_create_~len#1 > 1); {4977#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:59:39,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {4977#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {4978#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:59:39,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {4978#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4979#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 0))} is VALID [2022-02-20 23:59:39,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {4979#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 0))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {4980#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:59:39,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {4980#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4981#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 0))} is VALID [2022-02-20 23:59:39,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {4981#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 0))} assume !!(sll_circular_update_at_~index#1 > 0); {4981#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 0))} is VALID [2022-02-20 23:59:39,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {4981#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 0))} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {4982#(and (= |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|)))} is VALID [2022-02-20 23:59:39,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {4982#(and (= |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|)))} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {4983#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)))} is VALID [2022-02-20 23:59:39,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {4983#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)))} assume !(sll_circular_update_at_~index#1 > 0); {4983#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)))} is VALID [2022-02-20 23:59:39,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {4983#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)))} assume !(4 + (4 + sll_circular_update_at_~head#1.offset) <= #length[sll_circular_update_at_~head#1.base] && 0 <= 4 + sll_circular_update_at_~head#1.offset); {4957#false} is VALID [2022-02-20 23:59:39,762 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:59:39,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:39,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441340193] [2022-02-20 23:59:39,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441340193] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:39,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806421521] [2022-02-20 23:59:39,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:39,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:39,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:39,764 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:59:39,789 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:59:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:39,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-20 23:59:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:39,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:39,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:40,357 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:59:40,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:59:40,367 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 16 treesize of output 11 [2022-02-20 23:59:40,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:59:40,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:59:40,668 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:59:40,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-02-20 23:59:40,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-02-20 23:59:40,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-02-20 23:59:40,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-02-20 23:59:41,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {4956#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {4956#true} is VALID [2022-02-20 23:59:41,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {4956#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {4956#true} is VALID [2022-02-20 23:59:41,083 INFO L272 TraceCheckUtils]: 2: Hoare triple {4956#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {4956#true} is VALID [2022-02-20 23:59:41,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {4956#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {5002#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:41,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {5002#(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); {5002#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:41,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {5002#(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: L576-1 {5002#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:41,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {5002#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {5012#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|) (<= (+ |node_create_~temp~0#1.offset| 8) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:41,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {5012#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|) (<= (+ |node_create_~temp~0#1.offset| 8) (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5016#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:59:41,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {5016#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {5016#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:59:41,089 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5016#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} {4956#true} #169#return; {5023#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:59:41,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {5023#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5027#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:41,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {5027#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} assume !!(sll_circular_create_~len#1 > 1); {5027#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 23:59:41,091 INFO L272 TraceCheckUtils]: 12: Hoare triple {5027#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {5034#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:41,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {5034#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {4988#(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:59:41,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {4988#(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); {4988#(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:59:41,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {4988#(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: L576-1 {4988#(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:59:41,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {4988#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {4988#(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:59:41,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {4988#(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; {5050#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (store |old(#length)| |node_create_#res#1.base| (select |#length| |node_create_#res#1.base|)) |#length|))} is VALID [2022-02-20 23:59:41,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {5050#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (store |old(#length)| |node_create_#res#1.base| (select |#length| |node_create_#res#1.base|)) |#length|))} assume true; {5050#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (store |old(#length)| |node_create_#res#1.base| (select |#length| |node_create_#res#1.base|)) |#length|))} is VALID [2022-02-20 23:59:41,096 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5050#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (store |old(#length)| |node_create_#res#1.base| (select |#length| |node_create_#res#1.base|)) |#length|))} {5027#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} #171#return; {5057#(and (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 23:59:41,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {5057#(and (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {5061#(and (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:59:41,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {5061#(and (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {5065#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} is VALID [2022-02-20 23:59:41,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {5065#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {5069#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:41,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {5069#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(sll_circular_create_~len#1 > 1); {5069#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:41,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {5069#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {5076#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} is VALID [2022-02-20 23:59:41,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {5076#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5080#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} is VALID [2022-02-20 23:59:41,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {5080#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {5084#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-20 23:59:41,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {5084#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {5088#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)))} is VALID [2022-02-20 23:59:41,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {5088#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)))} assume !!(sll_circular_update_at_~index#1 > 0); {5088#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)))} is VALID [2022-02-20 23:59:41,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {5088#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)))} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {5095#(and (<= (+ 8 |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) (select |#length| |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|)) (<= 0 |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|))} is VALID [2022-02-20 23:59:41,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {5095#(and (<= (+ 8 |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) (select |#length| |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|)) (<= 0 |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|))} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {5099#(and (<= (+ 8 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (select |#length| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (<= 0 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|))} is VALID [2022-02-20 23:59:41,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {5099#(and (<= (+ 8 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (select |#length| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (<= 0 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|))} assume !(sll_circular_update_at_~index#1 > 0); {5099#(and (<= (+ 8 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (select |#length| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (<= 0 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|))} is VALID [2022-02-20 23:59:41,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {5099#(and (<= (+ 8 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (select |#length| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (<= 0 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|))} assume !(4 + (4 + sll_circular_update_at_~head#1.offset) <= #length[sll_circular_update_at_~head#1.base] && 0 <= 4 + sll_circular_update_at_~head#1.offset); {4957#false} is VALID [2022-02-20 23:59:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:41,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:41,418 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2022-02-20 23:59:41,459 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2022-02-20 23:59:41,506 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:41,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-02-20 23:59:41,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:41,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-02-20 23:59:41,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2022-02-20 23:59:41,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 70 [2022-02-20 23:59:41,548 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 34 treesize of output 30 [2022-02-20 23:59:41,554 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 62 treesize of output 58 [2022-02-20 23:59:41,623 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:41,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-02-20 23:59:41,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:59:41,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-02-20 23:59:41,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806421521] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:41,908 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:59:41,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-02-20 23:59:41,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411698601] [2022-02-20 23:59:41,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:41,909 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 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 33 [2022-02-20 23:59:41,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:41,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 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:59:41,969 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:59:41,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-02-20 23:59:41,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:41,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-02-20 23:59:41,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1945, Unknown=2, NotChecked=178, Total=2256 [2022-02-20 23:59:41,970 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 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:59:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:44,839 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2022-02-20 23:59:44,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:59:44,839 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 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 33 [2022-02-20 23:59:44,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:44,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 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:59:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 161 transitions. [2022-02-20 23:59:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 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:59:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 161 transitions. [2022-02-20 23:59:44,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 161 transitions. [2022-02-20 23:59:44,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:44,964 INFO L225 Difference]: With dead ends: 150 [2022-02-20 23:59:44,965 INFO L226 Difference]: Without dead ends: 150 [2022-02-20 23:59:44,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=263, Invalid=2713, Unknown=2, NotChecked=214, Total=3192 [2022-02-20 23:59:44,966 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 221 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:44,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 1205 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 23:59:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-02-20 23:59:44,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2022-02-20 23:59:44,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:44,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 91 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 86 states have internal predecessors, (95), 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:59:44,970 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 91 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 86 states have internal predecessors, (95), 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:59:44,970 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 91 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 86 states have internal predecessors, (95), 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:59:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:44,973 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2022-02-20 23:59:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2022-02-20 23:59:44,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:44,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:44,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 86 states have internal predecessors, (95), 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 150 states. [2022-02-20 23:59:44,974 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 86 states have internal predecessors, (95), 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 150 states. [2022-02-20 23:59:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:44,977 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2022-02-20 23:59:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2022-02-20 23:59:44,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:44,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:44,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:44,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 86 states have internal predecessors, (95), 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:59:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-02-20 23:59:44,979 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 33 [2022-02-20 23:59:44,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:44,980 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-02-20 23:59:44,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 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:59:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-02-20 23:59:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 23:59:44,981 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:44,981 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:45,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:45,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 23:59:45,195 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:45,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1020012727, now seen corresponding path program 2 times [2022-02-20 23:59:45,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:45,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315759594] [2022-02-20 23:59:45,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:45,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:45,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:45,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {5738#(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(8);~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; {5717#true} is VALID [2022-02-20 23:59:45,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {5717#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5717#true} is VALID [2022-02-20 23:59:45,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {5717#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {5717#true} is VALID [2022-02-20 23:59:45,299 INFO L290 TraceCheckUtils]: 3: Hoare triple {5717#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {5717#true} is VALID [2022-02-20 23:59:45,299 INFO L290 TraceCheckUtils]: 4: Hoare triple {5717#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5717#true} is VALID [2022-02-20 23:59:45,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {5717#true} assume true; {5717#true} is VALID [2022-02-20 23:59:45,300 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5717#true} {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #169#return; {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:45,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:45,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {5738#(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(8);~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; {5717#true} is VALID [2022-02-20 23:59:45,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {5717#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5717#true} is VALID [2022-02-20 23:59:45,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {5717#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {5717#true} is VALID [2022-02-20 23:59:45,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {5717#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {5717#true} is VALID [2022-02-20 23:59:45,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {5717#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5717#true} is VALID [2022-02-20 23:59:45,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {5717#true} assume true; {5717#true} is VALID [2022-02-20 23:59:45,318 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5717#true} {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #171#return; {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:45,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {5717#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {5717#true} is VALID [2022-02-20 23:59:45,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {5717#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:45,320 INFO L272 TraceCheckUtils]: 2: Hoare triple {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {5738#(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:59:45,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {5738#(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(8);~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; {5717#true} is VALID [2022-02-20 23:59:45,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {5717#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5717#true} is VALID [2022-02-20 23:59:45,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {5717#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {5717#true} is VALID [2022-02-20 23:59:45,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {5717#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {5717#true} is VALID [2022-02-20 23:59:45,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {5717#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5717#true} is VALID [2022-02-20 23:59:45,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {5717#true} assume true; {5717#true} is VALID [2022-02-20 23:59:45,322 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5717#true} {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #169#return; {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:45,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:45,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} assume !!(sll_circular_create_~len#1 > 1); {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:45,324 INFO L272 TraceCheckUtils]: 12: Hoare triple {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {5738#(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:59:45,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {5738#(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(8);~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; {5717#true} is VALID [2022-02-20 23:59:45,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {5717#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5717#true} is VALID [2022-02-20 23:59:45,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {5717#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {5717#true} is VALID [2022-02-20 23:59:45,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {5717#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {5717#true} is VALID [2022-02-20 23:59:45,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {5717#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5717#true} is VALID [2022-02-20 23:59:45,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {5717#true} assume true; {5717#true} is VALID [2022-02-20 23:59:45,325 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5717#true} {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #171#return; {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:45,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:45,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:45,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {5719#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_create_~len#1 > 1); {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {5735#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:45,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {5735#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {5736#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} is VALID [2022-02-20 23:59:45,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {5736#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} assume !!(sll_circular_update_at_~index#1 > 0); {5736#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} is VALID [2022-02-20 23:59:45,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {5736#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {5736#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} is VALID [2022-02-20 23:59:45,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {5736#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {5737#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} is VALID [2022-02-20 23:59:45,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {5737#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} assume !!(sll_circular_update_at_~index#1 > 0); {5718#false} is VALID [2022-02-20 23:59:45,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {5718#false} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {5718#false} is VALID [2022-02-20 23:59:45,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {5718#false} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {5718#false} is VALID [2022-02-20 23:59:45,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {5718#false} assume !(sll_circular_update_at_~index#1 > 0); {5718#false} is VALID [2022-02-20 23:59:45,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {5718#false} assume !(1 == #valid[sll_circular_update_at_~head#1.base]); {5718#false} is VALID [2022-02-20 23:59:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:59:45,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:45,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315759594] [2022-02-20 23:59:45,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315759594] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:45,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76358254] [2022-02-20 23:59:45,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:59:45,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:45,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:45,336 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:59:45,361 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:59:45,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:59:45,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:59:45,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:59:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:45,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:45,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {5717#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {5717#true} is VALID [2022-02-20 23:59:45,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {5717#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,625 INFO L272 TraceCheckUtils]: 2: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {5717#true} is VALID [2022-02-20 23:59:45,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {5717#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {5717#true} is VALID [2022-02-20 23:59:45,625 INFO L290 TraceCheckUtils]: 4: Hoare triple {5717#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5717#true} is VALID [2022-02-20 23:59:45,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {5717#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {5717#true} is VALID [2022-02-20 23:59:45,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {5717#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {5717#true} is VALID [2022-02-20 23:59:45,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {5717#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5717#true} is VALID [2022-02-20 23:59:45,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {5717#true} assume true; {5717#true} is VALID [2022-02-20 23:59:45,627 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5717#true} {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} #169#return; {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(sll_circular_create_~len#1 > 1); {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,628 INFO L272 TraceCheckUtils]: 12: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {5717#true} is VALID [2022-02-20 23:59:45,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {5717#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {5717#true} is VALID [2022-02-20 23:59:45,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {5717#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5717#true} is VALID [2022-02-20 23:59:45,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {5717#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {5717#true} is VALID [2022-02-20 23:59:45,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {5717#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {5717#true} is VALID [2022-02-20 23:59:45,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {5717#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5717#true} is VALID [2022-02-20 23:59:45,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {5717#true} assume true; {5717#true} is VALID [2022-02-20 23:59:45,629 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5717#true} {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} #171#return; {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_create_~len#1 > 1); {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:45,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {5734#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {5735#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:45,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {5735#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {5736#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} is VALID [2022-02-20 23:59:45,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {5736#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} assume !!(sll_circular_update_at_~index#1 > 0); {5736#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} is VALID [2022-02-20 23:59:45,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {5736#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {5736#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} is VALID [2022-02-20 23:59:45,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {5736#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {5737#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} is VALID [2022-02-20 23:59:45,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {5737#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} assume !!(sll_circular_update_at_~index#1 > 0); {5718#false} is VALID [2022-02-20 23:59:45,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {5718#false} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {5718#false} is VALID [2022-02-20 23:59:45,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {5718#false} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {5718#false} is VALID [2022-02-20 23:59:45,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {5718#false} assume !(sll_circular_update_at_~index#1 > 0); {5718#false} is VALID [2022-02-20 23:59:45,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {5718#false} assume !(1 == #valid[sll_circular_update_at_~head#1.base]); {5718#false} is VALID [2022-02-20 23:59:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:59:45,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:45,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76358254] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:45,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:59:45,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-02-20 23:59:45,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477808104] [2022-02-20 23:59:45,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:45,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-02-20 23:59:45,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:45,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:45,659 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:59:45,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:59:45,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:45,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:59:45,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:59:45,659 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:45,816 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-02-20 23:59:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:59:45,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-02-20 23:59:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-02-20 23:59:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-02-20 23:59:45,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-02-20 23:59:45,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:45,883 INFO L225 Difference]: With dead ends: 89 [2022-02-20 23:59:45,883 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 23:59:45,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:59:45,884 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 206 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:45,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 115 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:45,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 23:59:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 23:59:45,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:45,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.373134328358209) internal successors, (92), 84 states have internal predecessors, (92), 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:59:45,887 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.373134328358209) internal successors, (92), 84 states have internal predecessors, (92), 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:59:45,887 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.373134328358209) internal successors, (92), 84 states have internal predecessors, (92), 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:59:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:45,889 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-02-20 23:59:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-02-20 23:59:45,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:45,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:45,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 67 states have (on average 1.373134328358209) internal successors, (92), 84 states have internal predecessors, (92), 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 89 states. [2022-02-20 23:59:45,890 INFO L87 Difference]: Start difference. First operand has 89 states, 67 states have (on average 1.373134328358209) internal successors, (92), 84 states have internal predecessors, (92), 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 89 states. [2022-02-20 23:59:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:45,891 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-02-20 23:59:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-02-20 23:59:45,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:45,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:45,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:45,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.373134328358209) internal successors, (92), 84 states have internal predecessors, (92), 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:59:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2022-02-20 23:59:45,894 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 36 [2022-02-20 23:59:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:45,894 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2022-02-20 23:59:45,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-02-20 23:59:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 23:59:45,895 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:45,895 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:45,919 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:59:46,113 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:59:46,114 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:46,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash 999795886, now seen corresponding path program 1 times [2022-02-20 23:59:46,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:46,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001750978] [2022-02-20 23:59:46,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:46,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:46,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:46,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {6230#(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(8);~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; {6208#true} is VALID [2022-02-20 23:59:46,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6208#true} is VALID [2022-02-20 23:59:46,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {6208#true} is VALID [2022-02-20 23:59:46,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {6208#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {6208#true} is VALID [2022-02-20 23:59:46,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {6208#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6208#true} is VALID [2022-02-20 23:59:46,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-02-20 23:59:46,200 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6208#true} {6208#true} #169#return; {6208#true} is VALID [2022-02-20 23:59:46,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:46,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {6230#(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(8);~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; {6208#true} is VALID [2022-02-20 23:59:46,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6208#true} is VALID [2022-02-20 23:59:46,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {6231#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:46,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {6231#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {6231#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:46,227 INFO L290 TraceCheckUtils]: 4: Hoare triple {6231#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6232#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:46,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {6232#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {6232#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:46,228 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6232#(= (select |#valid| |node_create_#res#1.base|) 1)} {6208#true} #171#return; {6224#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:59:46,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {6208#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {6208#true} is VALID [2022-02-20 23:59:46,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {6208#true} is VALID [2022-02-20 23:59:46,229 INFO L272 TraceCheckUtils]: 2: Hoare triple {6208#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {6230#(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:59:46,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {6230#(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(8);~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; {6208#true} is VALID [2022-02-20 23:59:46,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {6208#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6208#true} is VALID [2022-02-20 23:59:46,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {6208#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {6208#true} is VALID [2022-02-20 23:59:46,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {6208#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {6208#true} is VALID [2022-02-20 23:59:46,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6208#true} is VALID [2022-02-20 23:59:46,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-02-20 23:59:46,229 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6208#true} {6208#true} #169#return; {6208#true} is VALID [2022-02-20 23:59:46,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {6208#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {6208#true} is VALID [2022-02-20 23:59:46,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {6208#true} assume !!(sll_circular_create_~len#1 > 1); {6208#true} is VALID [2022-02-20 23:59:46,230 INFO L272 TraceCheckUtils]: 12: Hoare triple {6208#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {6230#(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:59:46,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {6230#(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(8);~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; {6208#true} is VALID [2022-02-20 23:59:46,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {6208#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6208#true} is VALID [2022-02-20 23:59:46,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {6208#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {6231#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:46,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {6231#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {6231#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:46,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {6231#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6232#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:46,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {6232#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {6232#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:46,232 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6232#(= (select |#valid| |node_create_#res#1.base|) 1)} {6208#true} #171#return; {6224#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:59:46,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {6224#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {6225#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {6225#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {6225#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {6225#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {6226#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {6226#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)} assume !(sll_circular_create_~len#1 > 1); {6226#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {6226#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {6226#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {6226#(= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {6227#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:46,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {6227#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|) 1)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !!(sll_circular_update_at_~index#1 > 0); {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !(sll_circular_update_at_~index#1 > 0); {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume { :end_inline_sll_circular_update_at } true; {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !(main_~i~0#1 > -1); {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} main_~i~0#1 := main_~len~0#1 - 1; {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:59:46,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {6228#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !!(main_~i~0#1 > -1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {6229#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1)} is VALID [2022-02-20 23:59:46,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {6229#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1)} assume !!(sll_circular_get_data_at_~index#1 > 0); {6229#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1)} is VALID [2022-02-20 23:59:46,243 INFO L290 TraceCheckUtils]: 39: Hoare triple {6229#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1)} assume !(1 == #valid[sll_circular_get_data_at_~head#1.base]); {6209#false} is VALID [2022-02-20 23:59:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 23:59:46,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:46,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001750978] [2022-02-20 23:59:46,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001750978] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:46,243 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:46,243 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:59:46,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204604905] [2022-02-20 23:59:46,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:46,244 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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 40 [2022-02-20 23:59:46,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:46,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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:59:46,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:46,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:59:46,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:46,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:59:46,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:59:46,281 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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:59:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:46,881 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-02-20 23:59:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:59:46,881 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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 40 [2022-02-20 23:59:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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:59:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2022-02-20 23:59:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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:59:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2022-02-20 23:59:46,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 109 transitions. [2022-02-20 23:59:46,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:46,974 INFO L225 Difference]: With dead ends: 114 [2022-02-20 23:59:46,974 INFO L226 Difference]: Without dead ends: 114 [2022-02-20 23:59:46,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:59:46,974 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 280 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:46,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 314 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:59:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-02-20 23:59:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2022-02-20 23:59:46,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:46,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 92 states, 70 states have (on average 1.4) internal successors, (98), 87 states have internal predecessors, (98), 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:59:46,977 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 92 states, 70 states have (on average 1.4) internal successors, (98), 87 states have internal predecessors, (98), 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:59:46,978 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 92 states, 70 states have (on average 1.4) internal successors, (98), 87 states have internal predecessors, (98), 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:59:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:46,980 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-02-20 23:59:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2022-02-20 23:59:46,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:46,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:46,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 70 states have (on average 1.4) internal successors, (98), 87 states have internal predecessors, (98), 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 114 states. [2022-02-20 23:59:46,981 INFO L87 Difference]: Start difference. First operand has 92 states, 70 states have (on average 1.4) internal successors, (98), 87 states have internal predecessors, (98), 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 114 states. [2022-02-20 23:59:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:46,983 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-02-20 23:59:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2022-02-20 23:59:46,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:46,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:46,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:46,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.4) internal successors, (98), 87 states have internal predecessors, (98), 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:59:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-02-20 23:59:46,985 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 40 [2022-02-20 23:59:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:46,985 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-02-20 23:59:46,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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:59:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-02-20 23:59:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 23:59:46,986 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:46,987 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:46,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:59:46,987 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:46,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:46,987 INFO L85 PathProgramCache]: Analyzing trace with hash 999795887, now seen corresponding path program 1 times [2022-02-20 23:59:46,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:46,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547654303] [2022-02-20 23:59:46,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:47,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:47,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {6700#(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(8);~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; {6680#true} is VALID [2022-02-20 23:59:47,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {6680#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6680#true} is VALID [2022-02-20 23:59:47,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {6680#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {6680#true} is VALID [2022-02-20 23:59:47,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {6680#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {6680#true} is VALID [2022-02-20 23:59:47,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {6680#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6680#true} is VALID [2022-02-20 23:59:47,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {6680#true} assume true; {6680#true} is VALID [2022-02-20 23:59:47,069 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6680#true} {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #169#return; {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:47,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:47,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {6700#(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(8);~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; {6680#true} is VALID [2022-02-20 23:59:47,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {6680#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6680#true} is VALID [2022-02-20 23:59:47,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {6680#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {6680#true} is VALID [2022-02-20 23:59:47,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {6680#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {6680#true} is VALID [2022-02-20 23:59:47,078 INFO L290 TraceCheckUtils]: 4: Hoare triple {6680#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6680#true} is VALID [2022-02-20 23:59:47,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {6680#true} assume true; {6680#true} is VALID [2022-02-20 23:59:47,083 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6680#true} {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #171#return; {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:47,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {6680#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {6680#true} is VALID [2022-02-20 23:59:47,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {6680#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:47,085 INFO L272 TraceCheckUtils]: 2: Hoare triple {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {6700#(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:59:47,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {6700#(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(8);~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; {6680#true} is VALID [2022-02-20 23:59:47,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {6680#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6680#true} is VALID [2022-02-20 23:59:47,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {6680#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {6680#true} is VALID [2022-02-20 23:59:47,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {6680#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {6680#true} is VALID [2022-02-20 23:59:47,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {6680#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6680#true} is VALID [2022-02-20 23:59:47,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {6680#true} assume true; {6680#true} is VALID [2022-02-20 23:59:47,087 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6680#true} {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #169#return; {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:47,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:47,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} assume !!(sll_circular_create_~len#1 > 1); {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:47,088 INFO L272 TraceCheckUtils]: 12: Hoare triple {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {6700#(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:59:47,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {6700#(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(8);~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; {6680#true} is VALID [2022-02-20 23:59:47,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {6680#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6680#true} is VALID [2022-02-20 23:59:47,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {6680#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {6680#true} is VALID [2022-02-20 23:59:47,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {6680#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {6680#true} is VALID [2022-02-20 23:59:47,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {6680#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6680#true} is VALID [2022-02-20 23:59:47,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {6680#true} assume true; {6680#true} is VALID [2022-02-20 23:59:47,094 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6680#true} {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #171#return; {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:47,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:47,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:47,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {6682#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(sll_circular_update_at_~index#1 > 0); {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_sll_circular_update_at } true; {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {6699#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {6699#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 > -1); {6681#false} is VALID [2022-02-20 23:59:47,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {6681#false} main_~i~0#1 := main_~len~0#1 - 1; {6681#false} is VALID [2022-02-20 23:59:47,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {6681#false} assume !!(main_~i~0#1 > -1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {6681#false} is VALID [2022-02-20 23:59:47,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {6681#false} assume !!(sll_circular_get_data_at_~index#1 > 0); {6681#false} is VALID [2022-02-20 23:59:47,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {6681#false} assume !(4 + sll_circular_get_data_at_~head#1.offset <= #length[sll_circular_get_data_at_~head#1.base] && 0 <= sll_circular_get_data_at_~head#1.offset); {6681#false} is VALID [2022-02-20 23:59:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:59:47,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:47,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547654303] [2022-02-20 23:59:47,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547654303] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:47,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432861680] [2022-02-20 23:59:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:47,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:47,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:47,101 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:59:47,102 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:59:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:47,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:59:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:47,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:47,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {6680#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {6680#true} is VALID [2022-02-20 23:59:47,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {6680#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,396 INFO L272 TraceCheckUtils]: 2: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {6680#true} is VALID [2022-02-20 23:59:47,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {6680#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {6680#true} is VALID [2022-02-20 23:59:47,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {6680#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6680#true} is VALID [2022-02-20 23:59:47,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {6680#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {6680#true} is VALID [2022-02-20 23:59:47,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {6680#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {6680#true} is VALID [2022-02-20 23:59:47,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {6680#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6680#true} is VALID [2022-02-20 23:59:47,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {6680#true} assume true; {6680#true} is VALID [2022-02-20 23:59:47,398 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6680#true} {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #169#return; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_circular_create_~len#1 > 1); {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,398 INFO L272 TraceCheckUtils]: 12: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {6680#true} is VALID [2022-02-20 23:59:47,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {6680#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {6680#true} is VALID [2022-02-20 23:59:47,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {6680#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6680#true} is VALID [2022-02-20 23:59:47,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {6680#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {6680#true} is VALID [2022-02-20 23:59:47,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {6680#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {6680#true} is VALID [2022-02-20 23:59:47,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {6680#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6680#true} is VALID [2022-02-20 23:59:47,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {6680#true} assume true; {6680#true} is VALID [2022-02-20 23:59:47,399 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6680#true} {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #171#return; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,410 INFO L290 TraceCheckUtils]: 27: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(sll_circular_update_at_~index#1 > 0); {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,413 INFO L290 TraceCheckUtils]: 33: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_sll_circular_update_at } true; {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {6699#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {6699#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 > -1); {6681#false} is VALID [2022-02-20 23:59:47,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {6681#false} main_~i~0#1 := main_~len~0#1 - 1; {6681#false} is VALID [2022-02-20 23:59:47,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {6681#false} assume !!(main_~i~0#1 > -1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {6681#false} is VALID [2022-02-20 23:59:47,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {6681#false} assume !!(sll_circular_get_data_at_~index#1 > 0); {6681#false} is VALID [2022-02-20 23:59:47,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {6681#false} assume !(4 + sll_circular_get_data_at_~head#1.offset <= #length[sll_circular_get_data_at_~head#1.base] && 0 <= sll_circular_get_data_at_~head#1.offset); {6681#false} is VALID [2022-02-20 23:59:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:59:47,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:47,545 INFO L290 TraceCheckUtils]: 39: Hoare triple {6681#false} assume !(4 + sll_circular_get_data_at_~head#1.offset <= #length[sll_circular_get_data_at_~head#1.base] && 0 <= sll_circular_get_data_at_~head#1.offset); {6681#false} is VALID [2022-02-20 23:59:47,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {6681#false} assume !!(sll_circular_get_data_at_~index#1 > 0); {6681#false} is VALID [2022-02-20 23:59:47,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {6681#false} assume !!(main_~i~0#1 > -1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {6681#false} is VALID [2022-02-20 23:59:47,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {6681#false} main_~i~0#1 := main_~len~0#1 - 1; {6681#false} is VALID [2022-02-20 23:59:47,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {6699#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 > -1); {6681#false} is VALID [2022-02-20 23:59:47,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {6699#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_sll_circular_update_at } true; {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(sll_circular_update_at_~index#1 > 0); {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {6698#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:47,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,553 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6680#true} {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #171#return; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {6680#true} assume true; {6680#true} is VALID [2022-02-20 23:59:47,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {6680#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6680#true} is VALID [2022-02-20 23:59:47,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {6680#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {6680#true} is VALID [2022-02-20 23:59:47,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {6680#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {6680#true} is VALID [2022-02-20 23:59:47,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {6680#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6680#true} is VALID [2022-02-20 23:59:47,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {6680#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {6680#true} is VALID [2022-02-20 23:59:47,554 INFO L272 TraceCheckUtils]: 12: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {6680#true} is VALID [2022-02-20 23:59:47,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_circular_create_~len#1 > 1); {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,555 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6680#true} {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #169#return; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {6680#true} assume true; {6680#true} is VALID [2022-02-20 23:59:47,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {6680#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6680#true} is VALID [2022-02-20 23:59:47,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {6680#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {6680#true} is VALID [2022-02-20 23:59:47,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {6680#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {6680#true} is VALID [2022-02-20 23:59:47,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {6680#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {6680#true} is VALID [2022-02-20 23:59:47,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {6680#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {6680#true} is VALID [2022-02-20 23:59:47,562 INFO L272 TraceCheckUtils]: 2: Hoare triple {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {6680#true} is VALID [2022-02-20 23:59:47,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {6680#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {6697#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:47,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {6680#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {6680#true} is VALID [2022-02-20 23:59:47,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:59:47,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432861680] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:47,564 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:59:47,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2022-02-20 23:59:47,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752381515] [2022-02-20 23:59:47,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:47,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-02-20 23:59:47,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:47,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:59:47,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:47,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:59:47,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:47,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:59:47,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:59:47,609 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:59:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:47,870 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-02-20 23:59:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:59:47,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-02-20 23:59:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:59:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-02-20 23:59:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:59:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-02-20 23:59:47,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2022-02-20 23:59:47,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:47,966 INFO L225 Difference]: With dead ends: 120 [2022-02-20 23:59:47,966 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 23:59:47,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:59:47,967 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 142 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:47,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 242 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:59:47,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 23:59:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2022-02-20 23:59:47,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:47,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 107 states have internal predecessors, (129), 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:59:47,970 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 107 states have internal predecessors, (129), 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:59:47,970 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 107 states have internal predecessors, (129), 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:59:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:47,972 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-02-20 23:59:47,972 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2022-02-20 23:59:47,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:47,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:47,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 107 states have internal predecessors, (129), 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 120 states. [2022-02-20 23:59:47,973 INFO L87 Difference]: Start difference. First operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 107 states have internal predecessors, (129), 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 120 states. [2022-02-20 23:59:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:47,975 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-02-20 23:59:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2022-02-20 23:59:47,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:47,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:47,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:47,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 107 states have internal predecessors, (129), 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:59:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2022-02-20 23:59:47,977 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 40 [2022-02-20 23:59:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:47,978 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2022-02-20 23:59:47,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:59:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2022-02-20 23:59:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:59:47,978 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:47,978 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:48,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:48,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:48,194 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:48,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:48,195 INFO L85 PathProgramCache]: Analyzing trace with hash 968760597, now seen corresponding path program 1 times [2022-02-20 23:59:48,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:48,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72192732] [2022-02-20 23:59:48,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:48,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:48,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {7434#(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(8);~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; {7413#true} is VALID [2022-02-20 23:59:48,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {7413#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7413#true} is VALID [2022-02-20 23:59:48,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {7413#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {7413#true} is VALID [2022-02-20 23:59:48,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {7413#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {7413#true} is VALID [2022-02-20 23:59:48,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {7413#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7413#true} is VALID [2022-02-20 23:59:48,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-02-20 23:59:48,304 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7413#true} {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #169#return; {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:48,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:48,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {7434#(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(8);~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; {7413#true} is VALID [2022-02-20 23:59:48,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {7413#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7413#true} is VALID [2022-02-20 23:59:48,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {7413#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {7413#true} is VALID [2022-02-20 23:59:48,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {7413#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {7413#true} is VALID [2022-02-20 23:59:48,313 INFO L290 TraceCheckUtils]: 4: Hoare triple {7413#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7413#true} is VALID [2022-02-20 23:59:48,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-02-20 23:59:48,314 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7413#true} {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #171#return; {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:48,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {7413#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {7413#true} is VALID [2022-02-20 23:59:48,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {7413#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:48,316 INFO L272 TraceCheckUtils]: 2: Hoare triple {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {7434#(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:59:48,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {7434#(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(8);~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; {7413#true} is VALID [2022-02-20 23:59:48,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {7413#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7413#true} is VALID [2022-02-20 23:59:48,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {7413#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {7413#true} is VALID [2022-02-20 23:59:48,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {7413#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {7413#true} is VALID [2022-02-20 23:59:48,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {7413#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7413#true} is VALID [2022-02-20 23:59:48,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-02-20 23:59:48,317 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7413#true} {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #169#return; {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:48,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:48,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} assume !!(sll_circular_create_~len#1 > 1); {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:48,319 INFO L272 TraceCheckUtils]: 12: Hoare triple {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {7434#(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:59:48,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {7434#(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(8);~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; {7413#true} is VALID [2022-02-20 23:59:48,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {7413#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7413#true} is VALID [2022-02-20 23:59:48,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {7413#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {7413#true} is VALID [2022-02-20 23:59:48,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {7413#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {7413#true} is VALID [2022-02-20 23:59:48,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {7413#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7413#true} is VALID [2022-02-20 23:59:48,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-02-20 23:59:48,321 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7413#true} {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #171#return; {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:48,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:48,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:48,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {7415#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_create_~len#1 > 1); {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(sll_circular_update_at_~index#1 > 0); {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(sll_circular_update_at_~index#1 > 0); {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume { :end_inline_sll_circular_update_at } true; {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {7432#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:59:48,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {7432#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {7433#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} is VALID [2022-02-20 23:59:48,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {7433#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} assume !!(sll_circular_update_at_~index#1 > 0); {7414#false} is VALID [2022-02-20 23:59:48,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {7414#false} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {7414#false} is VALID [2022-02-20 23:59:48,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {7414#false} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {7414#false} is VALID [2022-02-20 23:59:48,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {7414#false} assume !(sll_circular_update_at_~index#1 > 0); {7414#false} is VALID [2022-02-20 23:59:48,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {7414#false} assume !(1 == #valid[sll_circular_update_at_~head#1.base]); {7414#false} is VALID [2022-02-20 23:59:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:59:48,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:48,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72192732] [2022-02-20 23:59:48,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72192732] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:48,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491919061] [2022-02-20 23:59:48,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:48,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:48,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:48,332 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:59:48,360 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:59:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:48,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:59:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:48,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:48,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {7413#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {7413#true} is VALID [2022-02-20 23:59:48,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {7413#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,654 INFO L272 TraceCheckUtils]: 2: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {7413#true} is VALID [2022-02-20 23:59:48,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {7413#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {7413#true} is VALID [2022-02-20 23:59:48,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {7413#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7413#true} is VALID [2022-02-20 23:59:48,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {7413#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {7413#true} is VALID [2022-02-20 23:59:48,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {7413#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {7413#true} is VALID [2022-02-20 23:59:48,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {7413#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7413#true} is VALID [2022-02-20 23:59:48,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-02-20 23:59:48,656 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7413#true} {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} #169#return; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(sll_circular_create_~len#1 > 1); {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,657 INFO L272 TraceCheckUtils]: 12: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {7413#true} is VALID [2022-02-20 23:59:48,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {7413#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {7413#true} is VALID [2022-02-20 23:59:48,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {7413#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7413#true} is VALID [2022-02-20 23:59:48,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {7413#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {7413#true} is VALID [2022-02-20 23:59:48,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {7413#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {7413#true} is VALID [2022-02-20 23:59:48,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {7413#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7413#true} is VALID [2022-02-20 23:59:48,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-02-20 23:59:48,658 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7413#true} {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} #171#return; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_create_~len#1 > 1); {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(sll_circular_update_at_~index#1 > 0); {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(sll_circular_update_at_~index#1 > 0); {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume { :end_inline_sll_circular_update_at } true; {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {7432#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:59:48,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {7432#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {7433#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} is VALID [2022-02-20 23:59:48,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {7433#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} assume !!(sll_circular_update_at_~index#1 > 0); {7414#false} is VALID [2022-02-20 23:59:48,664 INFO L290 TraceCheckUtils]: 37: Hoare triple {7414#false} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {7414#false} is VALID [2022-02-20 23:59:48,664 INFO L290 TraceCheckUtils]: 38: Hoare triple {7414#false} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {7414#false} is VALID [2022-02-20 23:59:48,664 INFO L290 TraceCheckUtils]: 39: Hoare triple {7414#false} assume !(sll_circular_update_at_~index#1 > 0); {7414#false} is VALID [2022-02-20 23:59:48,664 INFO L290 TraceCheckUtils]: 40: Hoare triple {7414#false} assume !(1 == #valid[sll_circular_update_at_~head#1.base]); {7414#false} is VALID [2022-02-20 23:59:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:59:48,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:48,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {7414#false} assume !(1 == #valid[sll_circular_update_at_~head#1.base]); {7414#false} is VALID [2022-02-20 23:59:48,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {7414#false} assume !(sll_circular_update_at_~index#1 > 0); {7414#false} is VALID [2022-02-20 23:59:48,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {7414#false} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {7414#false} is VALID [2022-02-20 23:59:48,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {7414#false} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {7414#false} is VALID [2022-02-20 23:59:48,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {7433#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} assume !!(sll_circular_update_at_~index#1 > 0); {7414#false} is VALID [2022-02-20 23:59:48,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {7432#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {7433#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} is VALID [2022-02-20 23:59:48,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {7432#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:59:48,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume { :end_inline_sll_circular_update_at } true; {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(sll_circular_update_at_~index#1 > 0); {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(sll_circular_update_at_~index#1 > 0); {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {7431#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:48,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_create_~len#1 > 1); {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,810 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7413#true} {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} #171#return; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-02-20 23:59:48,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {7413#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7413#true} is VALID [2022-02-20 23:59:48,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {7413#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {7413#true} is VALID [2022-02-20 23:59:48,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {7413#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {7413#true} is VALID [2022-02-20 23:59:48,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {7413#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7413#true} is VALID [2022-02-20 23:59:48,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {7413#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {7413#true} is VALID [2022-02-20 23:59:48,811 INFO L272 TraceCheckUtils]: 12: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {7413#true} is VALID [2022-02-20 23:59:48,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(sll_circular_create_~len#1 > 1); {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,813 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7413#true} {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} #169#return; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-02-20 23:59:48,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {7413#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7413#true} is VALID [2022-02-20 23:59:48,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {7413#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {7413#true} is VALID [2022-02-20 23:59:48,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {7413#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {7413#true} is VALID [2022-02-20 23:59:48,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {7413#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {7413#true} is VALID [2022-02-20 23:59:48,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {7413#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {7413#true} is VALID [2022-02-20 23:59:48,814 INFO L272 TraceCheckUtils]: 2: Hoare triple {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {7413#true} is VALID [2022-02-20 23:59:48,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {7413#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {7430#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:48,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {7413#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {7413#true} is VALID [2022-02-20 23:59:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 23:59:48,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491919061] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:48,815 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:59:48,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-02-20 23:59:48,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933140840] [2022-02-20 23:59:48,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:48,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-02-20 23:59:48,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:48,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:59:48,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:48,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:59:48,852 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:48,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:59:48,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:59:48,852 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:59:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:49,147 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-02-20 23:59:49,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:59:49,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-02-20 23:59:49,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:59:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2022-02-20 23:59:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:59:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2022-02-20 23:59:49,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 105 transitions. [2022-02-20 23:59:49,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:49,221 INFO L225 Difference]: With dead ends: 114 [2022-02-20 23:59:49,221 INFO L226 Difference]: Without dead ends: 114 [2022-02-20 23:59:49,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:59:49,222 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 195 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:49,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 265 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:59:49,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-02-20 23:59:49,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2022-02-20 23:59:49,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:49,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 108 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 103 states have internal predecessors, (122), 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:59:49,225 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 108 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 103 states have internal predecessors, (122), 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:59:49,225 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 108 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 103 states have internal predecessors, (122), 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:59:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:49,227 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-02-20 23:59:49,228 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2022-02-20 23:59:49,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:49,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:49,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 103 states have internal predecessors, (122), 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 114 states. [2022-02-20 23:59:49,229 INFO L87 Difference]: Start difference. First operand has 108 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 103 states have internal predecessors, (122), 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 114 states. [2022-02-20 23:59:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:49,230 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-02-20 23:59:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2022-02-20 23:59:49,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:49,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:49,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:49,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:49,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 103 states have internal predecessors, (122), 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:59:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2022-02-20 23:59:49,238 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 41 [2022-02-20 23:59:49,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:49,238 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2022-02-20 23:59:49,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:59:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-02-20 23:59:49,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 23:59:49,239 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:49,239 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:59:49,263 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:59:49,463 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,SelfDestructingSolverStorable15 [2022-02-20 23:59:49,463 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash -192932373, now seen corresponding path program 3 times [2022-02-20 23:59:49,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:49,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319336213] [2022-02-20 23:59:49,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:49,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:49,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:49,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {8158#(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(8);~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; {8133#true} is VALID [2022-02-20 23:59:49,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {8133#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8133#true} is VALID [2022-02-20 23:59:49,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {8133#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {8133#true} is VALID [2022-02-20 23:59:49,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {8133#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {8133#true} is VALID [2022-02-20 23:59:49,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {8133#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8133#true} is VALID [2022-02-20 23:59:49,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {8133#true} assume true; {8133#true} is VALID [2022-02-20 23:59:49,528 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8133#true} {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #169#return; {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:59:49,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:49,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {8158#(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(8);~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; {8133#true} is VALID [2022-02-20 23:59:49,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {8133#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8133#true} is VALID [2022-02-20 23:59:49,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {8133#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {8133#true} is VALID [2022-02-20 23:59:49,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {8133#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {8133#true} is VALID [2022-02-20 23:59:49,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {8133#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8133#true} is VALID [2022-02-20 23:59:49,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {8133#true} assume true; {8133#true} is VALID [2022-02-20 23:59:49,553 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8133#true} {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #171#return; {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:59:49,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 23:59:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:49,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {8158#(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(8);~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; {8133#true} is VALID [2022-02-20 23:59:49,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {8133#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8133#true} is VALID [2022-02-20 23:59:49,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {8133#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {8133#true} is VALID [2022-02-20 23:59:49,562 INFO L290 TraceCheckUtils]: 3: Hoare triple {8133#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {8133#true} is VALID [2022-02-20 23:59:49,562 INFO L290 TraceCheckUtils]: 4: Hoare triple {8133#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8133#true} is VALID [2022-02-20 23:59:49,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {8133#true} assume true; {8133#true} is VALID [2022-02-20 23:59:49,562 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8133#true} {8134#false} #171#return; {8134#false} is VALID [2022-02-20 23:59:49,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {8133#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {8133#true} is VALID [2022-02-20 23:59:49,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {8133#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:59:49,564 INFO L272 TraceCheckUtils]: 2: Hoare triple {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {8158#(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:59:49,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {8158#(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(8);~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; {8133#true} is VALID [2022-02-20 23:59:49,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {8133#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8133#true} is VALID [2022-02-20 23:59:49,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {8133#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {8133#true} is VALID [2022-02-20 23:59:49,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {8133#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {8133#true} is VALID [2022-02-20 23:59:49,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {8133#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8133#true} is VALID [2022-02-20 23:59:49,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {8133#true} assume true; {8133#true} is VALID [2022-02-20 23:59:49,565 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {8133#true} {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #169#return; {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:59:49,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:59:49,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} assume !!(sll_circular_create_~len#1 > 1); {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:59:49,566 INFO L272 TraceCheckUtils]: 12: Hoare triple {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {8158#(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:59:49,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {8158#(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(8);~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; {8133#true} is VALID [2022-02-20 23:59:49,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {8133#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8133#true} is VALID [2022-02-20 23:59:49,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {8133#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {8133#true} is VALID [2022-02-20 23:59:49,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {8133#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {8133#true} is VALID [2022-02-20 23:59:49,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {8133#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8133#true} is VALID [2022-02-20 23:59:49,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {8133#true} assume true; {8133#true} is VALID [2022-02-20 23:59:49,568 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8133#true} {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #171#return; {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:59:49,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:59:49,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 23:59:49,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {8135#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {8150#(<= |ULTIMATE.start_sll_circular_create_~len#1| 1)} is VALID [2022-02-20 23:59:49,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {8150#(<= |ULTIMATE.start_sll_circular_create_~len#1| 1)} assume !!(sll_circular_create_~len#1 > 1); {8134#false} is VALID [2022-02-20 23:59:49,570 INFO L272 TraceCheckUtils]: 24: Hoare triple {8134#false} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {8158#(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:59:49,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {8158#(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(8);~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; {8133#true} is VALID [2022-02-20 23:59:49,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {8133#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8133#true} is VALID [2022-02-20 23:59:49,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {8133#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {8133#true} is VALID [2022-02-20 23:59:49,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {8133#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {8133#true} is VALID [2022-02-20 23:59:49,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {8133#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8133#true} is VALID [2022-02-20 23:59:49,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {8133#true} assume true; {8133#true} is VALID [2022-02-20 23:59:49,571 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8133#true} {8134#false} #171#return; {8134#false} is VALID [2022-02-20 23:59:49,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {8134#false} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {8134#false} is VALID [2022-02-20 23:59:49,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {8134#false} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {8134#false} is VALID [2022-02-20 23:59:49,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {8134#false} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {8134#false} is VALID [2022-02-20 23:59:49,571 INFO L290 TraceCheckUtils]: 35: Hoare triple {8134#false} assume !(sll_circular_create_~len#1 > 1); {8134#false} is VALID [2022-02-20 23:59:49,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {8134#false} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {8134#false} is VALID [2022-02-20 23:59:49,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {8134#false} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {8134#false} is VALID [2022-02-20 23:59:49,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {8134#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {8134#false} is VALID [2022-02-20 23:59:49,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {8134#false} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {8134#false} is VALID [2022-02-20 23:59:49,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {8134#false} assume !!(sll_circular_update_at_~index#1 > 0); {8134#false} is VALID [2022-02-20 23:59:49,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {8134#false} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {8134#false} is VALID [2022-02-20 23:59:49,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {8134#false} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {8134#false} is VALID [2022-02-20 23:59:49,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {8134#false} assume !(sll_circular_update_at_~index#1 > 0); {8134#false} is VALID [2022-02-20 23:59:49,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {8134#false} assume !(1 == #valid[sll_circular_update_at_~head#1.base]); {8134#false} is VALID [2022-02-20 23:59:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-20 23:59:49,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:49,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319336213] [2022-02-20 23:59:49,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319336213] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:49,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256600461] [2022-02-20 23:59:49,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:59:49,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:49,576 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:49,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 23:59:49,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 23:59:49,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:59:49,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:59:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:49,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:49,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {8133#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {8133#true} is VALID [2022-02-20 23:59:49,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {8133#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:59:49,885 INFO L272 TraceCheckUtils]: 2: Hoare triple {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {8133#true} is VALID [2022-02-20 23:59:49,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {8133#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {8133#true} is VALID [2022-02-20 23:59:49,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {8133#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8133#true} is VALID [2022-02-20 23:59:49,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {8133#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {8133#true} is VALID [2022-02-20 23:59:49,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {8133#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {8133#true} is VALID [2022-02-20 23:59:49,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {8133#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8133#true} is VALID [2022-02-20 23:59:49,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {8133#true} assume true; {8133#true} is VALID [2022-02-20 23:59:49,886 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {8133#true} {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} #169#return; {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:59:49,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:59:49,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} assume !!(sll_circular_create_~len#1 > 1); {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:59:49,887 INFO L272 TraceCheckUtils]: 12: Hoare triple {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {8133#true} is VALID [2022-02-20 23:59:49,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {8133#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {8133#true} is VALID [2022-02-20 23:59:49,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {8133#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8133#true} is VALID [2022-02-20 23:59:49,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {8133#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {8133#true} is VALID [2022-02-20 23:59:49,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {8133#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {8133#true} is VALID [2022-02-20 23:59:49,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {8133#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8133#true} is VALID [2022-02-20 23:59:49,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {8133#true} assume true; {8133#true} is VALID [2022-02-20 23:59:49,888 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8133#true} {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} #171#return; {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:59:49,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:59:49,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} is VALID [2022-02-20 23:59:49,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {8165#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {8150#(<= |ULTIMATE.start_sll_circular_create_~len#1| 1)} is VALID [2022-02-20 23:59:49,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {8150#(<= |ULTIMATE.start_sll_circular_create_~len#1| 1)} assume !!(sll_circular_create_~len#1 > 1); {8134#false} is VALID [2022-02-20 23:59:49,889 INFO L272 TraceCheckUtils]: 24: Hoare triple {8134#false} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {8134#false} is VALID [2022-02-20 23:59:49,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {8134#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {8134#false} is VALID [2022-02-20 23:59:49,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {8134#false} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8134#false} is VALID [2022-02-20 23:59:49,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {8134#false} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {8134#false} is VALID [2022-02-20 23:59:49,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {8134#false} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {8134#false} is VALID [2022-02-20 23:59:49,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {8134#false} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8134#false} is VALID [2022-02-20 23:59:49,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {8134#false} assume true; {8134#false} is VALID [2022-02-20 23:59:49,890 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8134#false} {8134#false} #171#return; {8134#false} is VALID [2022-02-20 23:59:49,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {8134#false} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {8134#false} is VALID [2022-02-20 23:59:49,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {8134#false} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {8134#false} is VALID [2022-02-20 23:59:49,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {8134#false} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {8134#false} is VALID [2022-02-20 23:59:49,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {8134#false} assume !(sll_circular_create_~len#1 > 1); {8134#false} is VALID [2022-02-20 23:59:49,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {8134#false} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {8134#false} is VALID [2022-02-20 23:59:49,890 INFO L290 TraceCheckUtils]: 37: Hoare triple {8134#false} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {8134#false} is VALID [2022-02-20 23:59:49,890 INFO L290 TraceCheckUtils]: 38: Hoare triple {8134#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {8134#false} is VALID [2022-02-20 23:59:49,890 INFO L290 TraceCheckUtils]: 39: Hoare triple {8134#false} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {8134#false} is VALID [2022-02-20 23:59:49,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {8134#false} assume !!(sll_circular_update_at_~index#1 > 0); {8134#false} is VALID [2022-02-20 23:59:49,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {8134#false} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {8134#false} is VALID [2022-02-20 23:59:49,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {8134#false} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {8134#false} is VALID [2022-02-20 23:59:49,891 INFO L290 TraceCheckUtils]: 43: Hoare triple {8134#false} assume !(sll_circular_update_at_~index#1 > 0); {8134#false} is VALID [2022-02-20 23:59:49,891 INFO L290 TraceCheckUtils]: 44: Hoare triple {8134#false} assume !(1 == #valid[sll_circular_update_at_~head#1.base]); {8134#false} is VALID [2022-02-20 23:59:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:59:49,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:49,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256600461] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:49,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:59:49,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-02-20 23:59:49,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962784572] [2022-02-20 23:59:49,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:49,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 45 [2022-02-20 23:59:49,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:49,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:59:49,926 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:59:49,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:59:49,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:49,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:59:49,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:59:49,926 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:59:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:50,007 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-02-20 23:59:50,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:59:50,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 45 [2022-02-20 23:59:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:59:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-02-20 23:59:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:59:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-02-20 23:59:50,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2022-02-20 23:59:50,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:50,079 INFO L225 Difference]: With dead ends: 92 [2022-02-20 23:59:50,079 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 23:59:50,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 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:59:50,080 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 116 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 84 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:59:50,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 84 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:50,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 23:59:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-02-20 23:59:50,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:50,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 88 states have internal predecessors, (105), 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:59:50,084 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 88 states have internal predecessors, (105), 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:59:50,084 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 88 states have internal predecessors, (105), 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:59:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:50,086 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-02-20 23:59:50,086 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2022-02-20 23:59:50,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:50,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:50,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 88 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 92 states. [2022-02-20 23:59:50,087 INFO L87 Difference]: Start difference. First operand has 92 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 88 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 92 states. [2022-02-20 23:59:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:50,088 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-02-20 23:59:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2022-02-20 23:59:50,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:50,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:50,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:50,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 88 states have internal predecessors, (105), 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:59:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2022-02-20 23:59:50,090 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 45 [2022-02-20 23:59:50,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:50,091 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2022-02-20 23:59:50,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:59:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2022-02-20 23:59:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 23:59:50,092 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:50,092 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:50,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:50,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-20 23:59:50,308 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:50,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:50,308 INFO L85 PathProgramCache]: Analyzing trace with hash 884092027, now seen corresponding path program 2 times [2022-02-20 23:59:50,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:50,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458837353] [2022-02-20 23:59:50,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:50,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:50,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:50,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {8684#(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(8);~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; {8662#true} is VALID [2022-02-20 23:59:50,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {8662#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8662#true} is VALID [2022-02-20 23:59:50,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {8662#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {8662#true} is VALID [2022-02-20 23:59:50,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {8662#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {8662#true} is VALID [2022-02-20 23:59:50,452 INFO L290 TraceCheckUtils]: 4: Hoare triple {8662#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8662#true} is VALID [2022-02-20 23:59:50,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {8662#true} assume true; {8662#true} is VALID [2022-02-20 23:59:50,452 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8662#true} {8662#true} #169#return; {8662#true} is VALID [2022-02-20 23:59:50,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:50,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {8684#(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(8);~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; {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:50,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:50,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:50,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:50,491 INFO L290 TraceCheckUtils]: 4: Hoare triple {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8686#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:50,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {8686#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} assume true; {8686#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:50,492 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8686#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} {8662#true} #171#return; {8678#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 23:59:50,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {8662#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {8662#true} is VALID [2022-02-20 23:59:50,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {8662#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {8662#true} is VALID [2022-02-20 23:59:50,493 INFO L272 TraceCheckUtils]: 2: Hoare triple {8662#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {8684#(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:59:50,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {8684#(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(8);~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; {8662#true} is VALID [2022-02-20 23:59:50,493 INFO L290 TraceCheckUtils]: 4: Hoare triple {8662#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8662#true} is VALID [2022-02-20 23:59:50,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {8662#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {8662#true} is VALID [2022-02-20 23:59:50,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {8662#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {8662#true} is VALID [2022-02-20 23:59:50,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {8662#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8662#true} is VALID [2022-02-20 23:59:50,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {8662#true} assume true; {8662#true} is VALID [2022-02-20 23:59:50,493 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {8662#true} {8662#true} #169#return; {8662#true} is VALID [2022-02-20 23:59:50,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {8662#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {8662#true} is VALID [2022-02-20 23:59:50,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {8662#true} assume !!(sll_circular_create_~len#1 > 1); {8662#true} is VALID [2022-02-20 23:59:50,494 INFO L272 TraceCheckUtils]: 12: Hoare triple {8662#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {8684#(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:59:50,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {8684#(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(8);~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; {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:50,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:50,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:50,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} is VALID [2022-02-20 23:59:50,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {8685#(and (= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8686#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:50,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {8686#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} assume true; {8686#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:50,498 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8686#(and (= (select |#length| |node_create_#res#1.base|) 8) (= 0 |node_create_#res#1.offset|))} {8662#true} #171#return; {8678#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 23:59:50,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {8678#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {8679#(and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {8679#(and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {8679#(and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {8679#(and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {8680#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 23:59:50,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {8680#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)))} assume !(sll_circular_create_~len#1 > 1); {8680#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 23:59:50,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {8680#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {8680#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 23:59:50,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {8680#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {8681#(and (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#res#1.base|)))} is VALID [2022-02-20 23:59:50,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {8681#(and (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#res#1.base|)))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(sll_circular_update_at_~index#1 > 0); {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(sll_circular_update_at_~index#1 > 0); {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_sll_circular_update_at } true; {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(sll_circular_update_at_~index#1 > 0); {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_sll_circular_update_at } true; {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_~i~0#1 > -1); {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_~i~0#1 := main_~len~0#1 - 1; {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:50,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {8682#(and (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 > -1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {8683#(and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0))} is VALID [2022-02-20 23:59:50,508 INFO L290 TraceCheckUtils]: 43: Hoare triple {8683#(and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0))} assume !!(sll_circular_get_data_at_~index#1 > 0); {8683#(and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0))} is VALID [2022-02-20 23:59:50,508 INFO L290 TraceCheckUtils]: 44: Hoare triple {8683#(and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0))} assume !(4 + sll_circular_get_data_at_~head#1.offset <= #length[sll_circular_get_data_at_~head#1.base] && 0 <= sll_circular_get_data_at_~head#1.offset); {8663#false} is VALID [2022-02-20 23:59:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:59:50,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:50,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458837353] [2022-02-20 23:59:50,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458837353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:50,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:50,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:59:50,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949901164] [2022-02-20 23:59:50,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:50,509 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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 45 [2022-02-20 23:59:50,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:50,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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:59:50,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:50,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:59:50,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:50,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:59:50,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:59:50,539 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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:59:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:51,218 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-02-20 23:59:51,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:59:51,218 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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 45 [2022-02-20 23:59:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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:59:51,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-02-20 23:59:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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:59:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-02-20 23:59:51,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-02-20 23:59:51,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:51,316 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:59:51,316 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 23:59:51,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:59:51,317 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 409 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:51,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 294 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:59:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 23:59:51,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2022-02-20 23:59:51,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:51,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 92 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 88 states have internal predecessors, (101), 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:59:51,320 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 92 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 88 states have internal predecessors, (101), 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:59:51,320 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 92 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 88 states have internal predecessors, (101), 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:59:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:51,323 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-02-20 23:59:51,323 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 148 transitions. [2022-02-20 23:59:51,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:51,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:51,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 88 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 132 states. [2022-02-20 23:59:51,324 INFO L87 Difference]: Start difference. First operand has 92 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 88 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 132 states. [2022-02-20 23:59:51,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:51,326 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-02-20 23:59:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 148 transitions. [2022-02-20 23:59:51,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:51,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:51,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:51,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 88 states have internal predecessors, (101), 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:59:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-02-20 23:59:51,328 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 45 [2022-02-20 23:59:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:51,328 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-02-20 23:59:51,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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:59:51,329 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-02-20 23:59:51,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 23:59:51,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:51,329 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:51,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:59:51,330 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:51,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140989, now seen corresponding path program 1 times [2022-02-20 23:59:51,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:51,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223342104] [2022-02-20 23:59:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:51,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:51,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:51,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {9208#(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(8);~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; {9187#true} is VALID [2022-02-20 23:59:51,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {9187#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9187#true} is VALID [2022-02-20 23:59:51,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {9187#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {9187#true} is VALID [2022-02-20 23:59:51,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {9187#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {9187#true} is VALID [2022-02-20 23:59:51,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {9187#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9187#true} is VALID [2022-02-20 23:59:51,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {9187#true} assume true; {9187#true} is VALID [2022-02-20 23:59:51,466 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9187#true} {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #169#return; {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:51,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {9208#(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(8);~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; {9187#true} is VALID [2022-02-20 23:59:51,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {9187#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9187#true} is VALID [2022-02-20 23:59:51,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {9187#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {9187#true} is VALID [2022-02-20 23:59:51,480 INFO L290 TraceCheckUtils]: 3: Hoare triple {9187#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {9187#true} is VALID [2022-02-20 23:59:51,480 INFO L290 TraceCheckUtils]: 4: Hoare triple {9187#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9187#true} is VALID [2022-02-20 23:59:51,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {9187#true} assume true; {9187#true} is VALID [2022-02-20 23:59:51,481 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9187#true} {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #171#return; {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:51,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {9187#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {9187#true} is VALID [2022-02-20 23:59:51,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {9187#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:51,483 INFO L272 TraceCheckUtils]: 2: Hoare triple {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {9208#(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:59:51,483 INFO L290 TraceCheckUtils]: 3: Hoare triple {9208#(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(8);~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; {9187#true} is VALID [2022-02-20 23:59:51,483 INFO L290 TraceCheckUtils]: 4: Hoare triple {9187#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9187#true} is VALID [2022-02-20 23:59:51,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {9187#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {9187#true} is VALID [2022-02-20 23:59:51,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {9187#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {9187#true} is VALID [2022-02-20 23:59:51,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {9187#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9187#true} is VALID [2022-02-20 23:59:51,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {9187#true} assume true; {9187#true} is VALID [2022-02-20 23:59:51,487 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {9187#true} {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #169#return; {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:51,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:51,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} assume !!(sll_circular_create_~len#1 > 1); {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:51,489 INFO L272 TraceCheckUtils]: 12: Hoare triple {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {9208#(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:59:51,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {9208#(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(8);~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; {9187#true} is VALID [2022-02-20 23:59:51,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {9187#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9187#true} is VALID [2022-02-20 23:59:51,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {9187#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {9187#true} is VALID [2022-02-20 23:59:51,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {9187#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {9187#true} is VALID [2022-02-20 23:59:51,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {9187#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9187#true} is VALID [2022-02-20 23:59:51,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {9187#true} assume true; {9187#true} is VALID [2022-02-20 23:59:51,491 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {9187#true} {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #171#return; {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:51,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:51,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 23:59:51,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {9189#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_create_~len#1 > 1); {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(sll_circular_update_at_~index#1 > 0); {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_update_at_~index#1 > 0); {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume { :end_inline_sll_circular_update_at } true; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_update_at_~index#1 > 0); {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume { :end_inline_sll_circular_update_at } true; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(main_~i~0#1 > -1); {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_~i~0#1 := main_~len~0#1 - 1; {9205#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:51,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {9205#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 > -1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {9206#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} is VALID [2022-02-20 23:59:51,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {9206#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} assume !!(sll_circular_get_data_at_~index#1 > 0); {9206#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} is VALID [2022-02-20 23:59:51,501 INFO L290 TraceCheckUtils]: 44: Hoare triple {9206#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} SUMMARY for call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4); srcloc: L608 {9206#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} is VALID [2022-02-20 23:59:51,501 INFO L290 TraceCheckUtils]: 45: Hoare triple {9206#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {9207#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)} is VALID [2022-02-20 23:59:51,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {9207#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)} assume !!(sll_circular_get_data_at_~index#1 > 0); {9188#false} is VALID [2022-02-20 23:59:51,502 INFO L290 TraceCheckUtils]: 47: Hoare triple {9188#false} assume !(1 == #valid[sll_circular_get_data_at_~head#1.base]); {9188#false} is VALID [2022-02-20 23:59:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 23:59:51,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:51,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223342104] [2022-02-20 23:59:51,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223342104] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:51,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693774827] [2022-02-20 23:59:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:51,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:51,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:51,505 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:51,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 23:59:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:51,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:59:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:51,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:51,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {9187#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {9187#true} is VALID [2022-02-20 23:59:51,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {9187#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,868 INFO L272 TraceCheckUtils]: 2: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {9187#true} is VALID [2022-02-20 23:59:51,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {9187#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {9187#true} is VALID [2022-02-20 23:59:51,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {9187#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9187#true} is VALID [2022-02-20 23:59:51,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {9187#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {9187#true} is VALID [2022-02-20 23:59:51,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {9187#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {9187#true} is VALID [2022-02-20 23:59:51,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {9187#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9187#true} is VALID [2022-02-20 23:59:51,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {9187#true} assume true; {9187#true} is VALID [2022-02-20 23:59:51,870 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {9187#true} {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} #169#return; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(sll_circular_create_~len#1 > 1); {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,871 INFO L272 TraceCheckUtils]: 12: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {9187#true} is VALID [2022-02-20 23:59:51,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {9187#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {9187#true} is VALID [2022-02-20 23:59:51,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {9187#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9187#true} is VALID [2022-02-20 23:59:51,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {9187#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {9187#true} is VALID [2022-02-20 23:59:51,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {9187#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {9187#true} is VALID [2022-02-20 23:59:51,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {9187#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9187#true} is VALID [2022-02-20 23:59:51,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {9187#true} assume true; {9187#true} is VALID [2022-02-20 23:59:51,873 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {9187#true} {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} #171#return; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_create_~len#1 > 1); {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(sll_circular_update_at_~index#1 > 0); {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_update_at_~index#1 > 0); {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume { :end_inline_sll_circular_update_at } true; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_update_at_~index#1 > 0); {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume { :end_inline_sll_circular_update_at } true; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(main_~i~0#1 > -1); {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 23:59:51,893 INFO L290 TraceCheckUtils]: 41: Hoare triple {9204#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_~i~0#1 := main_~len~0#1 - 1; {9205#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:59:51,894 INFO L290 TraceCheckUtils]: 42: Hoare triple {9205#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 > -1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {9206#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} is VALID [2022-02-20 23:59:51,894 INFO L290 TraceCheckUtils]: 43: Hoare triple {9206#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} assume !!(sll_circular_get_data_at_~index#1 > 0); {9206#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} is VALID [2022-02-20 23:59:51,895 INFO L290 TraceCheckUtils]: 44: Hoare triple {9206#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} SUMMARY for call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4); srcloc: L608 {9206#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} is VALID [2022-02-20 23:59:51,895 INFO L290 TraceCheckUtils]: 45: Hoare triple {9206#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {9207#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)} is VALID [2022-02-20 23:59:51,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {9207#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)} assume !!(sll_circular_get_data_at_~index#1 > 0); {9188#false} is VALID [2022-02-20 23:59:51,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {9188#false} assume !(1 == #valid[sll_circular_get_data_at_~head#1.base]); {9188#false} is VALID [2022-02-20 23:59:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-20 23:59:51,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:51,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693774827] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:51,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:59:51,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-02-20 23:59:51,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914615516] [2022-02-20 23:59:51,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:51,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-02-20 23:59:51,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:51,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:51,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:51,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:59:51,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:51,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:59:51,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:59:51,933 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:52,089 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-02-20 23:59:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:59:52,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-02-20 23:59:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:52,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-02-20 23:59:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-02-20 23:59:52,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2022-02-20 23:59:52,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:52,159 INFO L225 Difference]: With dead ends: 88 [2022-02-20 23:59:52,160 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 23:59:52,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:59:52,162 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 124 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:52,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 143 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 23:59:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-02-20 23:59:52,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:52,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 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:59:52,166 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 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:59:52,166 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 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:59:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:52,167 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-02-20 23:59:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-02-20 23:59:52,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:52,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:52,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 88 states. [2022-02-20 23:59:52,168 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 88 states. [2022-02-20 23:59:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:52,170 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-02-20 23:59:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-02-20 23:59:52,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:52,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:52,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:52,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 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:59:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-02-20 23:59:52,174 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 48 [2022-02-20 23:59:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:52,174 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-02-20 23:59:52,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:59:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-02-20 23:59:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 23:59:52,175 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:52,175 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:52,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:52,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:52,391 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-20 23:59:52,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:52,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140934, now seen corresponding path program 1 times [2022-02-20 23:59:52,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:52,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644905632] [2022-02-20 23:59:52,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:52,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:52,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:59:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:52,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {9744#(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(8);~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; {9710#true} is VALID [2022-02-20 23:59:52,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {9710#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9710#true} is VALID [2022-02-20 23:59:52,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {9710#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:52,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:52,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9746#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:52,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {9746#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {9746#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:52,818 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9746#(= (select |#valid| |node_create_#res#1.base|) 1)} {9710#true} #169#return; {9719#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:59:52,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:59:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:52,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {9744#(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(8);~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; {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:52,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:52,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 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: L576-1 {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:52,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:52,873 INFO L290 TraceCheckUtils]: 4: Hoare triple {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9748#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:52,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {9748#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} assume true; {9748#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:52,874 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9748#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} {9720#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #171#return; {9728#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 23:59:52,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {9710#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {9710#true} is VALID [2022-02-20 23:59:52,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {9710#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {9710#true} is VALID [2022-02-20 23:59:52,875 INFO L272 TraceCheckUtils]: 2: Hoare triple {9710#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {9744#(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:59:52,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {9744#(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(8);~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; {9710#true} is VALID [2022-02-20 23:59:52,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {9710#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9710#true} is VALID [2022-02-20 23:59:52,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {9710#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:52,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:52,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9746#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:52,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {9746#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {9746#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:52,878 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {9746#(= (select |#valid| |node_create_#res#1.base|) 1)} {9710#true} #169#return; {9719#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:59:52,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {9719#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {9720#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:59:52,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {9720#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} assume !!(sll_circular_create_~len#1 > 1); {9720#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:59:52,879 INFO L272 TraceCheckUtils]: 12: Hoare triple {9720#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {9744#(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:59:52,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {9744#(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(8);~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; {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:52,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:52,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 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: L576-1 {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:52,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:52,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {9747#(and (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9748#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:52,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {9748#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} assume true; {9748#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:59:52,887 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {9748#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|))} {9720#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #171#return; {9728#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 23:59:52,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {9728#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {9729#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:52,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {9729#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {9730#(and (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} is VALID [2022-02-20 23:59:52,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {9730#(and (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {9731#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} is VALID [2022-02-20 23:59:52,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {9731#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} assume !(sll_circular_create_~len#1 > 1); {9731#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} is VALID [2022-02-20 23:59:52,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {9731#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {9732#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} is VALID [2022-02-20 23:59:52,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {9732#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {9733#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} is VALID [2022-02-20 23:59:52,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {9733#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {9734#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:52,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {9734#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {9735#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:52,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {9735#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(sll_circular_update_at_~index#1 > 0); {9735#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:52,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {9735#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {9736#(and (not (= |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:52,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {9736#(and (not (= |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {9737#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:52,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {9737#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(sll_circular_update_at_~index#1 > 0); {9737#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:52,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {9737#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {9738#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:52,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {9738#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_sll_circular_update_at } true; {9738#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:52,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {9738#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {9738#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:59:52,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {9738#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {9739#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-20 23:59:52,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {9739#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.offset|)))} assume !(sll_circular_update_at_~index#1 > 0); {9739#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-20 23:59:52,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {9739#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.offset|)))} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {9740#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1)} is VALID [2022-02-20 23:59:52,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {9740#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1)} assume { :end_inline_sll_circular_update_at } true; {9740#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1)} is VALID [2022-02-20 23:59:52,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {9740#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {9740#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1)} is VALID [2022-02-20 23:59:52,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {9740#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1)} assume !(main_~i~0#1 > -1); {9740#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1)} is VALID [2022-02-20 23:59:52,901 INFO L290 TraceCheckUtils]: 41: Hoare triple {9740#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1)} main_~i~0#1 := main_~len~0#1 - 1; {9740#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1)} is VALID [2022-02-20 23:59:52,901 INFO L290 TraceCheckUtils]: 42: Hoare triple {9740#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1)} assume !!(main_~i~0#1 > -1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {9741#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) 1)} is VALID [2022-02-20 23:59:52,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {9741#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) 1)} assume !!(sll_circular_get_data_at_~index#1 > 0); {9741#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) 1)} is VALID [2022-02-20 23:59:52,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {9741#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) 1)} SUMMARY for call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4); srcloc: L608 {9742#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_#t~mem9#1.base|) 1)} is VALID [2022-02-20 23:59:52,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {9742#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_#t~mem9#1.base|) 1)} sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {9743#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1)} is VALID [2022-02-20 23:59:52,903 INFO L290 TraceCheckUtils]: 46: Hoare triple {9743#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1)} assume !(sll_circular_get_data_at_~index#1 > 0); {9743#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1)} is VALID [2022-02-20 23:59:52,903 INFO L290 TraceCheckUtils]: 47: Hoare triple {9743#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1)} assume !(1 == #valid[sll_circular_get_data_at_~head#1.base]); {9711#false} is VALID [2022-02-20 23:59:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:52,904 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:52,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644905632] [2022-02-20 23:59:52,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644905632] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:52,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153040514] [2022-02-20 23:59:52,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:52,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:52,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:52,908 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:52,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 23:59:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:53,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 74 conjunts are in the unsatisfiable core [2022-02-20 23:59:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:53,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:53,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:53,268 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:59:53,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:59:53,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:59:53,401 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:59:53,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-02-20 23:59:53,659 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:59:53,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-02-20 23:59:53,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:53,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-02-20 23:59:53,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 23:59:53,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {9710#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {9710#true} is VALID [2022-02-20 23:59:53,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {9710#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {9710#true} is VALID [2022-02-20 23:59:53,977 INFO L272 TraceCheckUtils]: 2: Hoare triple {9710#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {9710#true} is VALID [2022-02-20 23:59:53,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {9710#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:53,978 INFO L290 TraceCheckUtils]: 4: Hoare triple {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:53,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {9745#(= 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: L576-1 {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:53,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:53,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {9745#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9746#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:53,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {9746#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {9746#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:53,981 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {9746#(= (select |#valid| |node_create_#res#1.base|) 1)} {9710#true} #169#return; {9719#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:59:53,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {9719#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {9720#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:59:53,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {9720#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} assume !!(sll_circular_create_~len#1 > 1); {9720#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 23:59:53,982 INFO L272 TraceCheckUtils]: 12: Hoare triple {9720#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {9788#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:59:53,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {9788#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {9792#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:53,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {9792#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {9792#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:53,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {9792#(= 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: L576-1 {9792#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:53,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {9792#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {9792#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:53,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {9792#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9805#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} is VALID [2022-02-20 23:59:53,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {9805#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} assume true; {9805#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} is VALID [2022-02-20 23:59:53,987 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {9805#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} {9720#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #171#return; {9812#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 23:59:53,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {9812#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {9816#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:53,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {9816#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {9820#(and (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} is VALID [2022-02-20 23:59:53,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {9820#(and (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {9824#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:53,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {9824#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(sll_circular_create_~len#1 > 1); {9824#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 23:59:53,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {9824#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {9831#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} is VALID [2022-02-20 23:59:53,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {9831#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {9835#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} is VALID [2022-02-20 23:59:53,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {9835#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:53,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {9843#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:53,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {9843#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} assume !!(sll_circular_update_at_~index#1 > 0); {9843#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:53,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {9843#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {9850#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (= |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-20 23:59:53,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {9850#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1) (= |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {9854#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:53,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {9854#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} assume !(sll_circular_update_at_~index#1 > 0); {9854#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:53,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {9854#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:53,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} assume { :end_inline_sll_circular_update_at } true; {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:53,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:53,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {9870#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:53,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {9870#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} assume !(sll_circular_update_at_~index#1 > 0); {9870#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:53,999 INFO L290 TraceCheckUtils]: 37: Hoare triple {9870#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:53,999 INFO L290 TraceCheckUtils]: 38: Hoare triple {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} assume { :end_inline_sll_circular_update_at } true; {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:54,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:54,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} assume !(main_~i~0#1 > -1); {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:54,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} main_~i~0#1 := main_~len~0#1 - 1; {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} is VALID [2022-02-20 23:59:54,002 INFO L290 TraceCheckUtils]: 42: Hoare triple {9839#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 1))} assume !!(main_~i~0#1 > -1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {9892#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) 1) (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))))} is VALID [2022-02-20 23:59:54,002 INFO L290 TraceCheckUtils]: 43: Hoare triple {9892#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) 1) (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))))} assume !!(sll_circular_get_data_at_~index#1 > 0); {9892#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) 1) (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))))} is VALID [2022-02-20 23:59:54,003 INFO L290 TraceCheckUtils]: 44: Hoare triple {9892#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) 1) (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))))} SUMMARY for call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4); srcloc: L608 {9742#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_#t~mem9#1.base|) 1)} is VALID [2022-02-20 23:59:54,003 INFO L290 TraceCheckUtils]: 45: Hoare triple {9742#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_#t~mem9#1.base|) 1)} sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {9743#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1)} is VALID [2022-02-20 23:59:54,004 INFO L290 TraceCheckUtils]: 46: Hoare triple {9743#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1)} assume !(sll_circular_get_data_at_~index#1 > 0); {9743#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1)} is VALID [2022-02-20 23:59:54,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {9743#(= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1)} assume !(1 == #valid[sll_circular_get_data_at_~head#1.base]); {9711#false} is VALID [2022-02-20 23:59:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 23:59:54,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:58,398 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1754) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-02-20 23:59:58,525 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-02-20 23:59:58,526 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 29 treesize of output 28 [2022-02-20 23:59:58,538 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1753))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1754)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-02-20 23:59:58,552 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1753))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1754)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2022-02-20 23:59:58,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:59:58,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2022-02-20 23:59:58,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 112 [2022-02-20 23:59:58,596 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 108 treesize of output 98 [2022-02-20 23:59:58,598 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 98 treesize of output 94 [2022-02-20 23:59:58,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153040514] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:58,768 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:59:58,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 39 [2022-02-20 23:59:58,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412298590] [2022-02-20 23:59:58,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:58,768 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-02-20 23:59:58,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:58,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:59:58,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:58,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-20 23:59:58,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:58,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-20 23:59:58,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1930, Unknown=94, NotChecked=276, Total=2450 [2022-02-20 23:59:58,832 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 00:00:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:01,879 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-02-21 00:00:01,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-21 00:00:01,880 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-02-21 00:00:01,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 00:00:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 137 transitions. [2022-02-21 00:00:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 00:00:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 137 transitions. [2022-02-21 00:00:01,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 137 transitions. [2022-02-21 00:00:02,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:02,002 INFO L225 Difference]: With dead ends: 145 [2022-02-21 00:00:02,002 INFO L226 Difference]: Without dead ends: 145 [2022-02-21 00:00:02,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=391, Invalid=3429, Unknown=98, NotChecked=372, Total=4290 [2022-02-21 00:00:02,004 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 500 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:02,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 1066 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-21 00:00:02,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-02-21 00:00:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 87. [2022-02-21 00:00:02,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:02,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 83 states have internal predecessors, (91), 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-21 00:00:02,007 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 83 states have internal predecessors, (91), 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-21 00:00:02,007 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 83 states have internal predecessors, (91), 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-21 00:00:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:02,009 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-02-21 00:00:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions. [2022-02-21 00:00:02,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:02,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:02,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 145 states. [2022-02-21 00:00:02,010 INFO L87 Difference]: Start difference. First operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 145 states. [2022-02-21 00:00:02,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:02,012 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-02-21 00:00:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions. [2022-02-21 00:00:02,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:02,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:02,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:02,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 83 states have internal predecessors, (91), 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-21 00:00:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-02-21 00:00:02,015 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 48 [2022-02-21 00:00:02,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:02,015 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-02-21 00:00:02,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 00:00:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-02-21 00:00:02,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-21 00:00:02,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:02,016 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:02,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-21 00:00:02,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:02,241 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-21 00:00:02,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:02,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140935, now seen corresponding path program 1 times [2022-02-21 00:00:02,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:02,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373329458] [2022-02-21 00:00:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:02,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:02,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 00:00:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:02,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {10593#(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(8);~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; {10594#(and (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:02,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {10594#(and (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {10594#(and (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:02,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {10594#(and (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {10595#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:02,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {10595#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {10595#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:02,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {10595#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {10596#(and (<= 8 (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-21 00:00:02,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {10596#(and (<= 8 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {10596#(and (<= 8 (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-21 00:00:02,903 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10596#(and (<= 8 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {10559#true} #169#return; {10568#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} is VALID [2022-02-21 00:00:02,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 00:00:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:03,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {10593#(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(8);~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; {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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-21 00:00:03,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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); {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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-21 00:00:03,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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: L576-1 {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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-21 00:00:03,018 INFO L290 TraceCheckUtils]: 3: Hoare triple {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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-21 00:00:03,019 INFO L290 TraceCheckUtils]: 4: Hoare triple {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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; {10598#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-21 00:00:03,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {10598#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)) (= 0 |node_create_#res#1.offset|))} assume true; {10598#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-21 00:00:03,021 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10598#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)) (= 0 |node_create_#res#1.offset|))} {10569#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #171#return; {10577#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-21 00:00:03,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {10559#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {10559#true} is VALID [2022-02-21 00:00:03,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {10559#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {10559#true} is VALID [2022-02-21 00:00:03,022 INFO L272 TraceCheckUtils]: 2: Hoare triple {10559#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {10593#(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-21 00:00:03,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {10593#(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(8);~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; {10594#(and (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:03,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {10594#(and (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {10594#(and (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:03,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {10594#(and (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {10595#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:03,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {10595#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {10595#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:03,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {10595#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= 8 (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {10596#(and (<= 8 (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-21 00:00:03,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {10596#(and (<= 8 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {10596#(and (<= 8 (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-21 00:00:03,027 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {10596#(and (<= 8 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {10559#true} #169#return; {10568#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} is VALID [2022-02-21 00:00:03,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {10568#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {10569#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-21 00:00:03,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {10569#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} assume !!(sll_circular_create_~len#1 > 1); {10569#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-21 00:00:03,029 INFO L272 TraceCheckUtils]: 12: Hoare triple {10569#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {10593#(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-21 00:00:03,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {10593#(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(8);~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; {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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-21 00:00:03,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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); {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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-21 00:00:03,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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: L576-1 {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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-21 00:00:03,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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-21 00:00:03,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {10597#(and (= |node_create_~temp~0#1.offset| 0) (= (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; {10598#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-21 00:00:03,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {10598#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)) (= 0 |node_create_#res#1.offset|))} assume true; {10598#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-21 00:00:03,034 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {10598#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)) (= 0 |node_create_#res#1.offset|))} {10569#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #171#return; {10577#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-21 00:00:03,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {10577#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {10578#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-21 00:00:03,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {10578#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {10579#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} is VALID [2022-02-21 00:00:03,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {10579#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {10580#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} is VALID [2022-02-21 00:00:03,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {10580#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} assume !(sll_circular_create_~len#1 > 1); {10580#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} is VALID [2022-02-21 00:00:03,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {10580#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {10581#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} is VALID [2022-02-21 00:00:03,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {10581#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {10582#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} is VALID [2022-02-21 00:00:03,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {10582#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {10583#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {10583#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {10584#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {10584#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(sll_circular_update_at_~index#1 > 0); {10584#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {10584#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {10585#(and (not (= |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {10585#(and (not (= |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {10586#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {10586#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(sll_circular_update_at_~index#1 > 0); {10586#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {10586#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {10587#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {10587#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_sll_circular_update_at } true; {10587#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {10587#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {10587#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {10587#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {10588#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-21 00:00:03,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {10588#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} assume !(sll_circular_update_at_~index#1 > 0); {10588#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-21 00:00:03,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {10588#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {10589#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-21 00:00:03,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {10589#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} assume { :end_inline_sll_circular_update_at } true; {10589#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-21 00:00:03,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {10589#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {10589#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-21 00:00:03,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {10589#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} assume !(main_~i~0#1 > -1); {10589#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-21 00:00:03,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {10589#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} main_~i~0#1 := main_~len~0#1 - 1; {10589#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-21 00:00:03,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {10589#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} assume !!(main_~i~0#1 > -1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {10590#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))))} is VALID [2022-02-21 00:00:03,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {10590#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))))} assume !!(sll_circular_get_data_at_~index#1 > 0); {10590#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))))} is VALID [2022-02-21 00:00:03,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {10590#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))))} SUMMARY for call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4); srcloc: L608 {10591#(and (= |ULTIMATE.start_sll_circular_get_data_at_#t~mem9#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_get_data_at_#t~mem9#1.base|)))} is VALID [2022-02-21 00:00:03,051 INFO L290 TraceCheckUtils]: 45: Hoare triple {10591#(and (= |ULTIMATE.start_sll_circular_get_data_at_#t~mem9#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_get_data_at_#t~mem9#1.base|)))} sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {10592#(and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0))} is VALID [2022-02-21 00:00:03,052 INFO L290 TraceCheckUtils]: 46: Hoare triple {10592#(and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0))} assume !(sll_circular_get_data_at_~index#1 > 0); {10592#(and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0))} is VALID [2022-02-21 00:00:03,055 INFO L290 TraceCheckUtils]: 47: Hoare triple {10592#(and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0))} assume !(4 + (4 + sll_circular_get_data_at_~head#1.offset) <= #length[sll_circular_get_data_at_~head#1.base] && 0 <= 4 + sll_circular_get_data_at_~head#1.offset); {10560#false} is VALID [2022-02-21 00:00:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 00:00:03,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:03,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373329458] [2022-02-21 00:00:03,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373329458] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:03,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073173714] [2022-02-21 00:00:03,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:03,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:03,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:00:03,065 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:00:03,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 00:00:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:03,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 95 conjunts are in the unsatisfiable core [2022-02-21 00:00:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:03,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:03,270 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-21 00:00:03,738 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-21 00:00:03,738 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 14 treesize of output 20 [2022-02-21 00:00:03,783 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 00:00:03,784 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-21 00:00:03,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 00:00:03,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 00:00:04,139 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-21 00:00:04,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-02-21 00:00:04,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-02-21 00:00:04,549 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-21 00:00:04,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-02-21 00:00:04,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-02-21 00:00:04,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:04,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-02-21 00:00:04,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:04,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2022-02-21 00:00:05,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-02-21 00:00:05,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-02-21 00:00:05,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {10559#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {10559#true} is VALID [2022-02-21 00:00:05,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {10559#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {10559#true} is VALID [2022-02-21 00:00:05,173 INFO L272 TraceCheckUtils]: 2: Hoare triple {10559#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {10559#true} is VALID [2022-02-21 00:00:05,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {10559#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {10611#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-21 00:00:05,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {10611#(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); {10611#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-21 00:00:05,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {10611#(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: L576-1 {10611#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-21 00:00:05,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {10611#(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, 4 + ~temp~0#1.offset, 4); srcloc: L579 {10621#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|) (<= (+ |node_create_~temp~0#1.offset| 8) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:05,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {10621#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= 0 |node_create_~temp~0#1.offset|) (<= (+ |node_create_~temp~0#1.offset| 8) (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {10625#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-21 00:00:05,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {10625#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {10625#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-21 00:00:05,182 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {10625#(and (<= 0 |node_create_#res#1.offset|) (<= (+ 8 |node_create_#res#1.offset|) (select |#length| |node_create_#res#1.base|)) (= (select |#valid| |node_create_#res#1.base|) 1))} {10559#true} #169#return; {10632#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} is VALID [2022-02-21 00:00:05,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {10632#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {10636#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-21 00:00:05,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {10636#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} assume !!(sll_circular_create_~len#1 > 1); {10636#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-21 00:00:05,184 INFO L272 TraceCheckUtils]: 12: Hoare triple {10636#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {10643#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 00:00:05,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {10643#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {10647#(and (exists ((v_ArrVal_1890 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1890))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:05,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {10647#(and (exists ((v_ArrVal_1890 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1890))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {10647#(and (exists ((v_ArrVal_1890 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1890))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:05,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {10647#(and (exists ((v_ArrVal_1890 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1890))) (= 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: L576-1 {10647#(and (exists ((v_ArrVal_1890 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1890))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:05,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {10647#(and (exists ((v_ArrVal_1890 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1890))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {10647#(and (exists ((v_ArrVal_1890 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1890))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-21 00:00:05,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {10647#(and (exists ((v_ArrVal_1890 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1890))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {10660#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (exists ((v_ArrVal_1890 Int)) (= |#length| (store |old(#length)| |node_create_#res#1.base| v_ArrVal_1890))))} is VALID [2022-02-21 00:00:05,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {10660#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (exists ((v_ArrVal_1890 Int)) (= |#length| (store |old(#length)| |node_create_#res#1.base| v_ArrVal_1890))))} assume true; {10660#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (exists ((v_ArrVal_1890 Int)) (= |#length| (store |old(#length)| |node_create_#res#1.base| v_ArrVal_1890))))} is VALID [2022-02-21 00:00:05,191 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {10660#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (exists ((v_ArrVal_1890 Int)) (= |#length| (store |old(#length)| |node_create_#res#1.base| v_ArrVal_1890))))} {10636#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} #171#return; {10667#(and (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-21 00:00:05,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {10667#(and (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {10671#(and (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))} is VALID [2022-02-21 00:00:05,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {10671#(and (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {10675#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} is VALID [2022-02-21 00:00:05,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {10675#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {10679#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-21 00:00:05,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {10679#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(sll_circular_create_~len#1 > 1); {10679#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-21 00:00:05,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {10679#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {10686#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} is VALID [2022-02-21 00:00:05,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {10686#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {10690#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} is VALID [2022-02-21 00:00:05,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {10690#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {10698#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {10698#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} assume !!(sll_circular_update_at_~index#1 > 0); {10698#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {10698#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {10705#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {10705#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= |ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {10709#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {10709#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} assume !(sll_circular_update_at_~index#1 > 0); {10709#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {10709#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} assume { :end_inline_sll_circular_update_at } true; {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {10725#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {10725#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} assume !(sll_circular_update_at_~index#1 > 0); {10725#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {10725#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} assume { :end_inline_sll_circular_update_at } true; {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} assume !(main_~i~0#1 > -1); {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} main_~i~0#1 := main_~len~0#1 - 1; {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-21 00:00:05,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {10694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))} assume !!(main_~i~0#1 > -1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {10747#(and (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (<= (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))))} is VALID [2022-02-21 00:00:05,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {10747#(and (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (<= (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))))} assume !!(sll_circular_get_data_at_~index#1 > 0); {10747#(and (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (<= (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))))} is VALID [2022-02-21 00:00:05,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {10747#(and (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (<= (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))))} SUMMARY for call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4); srcloc: L608 {10754#(and (<= (+ |ULTIMATE.start_sll_circular_get_data_at_#t~mem9#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_#t~mem9#1.base|)) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#t~mem9#1.offset|))} is VALID [2022-02-21 00:00:05,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {10754#(and (<= (+ |ULTIMATE.start_sll_circular_get_data_at_#t~mem9#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_#t~mem9#1.base|)) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#t~mem9#1.offset|))} sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {10758#(and (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)))} is VALID [2022-02-21 00:00:05,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {10758#(and (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)))} assume !(sll_circular_get_data_at_~index#1 > 0); {10758#(and (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)))} is VALID [2022-02-21 00:00:05,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {10758#(and (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)))} assume !(4 + (4 + sll_circular_get_data_at_~head#1.offset) <= #length[sll_circular_get_data_at_~head#1.base] && 0 <= 4 + sll_circular_get_data_at_~head#1.offset); {10560#false} is VALID [2022-02-21 00:00:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 00:00:05,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:07,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1901 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1901 Int)) (<= 0 (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) is different from false [2022-02-21 00:00:08,392 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2022-02-21 00:00:08,752 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2022-02-21 00:00:08,939 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2022-02-21 00:00:09,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)))))) is different from false [2022-02-21 00:00:09,439 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))))) is different from false [2022-02-21 00:00:09,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-02-21 00:00:09,809 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (store (select (store .cse2 .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))))) is different from false [2022-02-21 00:00:10,268 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |c_#length| (select (store (select (store .cse2 .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))))) is different from false [2022-02-21 00:00:10,385 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 00:00:10,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 120 [2022-02-21 00:00:10,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 00:00:10,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 96 [2022-02-21 00:00:10,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 480 treesize of output 456 [2022-02-21 00:00:10,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2372 treesize of output 2334 [2022-02-21 00:00:10,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 00:00:10,618 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 2244 treesize of output 2206 [2022-02-21 00:00:10,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 00:00:10,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2126 treesize of output 2028 [2022-02-21 00:00:10,719 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 00:00:10,735 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 1859 treesize of output 1795 [2022-02-21 00:00:10,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 00:00:10,782 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 1715 treesize of output 1627 [2022-02-21 00:00:10,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 00:00:10,848 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 1467 treesize of output 1403 [2022-02-21 00:00:10,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 00:00:10,905 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 1323 treesize of output 1291 [2022-02-21 00:00:10,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 00:00:10,937 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 1271 treesize of output 1263 [2022-02-21 00:00:10,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 00:00:10,968 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 1253 treesize of output 1249 [2022-02-21 00:00:10,993 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 62 treesize of output 54 [2022-02-21 00:00:13,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073173714] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:13,863 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 00:00:13,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 47 [2022-02-21 00:00:13,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779726504] [2022-02-21 00:00:13,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 00:00:13,867 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 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 48 [2022-02-21 00:00:13,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:13,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 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-21 00:00:13,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:13,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-02-21 00:00:13,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-02-21 00:00:13,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2914, Unknown=9, NotChecked=1044, Total=4160 [2022-02-21 00:00:13,952 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 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-21 00:00:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:19,253 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-02-21 00:00:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-21 00:00:19,253 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 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 48 [2022-02-21 00:00:19,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 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-21 00:00:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 116 transitions. [2022-02-21 00:00:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 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-21 00:00:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 116 transitions. [2022-02-21 00:00:19,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 116 transitions. [2022-02-21 00:00:19,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:19,381 INFO L225 Difference]: With dead ends: 124 [2022-02-21 00:00:19,381 INFO L226 Difference]: Without dead ends: 124 [2022-02-21 00:00:19,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=404, Invalid=4453, Unknown=9, NotChecked=1296, Total=6162 [2022-02-21 00:00:19,383 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 576 mSDsluCounter, 2252 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:19,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 2330 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1374 Invalid, 0 Unknown, 96 Unchecked, 1.3s Time] [2022-02-21 00:00:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-21 00:00:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2022-02-21 00:00:19,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:19,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 84 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 80 states have internal predecessors, (87), 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-21 00:00:19,386 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 84 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 80 states have internal predecessors, (87), 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-21 00:00:19,386 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 84 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 80 states have internal predecessors, (87), 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-21 00:00:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:19,388 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-02-21 00:00:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2022-02-21 00:00:19,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:19,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:19,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 80 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 124 states. [2022-02-21 00:00:19,389 INFO L87 Difference]: Start difference. First operand has 84 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 80 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 124 states. [2022-02-21 00:00:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:19,391 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-02-21 00:00:19,391 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2022-02-21 00:00:19,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:19,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:19,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:19,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 80 states have internal predecessors, (87), 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-21 00:00:19,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-02-21 00:00:19,393 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 48 [2022-02-21 00:00:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:19,394 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-02-21 00:00:19,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 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-21 00:00:19,394 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-02-21 00:00:19,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-21 00:00:19,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:19,395 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:19,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-02-21 00:00:19,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-02-21 00:00:19,599 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-21 00:00:19,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:19,600 INFO L85 PathProgramCache]: Analyzing trace with hash -74907051, now seen corresponding path program 1 times [2022-02-21 00:00:19,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:19,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724787556] [2022-02-21 00:00:19,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:19,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:19,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 00:00:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:19,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {11372#(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(8);~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; {11352#true} is VALID [2022-02-21 00:00:19,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {11352#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {11352#true} is VALID [2022-02-21 00:00:19,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {11352#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {11352#true} is VALID [2022-02-21 00:00:19,718 INFO L290 TraceCheckUtils]: 3: Hoare triple {11352#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {11352#true} is VALID [2022-02-21 00:00:19,718 INFO L290 TraceCheckUtils]: 4: Hoare triple {11352#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {11352#true} is VALID [2022-02-21 00:00:19,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {11352#true} assume true; {11352#true} is VALID [2022-02-21 00:00:19,719 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {11352#true} {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #169#return; {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-21 00:00:19,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 00:00:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:19,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {11372#(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(8);~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; {11352#true} is VALID [2022-02-21 00:00:19,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {11352#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {11352#true} is VALID [2022-02-21 00:00:19,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {11352#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {11352#true} is VALID [2022-02-21 00:00:19,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {11352#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {11352#true} is VALID [2022-02-21 00:00:19,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {11352#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {11352#true} is VALID [2022-02-21 00:00:19,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {11352#true} assume true; {11352#true} is VALID [2022-02-21 00:00:19,731 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {11352#true} {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #171#return; {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-21 00:00:19,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {11352#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {11352#true} is VALID [2022-02-21 00:00:19,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {11352#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-21 00:00:19,732 INFO L272 TraceCheckUtils]: 2: Hoare triple {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {11372#(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-21 00:00:19,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {11372#(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(8);~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; {11352#true} is VALID [2022-02-21 00:00:19,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {11352#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {11352#true} is VALID [2022-02-21 00:00:19,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {11352#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {11352#true} is VALID [2022-02-21 00:00:19,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {11352#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {11352#true} is VALID [2022-02-21 00:00:19,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {11352#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {11352#true} is VALID [2022-02-21 00:00:19,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {11352#true} assume true; {11352#true} is VALID [2022-02-21 00:00:19,734 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {11352#true} {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #169#return; {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-21 00:00:19,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-21 00:00:19,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} assume !!(sll_circular_create_~len#1 > 1); {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-21 00:00:19,736 INFO L272 TraceCheckUtils]: 12: Hoare triple {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {11372#(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-21 00:00:19,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {11372#(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(8);~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; {11352#true} is VALID [2022-02-21 00:00:19,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {11352#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {11352#true} is VALID [2022-02-21 00:00:19,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {11352#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {11352#true} is VALID [2022-02-21 00:00:19,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {11352#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {11352#true} is VALID [2022-02-21 00:00:19,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {11352#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {11352#true} is VALID [2022-02-21 00:00:19,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {11352#true} assume true; {11352#true} is VALID [2022-02-21 00:00:19,737 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {11352#true} {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #171#return; {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-21 00:00:19,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-21 00:00:19,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-21 00:00:19,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {11354#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_circular_update_at_~index#1 > 0); {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume { :end_inline_sll_circular_update_at } true; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume { :end_inline_sll_circular_update_at } true; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,753 INFO L290 TraceCheckUtils]: 40: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(main_~i~0#1 > -1); {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:19,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_~i~0#1 := main_~len~0#1 - 1; {11370#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 00:00:19,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {11370#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > -1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {11371#(<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|)} is VALID [2022-02-21 00:00:19,754 INFO L290 TraceCheckUtils]: 43: Hoare triple {11371#(<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|)} assume !(sll_circular_get_data_at_~index#1 > 0); {11353#false} is VALID [2022-02-21 00:00:19,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {11353#false} SUMMARY for call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4); srcloc: L607-3 {11353#false} is VALID [2022-02-21 00:00:19,755 INFO L290 TraceCheckUtils]: 45: Hoare triple {11353#false} sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {11353#false} is VALID [2022-02-21 00:00:19,755 INFO L290 TraceCheckUtils]: 46: Hoare triple {11353#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {11353#false} is VALID [2022-02-21 00:00:19,755 INFO L290 TraceCheckUtils]: 47: Hoare triple {11353#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {11353#false} is VALID [2022-02-21 00:00:19,755 INFO L290 TraceCheckUtils]: 48: Hoare triple {11353#false} assume !false; {11353#false} is VALID [2022-02-21 00:00:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-21 00:00:19,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:19,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724787556] [2022-02-21 00:00:19,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724787556] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:19,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517141063] [2022-02-21 00:00:19,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:19,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:19,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:00:19,758 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:00:19,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 00:00:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:19,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 00:00:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:19,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:20,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {11352#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {11352#true} is VALID [2022-02-21 00:00:20,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {11352#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,134 INFO L272 TraceCheckUtils]: 2: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {11352#true} is VALID [2022-02-21 00:00:20,134 INFO L290 TraceCheckUtils]: 3: Hoare triple {11352#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {11352#true} is VALID [2022-02-21 00:00:20,134 INFO L290 TraceCheckUtils]: 4: Hoare triple {11352#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {11352#true} is VALID [2022-02-21 00:00:20,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {11352#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {11352#true} is VALID [2022-02-21 00:00:20,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {11352#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {11352#true} is VALID [2022-02-21 00:00:20,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {11352#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {11352#true} is VALID [2022-02-21 00:00:20,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {11352#true} assume true; {11352#true} is VALID [2022-02-21 00:00:20,135 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {11352#true} {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #169#return; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_circular_create_~len#1 > 1); {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,136 INFO L272 TraceCheckUtils]: 12: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {11352#true} is VALID [2022-02-21 00:00:20,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {11352#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {11352#true} is VALID [2022-02-21 00:00:20,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {11352#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {11352#true} is VALID [2022-02-21 00:00:20,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {11352#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {11352#true} is VALID [2022-02-21 00:00:20,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {11352#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {11352#true} is VALID [2022-02-21 00:00:20,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {11352#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {11352#true} is VALID [2022-02-21 00:00:20,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {11352#true} assume true; {11352#true} is VALID [2022-02-21 00:00:20,137 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {11352#true} {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #171#return; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4); srcloc: L588 {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4); srcloc: L586-3 {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := main_~len~0#1 - 1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_circular_update_at_~index#1 > 0); {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4); srcloc: L615 {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume { :end_inline_sll_circular_update_at } true; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(main_~i~0#1 > -1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,143 INFO L290 TraceCheckUtils]: 36: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,143 INFO L290 TraceCheckUtils]: 37: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); srcloc: L614-3 {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,143 INFO L290 TraceCheckUtils]: 38: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume { :end_inline_sll_circular_update_at } true; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,143 INFO L290 TraceCheckUtils]: 39: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := main_#t~post15#1 - 1;havoc main_#t~post15#1; {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(main_~i~0#1 > -1); {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-21 00:00:20,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {11369#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_~i~0#1 := main_~len~0#1 - 1; {11370#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 00:00:20,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {11370#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > -1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {11371#(<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|)} is VALID [2022-02-21 00:00:20,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {11371#(<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|)} assume !(sll_circular_get_data_at_~index#1 > 0); {11353#false} is VALID [2022-02-21 00:00:20,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {11353#false} SUMMARY for call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4); srcloc: L607-3 {11353#false} is VALID [2022-02-21 00:00:20,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {11353#false} sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {11353#false} is VALID [2022-02-21 00:00:20,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {11353#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {11353#false} is VALID [2022-02-21 00:00:20,145 INFO L290 TraceCheckUtils]: 47: Hoare triple {11353#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {11353#false} is VALID [2022-02-21 00:00:20,145 INFO L290 TraceCheckUtils]: 48: Hoare triple {11353#false} assume !false; {11353#false} is VALID [2022-02-21 00:00:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 00:00:20,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:00:20,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517141063] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:20,146 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 00:00:20,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-02-21 00:00:20,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650499094] [2022-02-21 00:00:20,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:20,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-02-21 00:00:20,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:20,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 00:00:20,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:20,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 00:00:20,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:20,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 00:00:20,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-21 00:00:20,174 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 00:00:20,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:20,326 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-02-21 00:00:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 00:00:20,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-02-21 00:00:20,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 00:00:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-02-21 00:00:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 00:00:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-02-21 00:00:20,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2022-02-21 00:00:20,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:20,411 INFO L225 Difference]: With dead ends: 86 [2022-02-21 00:00:20,411 INFO L226 Difference]: Without dead ends: 86 [2022-02-21 00:00:20,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-21 00:00:20,412 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 70 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:20,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 191 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:00:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-21 00:00:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2022-02-21 00:00:20,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:20,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 84 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 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-21 00:00:20,414 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 84 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 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-21 00:00:20,414 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 84 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 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-21 00:00:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:20,416 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-02-21 00:00:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-02-21 00:00:20,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:20,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:20,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 86 states. [2022-02-21 00:00:20,421 INFO L87 Difference]: Start difference. First operand has 84 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 86 states. [2022-02-21 00:00:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:20,423 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-02-21 00:00:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-02-21 00:00:20,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:20,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:20,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:20,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 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-21 00:00:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-02-21 00:00:20,425 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 49 [2022-02-21 00:00:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:20,425 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-02-21 00:00:20,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 00:00:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-02-21 00:00:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-21 00:00:20,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:20,426 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:20,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:20,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-02-21 00:00:20,627 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2022-02-21 00:00:20,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash 836425368, now seen corresponding path program 1 times [2022-02-21 00:00:20,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:20,628 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343072504] [2022-02-21 00:00:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:20,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:21,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 00:00:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:21,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {11906#(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(8);~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; {11907#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-21 00:00:21,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {11907#(= |node_create_~temp~0#1.offset| 0)} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {11907#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-21 00:00:21,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {11907#(= |node_create_~temp~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L576-1 {11908#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:21,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {11908#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L579 {11908#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:21,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {11908#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {11909#(and (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-21 00:00:21,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {11909#(and (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {11909#(and (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-21 00:00:21,624 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {11909#(and (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {11867#true} #169#return; {11876#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0))} is VALID [2022-02-21 00:00:21,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 00:00:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat