./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:55:31,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:55:31,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:55:31,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:55:31,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:55:32,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:55:32,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:55:32,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:55:32,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:55:32,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:55:32,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:55:32,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:55:32,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:55:32,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:55:32,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:55:32,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:55:32,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:55:32,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:55:32,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:55:32,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:55:32,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:55:32,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:55:32,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:55:32,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:55:32,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:55:32,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:55:32,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:55:32,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:55:32,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:55:32,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:55:32,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:55:32,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:55:32,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:55:32,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:55:32,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:55:32,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:55:32,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:55:32,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:55:32,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:55:32,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:55:32,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:55:32,040 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:55:32,070 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:55:32,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:55:32,071 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:55:32,071 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:55:32,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:55:32,072 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:55:32,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:55:32,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:55:32,073 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:55:32,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:55:32,074 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:55:32,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:55:32,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:55:32,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:55:32,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:55:32,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:55:32,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:55:32,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:55:32,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:55:32,076 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:55:32,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:55:32,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:55:32,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:55:32,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:55:32,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:55:32,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:55:32,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:55:32,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:55:32,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:55:32,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:55:32,079 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:55:32,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:55:32,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:55:32,079 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2022-02-20 16:55:32,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:55:32,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:55:32,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:55:32,341 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:55:32,341 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:55:32,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-02-20 16:55:32,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028f573e8/ae3a5fe6ece7401bb581b9517211267b/FLAGea251a18b [2022-02-20 16:55:32,882 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:55:32,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-02-20 16:55:32,892 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028f573e8/ae3a5fe6ece7401bb581b9517211267b/FLAGea251a18b [2022-02-20 16:55:33,222 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028f573e8/ae3a5fe6ece7401bb581b9517211267b [2022-02-20 16:55:33,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:55:33,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:55:33,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:55:33,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:55:33,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:55:33,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:55:33" (1/1) ... [2022-02-20 16:55:33,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3d8192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:33, skipping insertion in model container [2022-02-20 16:55:33,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:55:33" (1/1) ... [2022-02-20 16:55:33,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:55:33,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:55:33,642 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_insert_equal.i[24601,24614] [2022-02-20 16:55:33,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:55:33,657 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:55:33,719 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_insert_equal.i[24601,24614] [2022-02-20 16:55:33,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:55:33,752 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:55:33,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:33 WrapperNode [2022-02-20 16:55:33,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:55:33,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:55:33,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:55:33,755 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:55:33,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:33" (1/1) ... [2022-02-20 16:55:33,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:33" (1/1) ... [2022-02-20 16:55:33,825 INFO L137 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2022-02-20 16:55:33,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:55:33,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:55:33,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:55:33,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:55:33,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:33" (1/1) ... [2022-02-20 16:55:33,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:33" (1/1) ... [2022-02-20 16:55:33,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:33" (1/1) ... [2022-02-20 16:55:33,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:33" (1/1) ... [2022-02-20 16:55:33,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:33" (1/1) ... [2022-02-20 16:55:33,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:33" (1/1) ... [2022-02-20 16:55:33,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:33" (1/1) ... [2022-02-20 16:55:33,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:55:33,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:55:33,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:55:33,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:55:33,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:33" (1/1) ... [2022-02-20 16:55:33,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:55:33,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:55:33,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:55:33,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:55:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:55:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:55:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 16:55:33,954 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 16:55:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:55:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:55:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:55:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:55:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:55:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:55:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 16:55:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:55:33,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:55:33,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:55:34,045 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:55:34,047 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:55:34,354 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:55:34,359 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:55:34,360 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:55:34,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:55:34 BoogieIcfgContainer [2022-02-20 16:55:34,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:55:34,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:55:34,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:55:34,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:55:34,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:55:33" (1/3) ... [2022-02-20 16:55:34,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115fafd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:55:34, skipping insertion in model container [2022-02-20 16:55:34,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:33" (2/3) ... [2022-02-20 16:55:34,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115fafd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:55:34, skipping insertion in model container [2022-02-20 16:55:34,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:55:34" (3/3) ... [2022-02-20 16:55:34,379 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2022-02-20 16:55:34,383 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:55:34,383 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:55:34,441 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:55:34,449 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:55:34,450 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:55:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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 16:55:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:55:34,474 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:34,474 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:55:34,475 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:34,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:34,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1369192097, now seen corresponding path program 1 times [2022-02-20 16:55:34,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:34,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824921437] [2022-02-20 16:55:34,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:34,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:34,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(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; {39#true} is VALID [2022-02-20 16:55:34,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {39#true} is VALID [2022-02-20 16:55:34,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {39#true} is VALID [2022-02-20 16:55:34,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:55:34,756 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {39#true} {39#true} #112#return; {39#true} is VALID [2022-02-20 16:55:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 16:55:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:34,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(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; {39#true} is VALID [2022-02-20 16:55:34,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {39#true} is VALID [2022-02-20 16:55:34,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {39#true} is VALID [2022-02-20 16:55:34,823 INFO L290 TraceCheckUtils]: 3: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:55:34,823 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {39#true} {40#false} #116#return; {40#false} is VALID [2022-02-20 16:55:34,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#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(21, 2); {39#true} is VALID [2022-02-20 16:55:34,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {39#true} is VALID [2022-02-20 16:55:34,828 INFO L272 TraceCheckUtils]: 2: Hoare triple {39#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {51#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:34,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {51#(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; {39#true} is VALID [2022-02-20 16:55:34,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {39#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {39#true} is VALID [2022-02-20 16:55:34,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {39#true} is VALID [2022-02-20 16:55:34,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:55:34,830 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {39#true} {39#true} #112#return; {39#true} is VALID [2022-02-20 16:55:34,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#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; {39#true} is VALID [2022-02-20 16:55:34,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#true} assume !true; {40#false} is VALID [2022-02-20 16:55:34,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {40#false} 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);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; {40#false} is VALID [2022-02-20 16:55:34,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {40#false} is VALID [2022-02-20 16:55:34,832 INFO L272 TraceCheckUtils]: 12: Hoare triple {40#false} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {51#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:34,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {51#(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; {39#true} is VALID [2022-02-20 16:55:34,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {39#true} is VALID [2022-02-20 16:55:34,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {39#true} is VALID [2022-02-20 16:55:34,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:55:34,835 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {39#true} {40#false} #116#return; {40#false} is VALID [2022-02-20 16:55:34,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#false} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {40#false} is VALID [2022-02-20 16:55:34,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-02-20 16:55:34,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {40#false} assume sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4); {40#false} is VALID [2022-02-20 16:55:34,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {40#false} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {40#false} is VALID [2022-02-20 16:55:34,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-02-20 16:55:34,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#false} assume main_~count~0#1 != 1 + main_~len~0#1; {40#false} is VALID [2022-02-20 16:55:34,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-02-20 16:55:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:55:34,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:34,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824921437] [2022-02-20 16:55:34,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824921437] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:55:34,839 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:55:34,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:55:34,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417446984] [2022-02-20 16:55:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:55:34,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-02-20 16:55:34,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:34,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:55:34,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:34,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:55:34,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:55:34,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:55:34,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:55:34,905 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:55:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:35,066 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2022-02-20 16:55:35,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:55:35,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-02-20 16:55:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:35,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:55:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-02-20 16:55:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:55:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-02-20 16:55:35,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-02-20 16:55:35,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:35,204 INFO L225 Difference]: With dead ends: 65 [2022-02-20 16:55:35,204 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:55:35,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:55:35,210 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:35,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:55:35,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:55:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 16:55:35,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:35,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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 16:55:35,236 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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 16:55:35,237 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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 16:55:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:35,240 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-20 16:55:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-20 16:55:35,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:35,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:35,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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 28 states. [2022-02-20 16:55:35,242 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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 28 states. [2022-02-20 16:55:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:35,244 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-20 16:55:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-20 16:55:35,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:35,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:35,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:35,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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 16:55:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-02-20 16:55:35,249 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2022-02-20 16:55:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:35,250 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-02-20 16:55:35,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:55:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-20 16:55:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:55:35,251 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:35,252 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:55:35,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:55:35,252 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1579482442, now seen corresponding path program 1 times [2022-02-20 16:55:35,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:35,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740016051] [2022-02-20 16:55:35,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:35,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:35,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#(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; {233#true} is VALID [2022-02-20 16:55:35,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {233#true} is VALID [2022-02-20 16:55:35,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {233#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {233#true} is VALID [2022-02-20 16:55:35,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {233#true} assume true; {233#true} is VALID [2022-02-20 16:55:35,392 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {233#true} {235#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #112#return; {235#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:55:35,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 16:55:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:35,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#(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; {233#true} is VALID [2022-02-20 16:55:35,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {233#true} is VALID [2022-02-20 16:55:35,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {233#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {233#true} is VALID [2022-02-20 16:55:35,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {233#true} assume true; {233#true} is VALID [2022-02-20 16:55:35,410 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {233#true} {234#false} #116#return; {234#false} is VALID [2022-02-20 16:55:35,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#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(21, 2); {233#true} is VALID [2022-02-20 16:55:35,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {235#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:55:35,412 INFO L272 TraceCheckUtils]: 2: Hoare triple {235#(= (+ (- 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); {246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:35,413 INFO L290 TraceCheckUtils]: 3: Hoare triple {246#(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; {233#true} is VALID [2022-02-20 16:55:35,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {233#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {233#true} is VALID [2022-02-20 16:55:35,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {233#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {233#true} is VALID [2022-02-20 16:55:35,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#true} assume true; {233#true} is VALID [2022-02-20 16:55:35,414 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {233#true} {235#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #112#return; {235#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:55:35,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(= (+ (- 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; {235#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:55:35,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} assume !(sll_circular_create_~len#1 > 1); {234#false} is VALID [2022-02-20 16:55:35,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {234#false} 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);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; {234#false} is VALID [2022-02-20 16:55:35,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {234#false} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {234#false} is VALID [2022-02-20 16:55:35,416 INFO L272 TraceCheckUtils]: 12: Hoare triple {234#false} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:35,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#(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; {233#true} is VALID [2022-02-20 16:55:35,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {233#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {233#true} is VALID [2022-02-20 16:55:35,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {233#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {233#true} is VALID [2022-02-20 16:55:35,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {233#true} assume true; {233#true} is VALID [2022-02-20 16:55:35,417 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {233#true} {234#false} #116#return; {234#false} is VALID [2022-02-20 16:55:35,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {234#false} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {234#false} is VALID [2022-02-20 16:55:35,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {234#false} assume !(sll_circular_insert_~index#1 > 0); {234#false} is VALID [2022-02-20 16:55:35,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {234#false} assume sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4); {234#false} is VALID [2022-02-20 16:55:35,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {234#false} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {234#false} is VALID [2022-02-20 16:55:35,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {234#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4); {234#false} is VALID [2022-02-20 16:55:35,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {234#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {234#false} is VALID [2022-02-20 16:55:35,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {234#false} assume !false; {234#false} is VALID [2022-02-20 16:55:35,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:55:35,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:35,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740016051] [2022-02-20 16:55:35,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740016051] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:55:35,421 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:55:35,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:55:35,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768261521] [2022-02-20 16:55:35,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:55:35,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-02-20 16:55:35,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:35,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:55:35,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:35,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:55:35,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:55:35,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:55:35,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:55:35,446 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:55:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:35,566 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2022-02-20 16:55:35,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:55:35,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-02-20 16:55:35,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:55:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-02-20 16:55:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:55:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-02-20 16:55:35,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 65 transitions. [2022-02-20 16:55:35,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:35,635 INFO L225 Difference]: With dead ends: 52 [2022-02-20 16:55:35,635 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 16:55:35,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:55:35,637 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:35,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:55:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 16:55:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-02-20 16:55:35,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:35,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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 16:55:35,642 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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 16:55:35,643 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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 16:55:35,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:35,645 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-20 16:55:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-20 16:55:35,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:35,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:35,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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 31 states. [2022-02-20 16:55:35,647 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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 31 states. [2022-02-20 16:55:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:35,649 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-20 16:55:35,649 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-20 16:55:35,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:35,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:35,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:35,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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 16:55:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-02-20 16:55:35,652 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 25 [2022-02-20 16:55:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:35,655 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-02-20 16:55:35,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:55:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-02-20 16:55:35,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 16:55:35,657 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:35,657 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:55:35,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:55:35,657 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:35,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:35,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1638915570, now seen corresponding path program 1 times [2022-02-20 16:55:35,658 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:35,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219770298] [2022-02-20 16:55:35,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:35,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:35,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:35,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#(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; {419#true} is VALID [2022-02-20 16:55:35,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {419#true} is VALID [2022-02-20 16:55:35,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {419#true} is VALID [2022-02-20 16:55:35,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 16:55:35,824 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {419#true} {419#true} #112#return; {419#true} is VALID [2022-02-20 16:55:35,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:55:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:35,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#(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; {419#true} is VALID [2022-02-20 16:55:35,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {419#true} is VALID [2022-02-20 16:55:35,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {419#true} is VALID [2022-02-20 16:55:35,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 16:55:35,837 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {419#true} {419#true} #114#return; {419#true} is VALID [2022-02-20 16:55:35,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 16:55:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:35,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#(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; {419#true} is VALID [2022-02-20 16:55:35,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {419#true} is VALID [2022-02-20 16:55:35,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {419#true} is VALID [2022-02-20 16:55:35,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 16:55:35,849 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {419#true} {419#true} #116#return; {419#true} is VALID [2022-02-20 16:55:35,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {419#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(21, 2); {419#true} is VALID [2022-02-20 16:55:35,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {419#true} is VALID [2022-02-20 16:55:35,850 INFO L272 TraceCheckUtils]: 2: Hoare triple {419#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {437#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:35,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {437#(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; {419#true} is VALID [2022-02-20 16:55:35,851 INFO L290 TraceCheckUtils]: 4: Hoare triple {419#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {419#true} is VALID [2022-02-20 16:55:35,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {419#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {419#true} is VALID [2022-02-20 16:55:35,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 16:55:35,852 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {419#true} {419#true} #112#return; {419#true} is VALID [2022-02-20 16:55:35,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#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; {419#true} is VALID [2022-02-20 16:55:35,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#true} assume !!(sll_circular_create_~len#1 > 1); {419#true} is VALID [2022-02-20 16:55:35,853 INFO L272 TraceCheckUtils]: 10: Hoare triple {419#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {437#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:35,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(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; {419#true} is VALID [2022-02-20 16:55:35,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {419#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {419#true} is VALID [2022-02-20 16:55:35,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {419#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {419#true} is VALID [2022-02-20 16:55:35,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 16:55:35,855 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {419#true} {419#true} #114#return; {419#true} is VALID [2022-02-20 16:55:35,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {419#true} 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;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);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; {419#true} is VALID [2022-02-20 16:55:35,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {419#true} assume !(sll_circular_create_~len#1 > 1); {419#true} is VALID [2022-02-20 16:55:35,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {419#true} 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);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; {419#true} is VALID [2022-02-20 16:55:35,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {419#true} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {419#true} is VALID [2022-02-20 16:55:35,857 INFO L272 TraceCheckUtils]: 20: Hoare triple {419#true} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {437#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:35,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {437#(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; {419#true} is VALID [2022-02-20 16:55:35,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {419#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {419#true} is VALID [2022-02-20 16:55:35,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {419#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {419#true} is VALID [2022-02-20 16:55:35,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 16:55:35,858 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {419#true} {419#true} #116#return; {419#true} is VALID [2022-02-20 16:55:35,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {419#true} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {436#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0))} is VALID [2022-02-20 16:55:35,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {436#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0))} assume !(sll_circular_insert_~index#1 > 0); {436#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0))} is VALID [2022-02-20 16:55:35,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {436#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0))} assume sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4); {420#false} is VALID [2022-02-20 16:55:35,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {420#false} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {420#false} is VALID [2022-02-20 16:55:35,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {420#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4); {420#false} is VALID [2022-02-20 16:55:35,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {420#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {420#false} is VALID [2022-02-20 16:55:35,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {420#false} assume !false; {420#false} is VALID [2022-02-20 16:55:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 16:55:35,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:35,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219770298] [2022-02-20 16:55:35,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219770298] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:55:35,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:55:35,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:55:35,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603880849] [2022-02-20 16:55:35,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:55:35,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-02-20 16:55:35,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:35,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:55:35,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:35,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:55:35,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:55:35,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:55:35,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:55:35,891 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:55:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:36,020 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-02-20 16:55:36,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:55:36,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-02-20 16:55:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:55:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 16:55:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:55:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 16:55:36,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2022-02-20 16:55:36,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:36,082 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:55:36,082 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:55:36,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:55:36,084 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:36,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 87 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:55:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:55:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2022-02-20 16:55:36,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:36,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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 16:55:36,089 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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 16:55:36,089 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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 16:55:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:36,093 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-20 16:55:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-02-20 16:55:36,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:36,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:36,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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 39 states. [2022-02-20 16:55:36,094 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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 39 states. [2022-02-20 16:55:36,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:36,096 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-20 16:55:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-02-20 16:55:36,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:36,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:36,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:36,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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 16:55:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-02-20 16:55:36,104 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 33 [2022-02-20 16:55:36,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:36,105 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-02-20 16:55:36,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:55:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-20 16:55:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 16:55:36,107 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:36,107 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:55:36,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:55:36,107 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:36,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash 802467380, now seen corresponding path program 1 times [2022-02-20 16:55:36,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:36,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71369953] [2022-02-20 16:55:36,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:36,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:36,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:36,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {652#(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; {653#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:55:36,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {653#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:55:36,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {653#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {654#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:55:36,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {654#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {654#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:55:36,781 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {654#(= (select |#valid| |node_create_#res#1.base|) 1)} {624#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #112#return; {630#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:55:36,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:55:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:36,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {652#(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; {655#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:36,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {655#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |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); {655#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:36,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {655#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {656#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 4) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:55:36,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {656#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 4) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {656#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 4) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:55:36,892 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {656#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 4) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {631#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #114#return; {637#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4)) (not (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~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 16:55:36,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 16:55:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:37,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {652#(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; {657#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:37,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {657#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {657#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:37,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {657#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {658#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:55:37,138 INFO L290 TraceCheckUtils]: 3: Hoare triple {658#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {658#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:55:37,141 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {658#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {640#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_sll_circular_insert_~head#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_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} #116#return; {646#(and (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) 4) |ULTIMATE.start_main_~data~0#1|))} is VALID [2022-02-20 16:55:37,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {622#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(21, 2); {622#true} is VALID [2022-02-20 16:55:37,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {624#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:55:37,145 INFO L272 TraceCheckUtils]: 2: Hoare triple {624#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {652#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:37,145 INFO L290 TraceCheckUtils]: 3: Hoare triple {652#(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; {653#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:55:37,146 INFO L290 TraceCheckUtils]: 4: Hoare triple {653#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {653#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:55:37,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {653#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {654#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:55:37,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {654#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {654#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:55:37,149 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {654#(= (select |#valid| |node_create_#res#1.base|) 1)} {624#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #112#return; {630#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:55:37,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {630#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#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; {631#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 16:55:37,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {631#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} assume !!(sll_circular_create_~len#1 > 1); {631#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 16:55:37,151 INFO L272 TraceCheckUtils]: 10: Hoare triple {631#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~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); {652#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:37,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {652#(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; {655#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:37,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {655#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |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); {655#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:37,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {655#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {656#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 4) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:55:37,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {656#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 4) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {656#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 4) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:55:37,155 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {656#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 4) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {631#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #114#return; {637#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4)) (not (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~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 16:55:37,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {637#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4)) (not (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~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;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);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; {638#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 16:55:37,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {638#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (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); {638#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 16:55:37,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {638#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} 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);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; {639#(and (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#res#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:55:37,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {639#(and (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#res#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {640#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_sll_circular_insert_~head#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_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} is VALID [2022-02-20 16:55:37,161 INFO L272 TraceCheckUtils]: 20: Hoare triple {640#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_sll_circular_insert_~head#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_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {652#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:37,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {652#(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; {657#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:37,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {657#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {657#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:37,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {657#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {658#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:55:37,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {658#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {658#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:55:37,170 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {658#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {640#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_sll_circular_insert_~head#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_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} #116#return; {646#(and (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) 4) |ULTIMATE.start_main_~data~0#1|))} is VALID [2022-02-20 16:55:37,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {646#(and (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) 4) |ULTIMATE.start_main_~data~0#1|))} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {647#(and (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| |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|) 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 4)) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:55:37,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {647#(and (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| |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|) 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 4)) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!(sll_circular_insert_~index#1 > 0);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;call sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset := read~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;havoc sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;sll_circular_insert_#t~post12#1 := sll_circular_insert_~index#1;sll_circular_insert_~index#1 := sll_circular_insert_#t~post12#1 - 1;havoc sll_circular_insert_#t~post12#1; {648#(and (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:55:37,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {648#(and (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !(sll_circular_insert_~index#1 > 0); {648#(and (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:55:37,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {648#(and (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4); {649#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} is VALID [2022-02-20 16:55:37,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {649#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {650#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))} is VALID [2022-02-20 16:55:37,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {650#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4); {651#(= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem19#1|)} is VALID [2022-02-20 16:55:37,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {651#(= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem19#1|)} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {623#false} is VALID [2022-02-20 16:55:37,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-02-20 16:55:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:55:37,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:37,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71369953] [2022-02-20 16:55:37,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71369953] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:55:37,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420988575] [2022-02-20 16:55:37,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:37,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:37,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:55:37,178 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:55:37,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 16:55:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:37,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 148 conjunts are in the unsatisfiable core [2022-02-20 16:55:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:37,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:55:37,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 16:55:37,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 16:55:37,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:55:37,996 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 16:55:37,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 16:55:38,295 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 7 treesize of output 3 [2022-02-20 16:55:38,319 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:55:38,320 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 7 [2022-02-20 16:55:38,457 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-02-20 16:55:38,613 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 16:55:38,613 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-02-20 16:55:38,629 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-20 16:55:38,669 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-02-20 16:55:38,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-02-20 16:55:38,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-02-20 16:55:39,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:39,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-02-20 16:55:39,690 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 37 treesize of output 21 [2022-02-20 16:55:39,741 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 7 treesize of output 3 [2022-02-20 16:55:39,817 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:55:39,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-02-20 16:55:40,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:40,317 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 43 treesize of output 39 [2022-02-20 16:55:40,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:40,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:40,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-02-20 16:55:40,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:40,412 INFO L356 Elim1Store]: treesize reduction 16, result has 44.8 percent of original size [2022-02-20 16:55:40,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 25 [2022-02-20 16:55:40,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:40,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 16:55:41,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:41,602 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-02-20 16:55:41,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 84 [2022-02-20 16:55:41,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:41,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2022-02-20 16:55:41,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2022-02-20 16:55:42,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-02-20 16:55:42,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:42,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-02-20 16:55:42,535 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 46 treesize of output 26 [2022-02-20 16:55:42,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-02-20 16:55:42,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-02-20 16:55:42,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {622#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(21, 2); {622#true} is VALID [2022-02-20 16:55:42,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {665#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:55:42,899 INFO L272 TraceCheckUtils]: 2: Hoare triple {665#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {669#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 16:55:42,906 INFO L290 TraceCheckUtils]: 3: Hoare triple {669#(= |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; {673#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 16:55:42,907 INFO L290 TraceCheckUtils]: 4: Hoare triple {673#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|) (= |node_create_~temp~0#1.offset| 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {673#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 16:55:42,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {673#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|) (= |node_create_~temp~0#1.offset| 0))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {680#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 4) |node_create_#in~data#1|) (<= |node_create_#res#1.offset| 0) (= (store |old(#valid)| |node_create_#res#1.base| 1) |#valid|))} is VALID [2022-02-20 16:55:42,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {680#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 4) |node_create_#in~data#1|) (<= |node_create_#res#1.offset| 0) (= (store |old(#valid)| |node_create_#res#1.base| 1) |#valid|))} assume true; {680#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 4) |node_create_#in~data#1|) (<= |node_create_#res#1.offset| 0) (= (store |old(#valid)| |node_create_#res#1.base| 1) |#valid|))} is VALID [2022-02-20 16:55:42,911 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {680#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 4) |node_create_#in~data#1|) (<= |node_create_#res#1.offset| 0) (= (store |old(#valid)| |node_create_#res#1.base| 1) |#valid|))} {665#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} #112#return; {687#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:55:42,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {687#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 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; {691#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 16:55:42,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {691#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} assume !!(sll_circular_create_~len#1 > 1); {691#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 16:55:42,914 INFO L272 TraceCheckUtils]: 10: Hoare triple {691#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (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); {698#(and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:42,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#(and (= |#memory_int| |old(#memory_int)|) (= |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; {702#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|) (= |#memory_int| |old(#memory_int)|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:42,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {702#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|) (= |#memory_int| |old(#memory_int)|) (= |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); {702#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|) (= |#memory_int| |old(#memory_int)|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:42,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {702#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|) (= |#memory_int| |old(#memory_int)|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {709#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (store |old(#valid)| |node_create_#res#1.base| 1) |#valid|) (exists ((v_arrayElimArr_1 (Array Int Int))) (and (= (select v_arrayElimArr_1 (+ 4 |node_create_#res#1.offset|)) |node_create_#in~data#1|) (= |#memory_int| (store |old(#memory_int)| |node_create_#res#1.base| v_arrayElimArr_1)))) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 16:55:42,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (store |old(#valid)| |node_create_#res#1.base| 1) |#valid|) (exists ((v_arrayElimArr_1 (Array Int Int))) (and (= (select v_arrayElimArr_1 (+ 4 |node_create_#res#1.offset|)) |node_create_#in~data#1|) (= |#memory_int| (store |old(#memory_int)| |node_create_#res#1.base| v_arrayElimArr_1)))) (= 0 |node_create_#res#1.offset|))} assume true; {709#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (store |old(#valid)| |node_create_#res#1.base| 1) |#valid|) (exists ((v_arrayElimArr_1 (Array Int Int))) (and (= (select v_arrayElimArr_1 (+ 4 |node_create_#res#1.offset|)) |node_create_#in~data#1|) (= |#memory_int| (store |old(#memory_int)| |node_create_#res#1.base| v_arrayElimArr_1)))) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 16:55:42,920 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {709#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (store |old(#valid)| |node_create_#res#1.base| 1) |#valid|) (exists ((v_arrayElimArr_1 (Array Int Int))) (and (= (select v_arrayElimArr_1 (+ 4 |node_create_#res#1.offset|)) |node_create_#in~data#1|) (= |#memory_int| (store |old(#memory_int)| |node_create_#res#1.base| v_arrayElimArr_1)))) (= 0 |node_create_#res#1.offset|))} {691#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #114#return; {716#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 16:55:42,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (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;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);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; {720#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |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 16:55:42,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {720#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |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); {720#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |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 16:55:42,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {720#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |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 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);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; {727#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#res#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:55:42,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {727#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#res#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {731#(and (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_sll_circular_insert_~head#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_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} is VALID [2022-02-20 16:55:42,926 INFO L272 TraceCheckUtils]: 20: Hoare triple {731#(and (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_sll_circular_insert_~head#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_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {735#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:42,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {735#(and (= |#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; {739#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:42,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {739#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {739#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:42,929 WARN L290 TraceCheckUtils]: 23: Hoare triple {739#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {746#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_430 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |node_create_#res#1.base| v_ArrVal_430))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (exists ((v_ArrVal_427 (Array Int Int))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res#1.base| v_ArrVal_427))) (exists ((v_ArrVal_429 (Array Int Int))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_429))) (= 0 |node_create_#res#1.offset|))} is UNKNOWN [2022-02-20 16:55:42,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {746#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_430 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |node_create_#res#1.base| v_ArrVal_430))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (exists ((v_ArrVal_427 (Array Int Int))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res#1.base| v_ArrVal_427))) (exists ((v_ArrVal_429 (Array Int Int))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_429))) (= 0 |node_create_#res#1.offset|))} assume true; {746#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_430 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |node_create_#res#1.base| v_ArrVal_430))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (exists ((v_ArrVal_427 (Array Int Int))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res#1.base| v_ArrVal_427))) (exists ((v_ArrVal_429 (Array Int Int))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_429))) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 16:55:42,933 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {746#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_430 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |node_create_#res#1.base| v_ArrVal_430))) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (exists ((v_ArrVal_427 (Array Int Int))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res#1.base| v_ArrVal_427))) (exists ((v_ArrVal_429 (Array Int Int))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_429))) (= 0 |node_create_#res#1.offset|))} {731#(and (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_sll_circular_insert_~head#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_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} #116#return; {753#(and (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (< (+ |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} is VALID [2022-02-20 16:55:42,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {753#(and (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (< (+ |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {757#(and (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) (<= |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} is VALID [2022-02-20 16:55:42,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {757#(and (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) (<= |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} assume !!(sll_circular_insert_~index#1 > 0);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;call sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset := read~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;havoc sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;sll_circular_insert_#t~post12#1 := sll_circular_insert_~index#1;sll_circular_insert_~index#1 := sll_circular_insert_#t~post12#1 - 1;havoc sll_circular_insert_#t~post12#1; {761#(and (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} is VALID [2022-02-20 16:55:42,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {761#(and (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} assume !(sll_circular_insert_~index#1 > 0); {761#(and (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} is VALID [2022-02-20 16:55:42,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {761#(and (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} assume sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4); {768#(and (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))) (exists ((|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|) 0) (<= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} is VALID [2022-02-20 16:55:42,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {768#(and (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))) (exists ((|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|) 0) (<= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)))} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {772#(and (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|))))} is VALID [2022-02-20 16:55:42,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {772#(and (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|))))} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4); {776#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem19#1|) (= |ULTIMATE.start_main_~data~0#1| 1))} is VALID [2022-02-20 16:55:42,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {776#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem19#1|) (= |ULTIMATE.start_main_~data~0#1| 1))} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {623#false} is VALID [2022-02-20 16:55:42,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-02-20 16:55:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:55:42,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:55:43,076 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_437 Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_437)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_440) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_432) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-02-20 16:55:43,225 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| Int) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_437 Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_437)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_440) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_432) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2022-02-20 16:55:43,390 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| Int) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_437 Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6|) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_437)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_440) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_432) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2022-02-20 16:55:43,864 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| Int) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| Int) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_437 Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| v_ArrVal_448))) (or (< (select (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6|) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| v_ArrVal_450))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| v_ArrVal_449))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_437))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| v_ArrVal_440) (select (select (store (store .cse3 .cse2 v_ArrVal_432) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse0 .cse2 (store (select .cse0 .cse2) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9|) 0))))) is different from false [2022-02-20 16:55:43,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420988575] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:55:43,867 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:55:43,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2022-02-20 16:55:43,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643657729] [2022-02-20 16:55:43,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:55:43,869 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2022-02-20 16:55:43,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:43,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 44 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 16:55:43,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 65 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:43,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-02-20 16:55:43,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:55:43,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-02-20 16:55:43,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1928, Unknown=6, NotChecked=364, Total=2450 [2022-02-20 16:55:43,979 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 44 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 16:55:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:45,266 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-02-20 16:55:45,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 16:55:45,266 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2022-02-20 16:55:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 16:55:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2022-02-20 16:55:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 16:55:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2022-02-20 16:55:45,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 60 transitions. [2022-02-20 16:55:45,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:45,353 INFO L225 Difference]: With dead ends: 48 [2022-02-20 16:55:45,353 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 16:55:45,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=188, Invalid=2272, Unknown=6, NotChecked=396, Total=2862 [2022-02-20 16:55:45,355 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:45,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 333 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 342 Invalid, 0 Unknown, 56 Unchecked, 0.4s Time] [2022-02-20 16:55:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 16:55:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-02-20 16:55:45,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:45,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 44 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:45,371 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 44 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:45,371 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 44 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:45,374 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-02-20 16:55:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-02-20 16:55:45,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:45,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:45,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-02-20 16:55:45,375 INFO L87 Difference]: Start difference. First operand has 44 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-02-20 16:55:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:45,377 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-02-20 16:55:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-02-20 16:55:45,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:45,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:45,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:45,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-02-20 16:55:45,380 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 34 [2022-02-20 16:55:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:45,381 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-02-20 16:55:45,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 16:55:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-02-20 16:55:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 16:55:45,382 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:45,382 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:55:45,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:55:45,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:45,596 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:45,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:45,596 INFO L85 PathProgramCache]: Analyzing trace with hash 642377266, now seen corresponding path program 2 times [2022-02-20 16:55:45,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:45,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366964714] [2022-02-20 16:55:45,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:45,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:45,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:45,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {1066#(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; {1045#true} is VALID [2022-02-20 16:55:45,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {1045#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1045#true} is VALID [2022-02-20 16:55:45,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {1045#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1045#true} is VALID [2022-02-20 16:55:45,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-02-20 16:55:45,720 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1045#true} {1047#(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))} #112#return; {1047#(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 16:55:45,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:55:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:45,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {1066#(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; {1045#true} is VALID [2022-02-20 16:55:45,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {1045#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1045#true} is VALID [2022-02-20 16:55:45,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {1045#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1045#true} is VALID [2022-02-20 16:55:45,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-02-20 16:55:45,751 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1045#true} {1047#(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))} #114#return; {1047#(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 16:55:45,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 16:55:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:45,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {1066#(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; {1045#true} is VALID [2022-02-20 16:55:45,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {1045#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1045#true} is VALID [2022-02-20 16:55:45,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {1045#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1045#true} is VALID [2022-02-20 16:55:45,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-02-20 16:55:45,768 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1045#true} {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} #116#return; {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} is VALID [2022-02-20 16:55:45,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {1045#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(21, 2); {1045#true} is VALID [2022-02-20 16:55:45,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {1045#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {1047#(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 16:55:45,772 INFO L272 TraceCheckUtils]: 2: Hoare triple {1047#(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); {1066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:45,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {1066#(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; {1045#true} is VALID [2022-02-20 16:55:45,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {1045#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1045#true} is VALID [2022-02-20 16:55:45,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {1045#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1045#true} is VALID [2022-02-20 16:55:45,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-02-20 16:55:45,774 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1045#true} {1047#(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))} #112#return; {1047#(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 16:55:45,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {1047#(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; {1047#(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 16:55:45,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {1047#(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); {1047#(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 16:55:45,776 INFO L272 TraceCheckUtils]: 10: Hoare triple {1047#(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); {1066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:45,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {1066#(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; {1045#true} is VALID [2022-02-20 16:55:45,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {1045#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1045#true} is VALID [2022-02-20 16:55:45,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1045#true} is VALID [2022-02-20 16:55:45,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-02-20 16:55:45,778 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1045#true} {1047#(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))} #114#return; {1047#(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 16:55:45,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {1047#(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;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);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; {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:55:45,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} assume !(sll_circular_create_~len#1 > 1); {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:55:45,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} 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);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; {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:55:45,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} is VALID [2022-02-20 16:55:45,781 INFO L272 TraceCheckUtils]: 20: Hoare triple {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {1066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:45,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {1066#(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; {1045#true} is VALID [2022-02-20 16:55:45,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {1045#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1045#true} is VALID [2022-02-20 16:55:45,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {1045#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1045#true} is VALID [2022-02-20 16:55:45,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-02-20 16:55:45,782 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1045#true} {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} #116#return; {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} is VALID [2022-02-20 16:55:45,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} is VALID [2022-02-20 16:55:45,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} assume !!(sll_circular_insert_~index#1 > 0);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;call sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset := read~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;havoc sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;sll_circular_insert_#t~post12#1 := sll_circular_insert_~index#1;sll_circular_insert_~index#1 := sll_circular_insert_#t~post12#1 - 1;havoc sll_circular_insert_#t~post12#1; {1065#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 0)} is VALID [2022-02-20 16:55:45,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {1065#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 0)} assume !!(sll_circular_insert_~index#1 > 0);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;call sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset := read~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;havoc sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;sll_circular_insert_#t~post12#1 := sll_circular_insert_~index#1;sll_circular_insert_~index#1 := sll_circular_insert_#t~post12#1 - 1;havoc sll_circular_insert_#t~post12#1; {1046#false} is VALID [2022-02-20 16:55:45,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {1046#false} assume !(sll_circular_insert_~index#1 > 0); {1046#false} is VALID [2022-02-20 16:55:45,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {1046#false} assume sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4); {1046#false} is VALID [2022-02-20 16:55:45,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {1046#false} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {1046#false} is VALID [2022-02-20 16:55:45,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {1046#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4); {1046#false} is VALID [2022-02-20 16:55:45,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {1046#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {1046#false} is VALID [2022-02-20 16:55:45,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {1046#false} assume !false; {1046#false} is VALID [2022-02-20 16:55:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 16:55:45,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:45,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366964714] [2022-02-20 16:55:45,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366964714] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:55:45,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804976888] [2022-02-20 16:55:45,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:55:45,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:45,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:55:45,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:55:45,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 16:55:45,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:55:45,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:55:45,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:55:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:45,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:55:46,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {1045#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(21, 2); {1045#true} is VALID [2022-02-20 16:55:46,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {1045#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:55:46,320 INFO L272 TraceCheckUtils]: 2: Hoare triple {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |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); {1045#true} is VALID [2022-02-20 16:55:46,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {1045#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; {1045#true} is VALID [2022-02-20 16:55:46,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {1045#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1045#true} is VALID [2022-02-20 16:55:46,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {1045#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1045#true} is VALID [2022-02-20 16:55:46,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-02-20 16:55:46,321 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1045#true} {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} #112#return; {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:55:46,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |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; {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:55:46,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} assume !!(sll_circular_create_~len#1 > 1); {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:55:46,322 INFO L272 TraceCheckUtils]: 10: Hoare triple {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |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); {1045#true} is VALID [2022-02-20 16:55:46,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {1045#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; {1045#true} is VALID [2022-02-20 16:55:46,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {1045#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1045#true} is VALID [2022-02-20 16:55:46,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1045#true} is VALID [2022-02-20 16:55:46,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-02-20 16:55:46,323 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1045#true} {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} #114#return; {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:55:46,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |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;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);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; {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:55:46,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} assume !(sll_circular_create_~len#1 > 1); {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:55:46,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} 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);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; {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:55:46,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {1058#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2))} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} is VALID [2022-02-20 16:55:46,326 INFO L272 TraceCheckUtils]: 20: Hoare triple {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {1045#true} is VALID [2022-02-20 16:55:46,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {1045#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; {1045#true} is VALID [2022-02-20 16:55:46,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {1045#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1045#true} is VALID [2022-02-20 16:55:46,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {1045#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1045#true} is VALID [2022-02-20 16:55:46,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-02-20 16:55:46,328 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1045#true} {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} #116#return; {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} is VALID [2022-02-20 16:55:46,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} is VALID [2022-02-20 16:55:46,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {1059#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 1)} assume !!(sll_circular_insert_~index#1 > 0);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;call sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset := read~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;havoc sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;sll_circular_insert_#t~post12#1 := sll_circular_insert_~index#1;sll_circular_insert_~index#1 := sll_circular_insert_#t~post12#1 - 1;havoc sll_circular_insert_#t~post12#1; {1065#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 0)} is VALID [2022-02-20 16:55:46,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {1065#(<= |ULTIMATE.start_sll_circular_insert_~index#1| 0)} assume !!(sll_circular_insert_~index#1 > 0);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;call sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset := read~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;havoc sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;sll_circular_insert_#t~post12#1 := sll_circular_insert_~index#1;sll_circular_insert_~index#1 := sll_circular_insert_#t~post12#1 - 1;havoc sll_circular_insert_#t~post12#1; {1046#false} is VALID [2022-02-20 16:55:46,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {1046#false} assume !(sll_circular_insert_~index#1 > 0); {1046#false} is VALID [2022-02-20 16:55:46,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {1046#false} assume sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4); {1046#false} is VALID [2022-02-20 16:55:46,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {1046#false} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {1046#false} is VALID [2022-02-20 16:55:46,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {1046#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4); {1046#false} is VALID [2022-02-20 16:55:46,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {1046#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {1046#false} is VALID [2022-02-20 16:55:46,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {1046#false} assume !false; {1046#false} is VALID [2022-02-20 16:55:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 16:55:46,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:55:46,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804976888] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:55:46,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 16:55:46,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-02-20 16:55:46,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583629248] [2022-02-20 16:55:46,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:55:46,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-02-20 16:55:46,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:46,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:55:46,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:46,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:55:46,358 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:55:46,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:55:46,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:55:46,359 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:55:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:46,485 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-02-20 16:55:46,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:55:46,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-02-20 16:55:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:55:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 16:55:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:55:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 16:55:46,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 16:55:46,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:46,540 INFO L225 Difference]: With dead ends: 56 [2022-02-20 16:55:46,541 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 16:55:46,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:55:46,542 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:46,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 56 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:55:46,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 16:55:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 16:55:46,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:46,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:46,578 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:46,578 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:46,580 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-02-20 16:55:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-02-20 16:55:46,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:46,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:46,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 44 states. [2022-02-20 16:55:46,581 INFO L87 Difference]: Start difference. First operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 44 states. [2022-02-20 16:55:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:46,583 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-02-20 16:55:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-02-20 16:55:46,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:46,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:46,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:46,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-02-20 16:55:46,585 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 35 [2022-02-20 16:55:46,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:46,586 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-02-20 16:55:46,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:55:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-02-20 16:55:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 16:55:46,586 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:46,587 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:55:46,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 16:55:46,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:46,808 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:46,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:46,809 INFO L85 PathProgramCache]: Analyzing trace with hash 342309400, now seen corresponding path program 1 times [2022-02-20 16:55:46,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:46,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382999438] [2022-02-20 16:55:46,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:46,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:46,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:46,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {1422#(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; {1402#true} is VALID [2022-02-20 16:55:46,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {1402#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1402#true} is VALID [2022-02-20 16:55:46,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {1402#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1402#true} is VALID [2022-02-20 16:55:46,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 16:55:46,897 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1402#true} {1404#(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))} #112#return; {1404#(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 16:55:46,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:55:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:46,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {1422#(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; {1402#true} is VALID [2022-02-20 16:55:46,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {1402#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1402#true} is VALID [2022-02-20 16:55:46,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {1402#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1402#true} is VALID [2022-02-20 16:55:46,906 INFO L290 TraceCheckUtils]: 3: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 16:55:46,906 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1402#true} {1404#(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))} #114#return; {1404#(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 16:55:46,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 16:55:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:46,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {1422#(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; {1402#true} is VALID [2022-02-20 16:55:46,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {1402#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1402#true} is VALID [2022-02-20 16:55:46,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {1402#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1402#true} is VALID [2022-02-20 16:55:46,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 16:55:46,915 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1402#true} {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} #116#return; {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} is VALID [2022-02-20 16:55:46,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {1402#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(21, 2); {1402#true} is VALID [2022-02-20 16:55:46,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {1402#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {1404#(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 16:55:46,917 INFO L272 TraceCheckUtils]: 2: Hoare triple {1404#(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); {1422#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:46,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {1422#(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; {1402#true} is VALID [2022-02-20 16:55:46,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {1402#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1402#true} is VALID [2022-02-20 16:55:46,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {1402#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1402#true} is VALID [2022-02-20 16:55:46,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 16:55:46,918 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1402#true} {1404#(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))} #112#return; {1404#(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 16:55:46,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {1404#(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; {1404#(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 16:55:46,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {1404#(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); {1404#(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 16:55:46,920 INFO L272 TraceCheckUtils]: 10: Hoare triple {1404#(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); {1422#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:46,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {1422#(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; {1402#true} is VALID [2022-02-20 16:55:46,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {1402#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1402#true} is VALID [2022-02-20 16:55:46,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {1402#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1402#true} is VALID [2022-02-20 16:55:46,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 16:55:46,922 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1402#true} {1404#(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))} #114#return; {1404#(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 16:55:46,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {1404#(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;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);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; {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:46,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:46,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} 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);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; {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:46,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} is VALID [2022-02-20 16:55:46,925 INFO L272 TraceCheckUtils]: 20: Hoare triple {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {1422#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:46,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {1422#(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; {1402#true} is VALID [2022-02-20 16:55:46,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {1402#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1402#true} is VALID [2022-02-20 16:55:46,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {1402#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1402#true} is VALID [2022-02-20 16:55:46,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 16:55:46,926 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1402#true} {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} #116#return; {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} is VALID [2022-02-20 16:55:46,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} is VALID [2022-02-20 16:55:46,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} assume !(sll_circular_insert_~index#1 > 0); {1403#false} is VALID [2022-02-20 16:55:46,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {1403#false} assume !(sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0);call sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4); {1403#false} is VALID [2022-02-20 16:55:46,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {1403#false} assume sll_circular_insert_#t~mem13#1.base != 0 || sll_circular_insert_#t~mem13#1.offset != 0;havoc sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset;call sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);call write~$Pointer$(sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4);havoc sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset;call sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, 4);havoc sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset; {1403#false} is VALID [2022-02-20 16:55:46,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {1403#false} call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4); {1403#false} is VALID [2022-02-20 16:55:46,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {1403#false} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {1403#false} is VALID [2022-02-20 16:55:46,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {1403#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4); {1403#false} is VALID [2022-02-20 16:55:46,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {1403#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {1403#false} is VALID [2022-02-20 16:55:46,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {1403#false} assume !false; {1403#false} is VALID [2022-02-20 16:55:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 16:55:46,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:46,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382999438] [2022-02-20 16:55:46,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382999438] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:55:46,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66176344] [2022-02-20 16:55:46,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:46,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:46,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:55:46,930 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:55:46,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 16:55:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:47,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:55:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:47,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:55:47,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {1402#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(21, 2); {1402#true} is VALID [2022-02-20 16:55:47,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {1402#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:47,386 INFO L272 TraceCheckUtils]: 2: Hoare triple {1415#(<= 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); {1402#true} is VALID [2022-02-20 16:55:47,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {1402#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; {1402#true} is VALID [2022-02-20 16:55:47,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {1402#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1402#true} is VALID [2022-02-20 16:55:47,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {1402#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1402#true} is VALID [2022-02-20 16:55:47,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 16:55:47,388 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1402#true} {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #112#return; {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:47,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {1415#(<= 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; {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:47,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_circular_create_~len#1 > 1); {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:47,389 INFO L272 TraceCheckUtils]: 10: Hoare triple {1415#(<= 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); {1402#true} is VALID [2022-02-20 16:55:47,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {1402#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; {1402#true} is VALID [2022-02-20 16:55:47,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {1402#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1402#true} is VALID [2022-02-20 16:55:47,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {1402#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1402#true} is VALID [2022-02-20 16:55:47,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 16:55:47,390 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1402#true} {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #114#return; {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:47,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {1415#(<= 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;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);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; {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:47,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:47,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} 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);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; {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:47,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {1415#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} is VALID [2022-02-20 16:55:47,392 INFO L272 TraceCheckUtils]: 20: Hoare triple {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {1402#true} is VALID [2022-02-20 16:55:47,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {1402#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; {1402#true} is VALID [2022-02-20 16:55:47,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {1402#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1402#true} is VALID [2022-02-20 16:55:47,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {1402#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1402#true} is VALID [2022-02-20 16:55:47,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 16:55:47,394 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1402#true} {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} #116#return; {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} is VALID [2022-02-20 16:55:47,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} is VALID [2022-02-20 16:55:47,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {1416#(<= 1 |ULTIMATE.start_sll_circular_insert_~index#1|)} assume !(sll_circular_insert_~index#1 > 0); {1403#false} is VALID [2022-02-20 16:55:47,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {1403#false} assume !(sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0);call sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4); {1403#false} is VALID [2022-02-20 16:55:47,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {1403#false} assume sll_circular_insert_#t~mem13#1.base != 0 || sll_circular_insert_#t~mem13#1.offset != 0;havoc sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset;call sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);call write~$Pointer$(sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4);havoc sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset;call sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, 4);havoc sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset; {1403#false} is VALID [2022-02-20 16:55:47,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {1403#false} call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4); {1403#false} is VALID [2022-02-20 16:55:47,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {1403#false} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {1403#false} is VALID [2022-02-20 16:55:47,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {1403#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4); {1403#false} is VALID [2022-02-20 16:55:47,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {1403#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {1403#false} is VALID [2022-02-20 16:55:47,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {1403#false} assume !false; {1403#false} is VALID [2022-02-20 16:55:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 16:55:47,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:55:47,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66176344] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:55:47,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 16:55:47,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-02-20 16:55:47,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46559314] [2022-02-20 16:55:47,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:55:47,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-02-20 16:55:47,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:47,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:55:47,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:47,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:55:47,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:55:47,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:55:47,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:55:47,424 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:55:47,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:47,512 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-02-20 16:55:47,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:55:47,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-02-20 16:55:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:55:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-02-20 16:55:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:55:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-02-20 16:55:47,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2022-02-20 16:55:47,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:47,564 INFO L225 Difference]: With dead ends: 54 [2022-02-20 16:55:47,564 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 16:55:47,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:55:47,566 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:47,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 69 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:55:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 16:55:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 16:55:47,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:47,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:47,614 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:47,615 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:47,616 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-20 16:55:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-20 16:55:47,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:47,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:47,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 43 states. [2022-02-20 16:55:47,617 INFO L87 Difference]: Start difference. First operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 43 states. [2022-02-20 16:55:47,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:47,619 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-20 16:55:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-20 16:55:47,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:47,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:47,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:47,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-02-20 16:55:47,621 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 35 [2022-02-20 16:55:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:47,622 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-02-20 16:55:47,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:55:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-20 16:55:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 16:55:47,622 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:47,623 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:55:47,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:55:47,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:47,832 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:47,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:47,832 INFO L85 PathProgramCache]: Analyzing trace with hash -325516838, now seen corresponding path program 1 times [2022-02-20 16:55:47,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:47,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134719592] [2022-02-20 16:55:47,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:47,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:47,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {1770#(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; {1750#true} is VALID [2022-02-20 16:55:47,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {1750#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1750#true} is VALID [2022-02-20 16:55:47,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {1750#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1750#true} is VALID [2022-02-20 16:55:47,929 INFO L290 TraceCheckUtils]: 3: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 16:55:47,929 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1750#true} {1750#true} #112#return; {1750#true} is VALID [2022-02-20 16:55:47,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:55:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:47,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {1770#(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; {1750#true} is VALID [2022-02-20 16:55:47,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {1750#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1750#true} is VALID [2022-02-20 16:55:47,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {1750#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1750#true} is VALID [2022-02-20 16:55:47,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 16:55:47,942 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1750#true} {1750#true} #114#return; {1750#true} is VALID [2022-02-20 16:55:47,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 16:55:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:47,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {1770#(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; {1750#true} is VALID [2022-02-20 16:55:47,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {1750#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1750#true} is VALID [2022-02-20 16:55:47,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {1750#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1750#true} is VALID [2022-02-20 16:55:47,948 INFO L290 TraceCheckUtils]: 3: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 16:55:47,948 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1750#true} {1750#true} #116#return; {1750#true} is VALID [2022-02-20 16:55:47,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {1750#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(21, 2); {1750#true} is VALID [2022-02-20 16:55:47,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {1750#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {1750#true} is VALID [2022-02-20 16:55:47,950 INFO L272 TraceCheckUtils]: 2: Hoare triple {1750#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1770#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:47,950 INFO L290 TraceCheckUtils]: 3: Hoare triple {1770#(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; {1750#true} is VALID [2022-02-20 16:55:47,950 INFO L290 TraceCheckUtils]: 4: Hoare triple {1750#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1750#true} is VALID [2022-02-20 16:55:47,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {1750#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1750#true} is VALID [2022-02-20 16:55:47,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 16:55:47,950 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1750#true} {1750#true} #112#return; {1750#true} is VALID [2022-02-20 16:55:47,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {1750#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; {1750#true} is VALID [2022-02-20 16:55:47,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {1750#true} assume !!(sll_circular_create_~len#1 > 1); {1750#true} is VALID [2022-02-20 16:55:47,951 INFO L272 TraceCheckUtils]: 10: Hoare triple {1750#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1770#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:47,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {1770#(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; {1750#true} is VALID [2022-02-20 16:55:47,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {1750#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1750#true} is VALID [2022-02-20 16:55:47,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {1750#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1750#true} is VALID [2022-02-20 16:55:47,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 16:55:47,952 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1750#true} {1750#true} #114#return; {1750#true} is VALID [2022-02-20 16:55:47,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {1750#true} 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;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);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; {1750#true} is VALID [2022-02-20 16:55:47,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {1750#true} assume !(sll_circular_create_~len#1 > 1); {1750#true} is VALID [2022-02-20 16:55:47,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {1750#true} 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);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; {1750#true} is VALID [2022-02-20 16:55:47,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {1750#true} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {1750#true} is VALID [2022-02-20 16:55:47,953 INFO L272 TraceCheckUtils]: 20: Hoare triple {1750#true} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {1770#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:47,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {1770#(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; {1750#true} is VALID [2022-02-20 16:55:47,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {1750#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1750#true} is VALID [2022-02-20 16:55:47,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {1750#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1750#true} is VALID [2022-02-20 16:55:47,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 16:55:47,954 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1750#true} {1750#true} #116#return; {1750#true} is VALID [2022-02-20 16:55:47,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {1750#true} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {1767#(and (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)))} is VALID [2022-02-20 16:55:47,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {1767#(and (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)))} assume !!(sll_circular_insert_~index#1 > 0);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;call sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset := read~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;havoc sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;sll_circular_insert_#t~post12#1 := sll_circular_insert_~index#1;sll_circular_insert_~index#1 := sll_circular_insert_#t~post12#1 - 1;havoc sll_circular_insert_#t~post12#1; {1768#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)))} is VALID [2022-02-20 16:55:47,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {1768#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)))} assume !(sll_circular_insert_~index#1 > 0); {1768#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)))} is VALID [2022-02-20 16:55:47,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {1768#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)))} assume !(sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0);call sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4); {1769#(and (= 0 |ULTIMATE.start_sll_circular_insert_#t~mem13#1.base|) (= 0 |ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset|))} is VALID [2022-02-20 16:55:47,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {1769#(and (= 0 |ULTIMATE.start_sll_circular_insert_#t~mem13#1.base|) (= 0 |ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset|))} assume sll_circular_insert_#t~mem13#1.base != 0 || sll_circular_insert_#t~mem13#1.offset != 0;havoc sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset;call sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);call write~$Pointer$(sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4);havoc sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset;call sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, 4);havoc sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset; {1751#false} is VALID [2022-02-20 16:55:47,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {1751#false} call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4); {1751#false} is VALID [2022-02-20 16:55:47,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {1751#false} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {1751#false} is VALID [2022-02-20 16:55:47,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {1751#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4); {1751#false} is VALID [2022-02-20 16:55:47,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {1751#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {1751#false} is VALID [2022-02-20 16:55:47,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {1751#false} assume !false; {1751#false} is VALID [2022-02-20 16:55:47,958 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-20 16:55:47,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:47,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134719592] [2022-02-20 16:55:47,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134719592] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:55:47,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612022362] [2022-02-20 16:55:47,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:47,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:47,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:55:47,960 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 16:55:47,961 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 16:55:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:48,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 16:55:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:48,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:55:48,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:55:48,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:55:48,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {1750#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(21, 2); {1750#true} is VALID [2022-02-20 16:55:48,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {1750#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {1750#true} is VALID [2022-02-20 16:55:48,312 INFO L272 TraceCheckUtils]: 2: Hoare triple {1750#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1750#true} is VALID [2022-02-20 16:55:48,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {1750#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; {1750#true} is VALID [2022-02-20 16:55:48,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {1750#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1750#true} is VALID [2022-02-20 16:55:48,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {1750#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1750#true} is VALID [2022-02-20 16:55:48,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 16:55:48,313 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1750#true} {1750#true} #112#return; {1750#true} is VALID [2022-02-20 16:55:48,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {1750#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; {1750#true} is VALID [2022-02-20 16:55:48,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {1750#true} assume !!(sll_circular_create_~len#1 > 1); {1750#true} is VALID [2022-02-20 16:55:48,313 INFO L272 TraceCheckUtils]: 10: Hoare triple {1750#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1750#true} is VALID [2022-02-20 16:55:48,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {1750#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; {1750#true} is VALID [2022-02-20 16:55:48,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {1750#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1750#true} is VALID [2022-02-20 16:55:48,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {1750#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1750#true} is VALID [2022-02-20 16:55:48,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 16:55:48,314 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1750#true} {1750#true} #114#return; {1750#true} is VALID [2022-02-20 16:55:48,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {1750#true} 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;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);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; {1750#true} is VALID [2022-02-20 16:55:48,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {1750#true} assume !(sll_circular_create_~len#1 > 1); {1750#true} is VALID [2022-02-20 16:55:48,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {1750#true} 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);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; {1750#true} is VALID [2022-02-20 16:55:48,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {1750#true} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {1750#true} is VALID [2022-02-20 16:55:48,315 INFO L272 TraceCheckUtils]: 20: Hoare triple {1750#true} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {1750#true} is VALID [2022-02-20 16:55:48,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {1750#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; {1750#true} is VALID [2022-02-20 16:55:48,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {1750#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1750#true} is VALID [2022-02-20 16:55:48,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {1750#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1750#true} is VALID [2022-02-20 16:55:48,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 16:55:48,315 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1750#true} {1750#true} #116#return; {1750#true} is VALID [2022-02-20 16:55:48,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {1750#true} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {1767#(and (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)))} is VALID [2022-02-20 16:55:48,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {1767#(and (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)))} assume !!(sll_circular_insert_~index#1 > 0);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;call sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset := read~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;havoc sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;sll_circular_insert_#t~post12#1 := sll_circular_insert_~index#1;sll_circular_insert_~index#1 := sll_circular_insert_#t~post12#1 - 1;havoc sll_circular_insert_#t~post12#1; {1768#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)))} is VALID [2022-02-20 16:55:48,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {1768#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)))} assume !(sll_circular_insert_~index#1 > 0); {1768#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)))} is VALID [2022-02-20 16:55:48,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {1768#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)))} assume !(sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0);call sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4); {1769#(and (= 0 |ULTIMATE.start_sll_circular_insert_#t~mem13#1.base|) (= 0 |ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset|))} is VALID [2022-02-20 16:55:48,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {1769#(and (= 0 |ULTIMATE.start_sll_circular_insert_#t~mem13#1.base|) (= 0 |ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset|))} assume sll_circular_insert_#t~mem13#1.base != 0 || sll_circular_insert_#t~mem13#1.offset != 0;havoc sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset;call sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);call write~$Pointer$(sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4);havoc sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset;call sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, 4);havoc sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset; {1751#false} is VALID [2022-02-20 16:55:48,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {1751#false} call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4); {1751#false} is VALID [2022-02-20 16:55:48,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {1751#false} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {1751#false} is VALID [2022-02-20 16:55:48,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {1751#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4); {1751#false} is VALID [2022-02-20 16:55:48,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {1751#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {1751#false} is VALID [2022-02-20 16:55:48,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {1751#false} assume !false; {1751#false} is VALID [2022-02-20 16:55:48,319 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-20 16:55:48,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:55:48,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {1751#false} assume !false; {1751#false} is VALID [2022-02-20 16:55:48,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {1751#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {1751#false} is VALID [2022-02-20 16:55:48,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {1751#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4); {1751#false} is VALID [2022-02-20 16:55:48,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {1751#false} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {1751#false} is VALID [2022-02-20 16:55:48,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {1751#false} call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4); {1751#false} is VALID [2022-02-20 16:55:48,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {1769#(and (= 0 |ULTIMATE.start_sll_circular_insert_#t~mem13#1.base|) (= 0 |ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset|))} assume sll_circular_insert_#t~mem13#1.base != 0 || sll_circular_insert_#t~mem13#1.offset != 0;havoc sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset;call sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);call write~$Pointer$(sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4);havoc sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset;call sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, 4);havoc sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset; {1751#false} is VALID [2022-02-20 16:55:48,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {1897#(or (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0)) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)))} assume !(sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0);call sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4); {1769#(and (= 0 |ULTIMATE.start_sll_circular_insert_#t~mem13#1.base|) (= 0 |ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset|))} is VALID [2022-02-20 16:55:48,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {1897#(or (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0)) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)))} assume !(sll_circular_insert_~index#1 > 0); {1897#(or (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0)) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)))} is VALID [2022-02-20 16:55:48,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {1904#(or (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| 0)) (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)))} assume !!(sll_circular_insert_~index#1 > 0);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;call sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset := read~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;havoc sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;sll_circular_insert_#t~post12#1 := sll_circular_insert_~index#1;sll_circular_insert_~index#1 := sll_circular_insert_#t~post12#1 - 1;havoc sll_circular_insert_#t~post12#1; {1897#(or (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0)) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)))} is VALID [2022-02-20 16:55:48,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {1750#true} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {1904#(or (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| 0)) (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)))} is VALID [2022-02-20 16:55:48,469 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1750#true} {1750#true} #116#return; {1750#true} is VALID [2022-02-20 16:55:48,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 16:55:48,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {1750#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1750#true} is VALID [2022-02-20 16:55:48,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {1750#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1750#true} is VALID [2022-02-20 16:55:48,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {1750#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; {1750#true} is VALID [2022-02-20 16:55:48,470 INFO L272 TraceCheckUtils]: 20: Hoare triple {1750#true} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {1750#true} is VALID [2022-02-20 16:55:48,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {1750#true} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {1750#true} is VALID [2022-02-20 16:55:48,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {1750#true} 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);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; {1750#true} is VALID [2022-02-20 16:55:48,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {1750#true} assume !(sll_circular_create_~len#1 > 1); {1750#true} is VALID [2022-02-20 16:55:48,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {1750#true} 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;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);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; {1750#true} is VALID [2022-02-20 16:55:48,471 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1750#true} {1750#true} #114#return; {1750#true} is VALID [2022-02-20 16:55:48,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 16:55:48,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {1750#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1750#true} is VALID [2022-02-20 16:55:48,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {1750#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1750#true} is VALID [2022-02-20 16:55:48,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {1750#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; {1750#true} is VALID [2022-02-20 16:55:48,471 INFO L272 TraceCheckUtils]: 10: Hoare triple {1750#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1750#true} is VALID [2022-02-20 16:55:48,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {1750#true} assume !!(sll_circular_create_~len#1 > 1); {1750#true} is VALID [2022-02-20 16:55:48,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {1750#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; {1750#true} is VALID [2022-02-20 16:55:48,472 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1750#true} {1750#true} #112#return; {1750#true} is VALID [2022-02-20 16:55:48,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 16:55:48,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {1750#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1750#true} is VALID [2022-02-20 16:55:48,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {1750#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1750#true} is VALID [2022-02-20 16:55:48,473 INFO L290 TraceCheckUtils]: 3: Hoare triple {1750#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; {1750#true} is VALID [2022-02-20 16:55:48,473 INFO L272 TraceCheckUtils]: 2: Hoare triple {1750#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1750#true} is VALID [2022-02-20 16:55:48,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {1750#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {1750#true} is VALID [2022-02-20 16:55:48,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {1750#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(21, 2); {1750#true} is VALID [2022-02-20 16:55:48,473 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-20 16:55:48,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612022362] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:55:48,474 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:55:48,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-02-20 16:55:48,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552902300] [2022-02-20 16:55:48,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:55:48,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-20 16:55:48,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:48,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:55:48,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:48,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:55:48,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:55:48,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:55:48,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:55:48,506 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:55:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:48,762 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-02-20 16:55:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:55:48,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-20 16:55:48,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:55:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-02-20 16:55:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:55:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-02-20 16:55:48,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-02-20 16:55:48,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:48,811 INFO L225 Difference]: With dead ends: 60 [2022-02-20 16:55:48,812 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 16:55:48,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:55:48,812 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:48,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 118 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:55:48,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 16:55:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2022-02-20 16:55:48,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:48,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 43 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:48,849 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 43 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:48,849 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 43 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:48,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:48,850 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-02-20 16:55:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-02-20 16:55:48,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:48,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:48,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-02-20 16:55:48,851 INFO L87 Difference]: Start difference. First operand has 43 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-02-20 16:55:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:48,852 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-02-20 16:55:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-02-20 16:55:48,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:48,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:48,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:48,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-02-20 16:55:48,854 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 36 [2022-02-20 16:55:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:48,854 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-02-20 16:55:48,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:55:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-02-20 16:55:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 16:55:48,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:48,855 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:55:48,880 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 16:55:49,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:49,059 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:49,060 INFO L85 PathProgramCache]: Analyzing trace with hash -268258536, now seen corresponding path program 1 times [2022-02-20 16:55:49,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:49,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090302517] [2022-02-20 16:55:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:49,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:49,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:49,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {2257#(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; {2232#true} is VALID [2022-02-20 16:55:49,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {2232#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2232#true} is VALID [2022-02-20 16:55:49,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {2232#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2232#true} is VALID [2022-02-20 16:55:49,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {2232#true} assume true; {2232#true} is VALID [2022-02-20 16:55:49,219 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2232#true} {2234#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #112#return; {2234#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:55:49,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:55:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:49,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {2257#(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; {2258#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:55:49,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {2258#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2258#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:55:49,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {2258#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2259#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:55:49,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {2259#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {2259#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:55:49,275 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2259#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {2234#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #114#return; {2245#(and (not (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:55:49,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 16:55:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:49,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {2257#(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; {2260#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:55:49,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {2260#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2260#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:55:49,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {2260#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2261#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:55:49,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {2261#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {2261#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:55:49,342 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2261#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {2248#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #116#return; {2254#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 16:55:49,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {2232#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(21, 2); {2232#true} is VALID [2022-02-20 16:55:49,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {2232#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {2234#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:55:49,344 INFO L272 TraceCheckUtils]: 2: Hoare triple {2234#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2257#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:49,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {2257#(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; {2232#true} is VALID [2022-02-20 16:55:49,344 INFO L290 TraceCheckUtils]: 4: Hoare triple {2232#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2232#true} is VALID [2022-02-20 16:55:49,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {2232#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2232#true} is VALID [2022-02-20 16:55:49,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {2232#true} assume true; {2232#true} is VALID [2022-02-20 16:55:49,345 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2232#true} {2234#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #112#return; {2234#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:55:49,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {2234#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#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; {2234#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:55:49,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {2234#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(sll_circular_create_~len#1 > 1); {2234#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:55:49,347 INFO L272 TraceCheckUtils]: 10: Hoare triple {2234#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~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); {2257#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:49,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {2257#(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; {2258#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:55:49,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {2258#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2258#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:55:49,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {2258#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2259#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:55:49,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {2259#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {2259#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:55:49,351 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2259#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {2234#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #114#return; {2245#(and (not (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:55:49,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {2245#(and (not (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~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;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);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; {2246#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0)))} is VALID [2022-02-20 16:55:49,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {2246#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0)))} assume !(sll_circular_create_~len#1 > 1); {2246#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0)))} is VALID [2022-02-20 16:55:49,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {2246#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0)))} 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);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; {2247#(and (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:55:49,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {2247#(and (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {2248#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:55:49,355 INFO L272 TraceCheckUtils]: 20: Hoare triple {2248#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {2257#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:49,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {2257#(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; {2260#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:55:49,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {2260#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2260#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:55:49,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {2260#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2261#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:55:49,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {2261#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {2261#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:55:49,360 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2261#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {2248#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #116#return; {2254#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 16:55:49,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {2254#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {2255#(and (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 16:55:49,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {2255#(and (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} assume !!(sll_circular_insert_~index#1 > 0);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;call sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset := read~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;havoc sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;sll_circular_insert_#t~post12#1 := sll_circular_insert_~index#1;sll_circular_insert_~index#1 := sll_circular_insert_#t~post12#1 - 1;havoc sll_circular_insert_#t~post12#1; {2256#(and (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 16:55:49,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {2256#(and (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} assume !(sll_circular_insert_~index#1 > 0); {2256#(and (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 16:55:49,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {2256#(and (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} assume !(sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0);call sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4); {2233#false} is VALID [2022-02-20 16:55:49,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {2233#false} assume !(sll_circular_insert_#t~mem13#1.base != 0 || sll_circular_insert_#t~mem13#1.offset != 0);havoc sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset;call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4); {2233#false} is VALID [2022-02-20 16:55:49,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {2233#false} call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4); {2233#false} is VALID [2022-02-20 16:55:49,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {2233#false} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {2233#false} is VALID [2022-02-20 16:55:49,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {2233#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4); {2233#false} is VALID [2022-02-20 16:55:49,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {2233#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {2233#false} is VALID [2022-02-20 16:55:49,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {2233#false} assume !false; {2233#false} is VALID [2022-02-20 16:55:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:55:49,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:49,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090302517] [2022-02-20 16:55:49,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090302517] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:55:49,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214935205] [2022-02-20 16:55:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:49,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:49,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:55:49,365 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 16:55:49,366 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 16:55:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:49,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 46 conjunts are in the unsatisfiable core [2022-02-20 16:55:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:49,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:55:49,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 16:55:50,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:50,062 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 24 treesize of output 24 [2022-02-20 16:55:50,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 16:55:50,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {2232#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(21, 2); {2232#true} is VALID [2022-02-20 16:55:50,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {2232#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {2268#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:55:50,246 INFO L272 TraceCheckUtils]: 2: Hoare triple {2268#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2232#true} is VALID [2022-02-20 16:55:50,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {2232#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; {2232#true} is VALID [2022-02-20 16:55:50,246 INFO L290 TraceCheckUtils]: 4: Hoare triple {2232#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2232#true} is VALID [2022-02-20 16:55:50,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {2232#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2232#true} is VALID [2022-02-20 16:55:50,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {2232#true} assume true; {2232#true} is VALID [2022-02-20 16:55:50,247 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2232#true} {2268#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} #112#return; {2268#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:55:50,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {2268#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 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; {2268#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:55:50,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {2268#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(sll_circular_create_~len#1 > 1); {2268#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:55:50,249 INFO L272 TraceCheckUtils]: 10: Hoare triple {2268#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {2232#true} is VALID [2022-02-20 16:55:50,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {2232#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; {2258#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:55:50,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {2258#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2258#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:55:50,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {2258#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2259#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:55:50,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {2259#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {2259#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:55:50,252 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2259#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {2268#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} #114#return; {2311#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1) 0) (<= 1 |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 16:55:50,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {2311#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1) 0) (<= 1 |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;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);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; {2315#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= 1 |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.base| 1) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:55:50,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {2315#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= 1 |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.base| 1) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(sll_circular_create_~len#1 > 1); {2315#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= 1 |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.base| 1) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:55:50,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {2315#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= 1 |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.base| 1) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} 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);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; {2322#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= 1 |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= (+ |ULTIMATE.start_sll_circular_create_#res#1.base| 1) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:55:50,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {2322#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= 1 |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= (+ |ULTIMATE.start_sll_circular_create_#res#1.base| 1) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {2326#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:55:50,257 INFO L272 TraceCheckUtils]: 20: Hoare triple {2326#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {2330#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} is VALID [2022-02-20 16:55:50,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {2330#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} ~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; {2260#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:55:50,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {2260#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2260#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:55:50,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {2260#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2340#(and (exists ((v_ArrVal_1219 (Array Int Int))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_1219) |#memory_$Pointer$.base|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 16:55:50,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {2340#(and (exists ((v_ArrVal_1219 (Array Int Int))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_1219) |#memory_$Pointer$.base|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|))} assume true; {2340#(and (exists ((v_ArrVal_1219 (Array Int Int))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_1219) |#memory_$Pointer$.base|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 16:55:50,262 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2340#(and (exists ((v_ArrVal_1219 (Array Int Int))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_1219) |#memory_$Pointer$.base|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|))} {2326#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} #116#return; {2347#(and (or (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (< (+ |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:55:50,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {2347#(and (or (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (< (+ |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {2351#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (or (<= 1 |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (<= (+ |ULTIMATE.start_sll_circular_insert_~last~1#1.base| 1) 0)) (< (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:55:50,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {2351#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (or (<= 1 |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (<= (+ |ULTIMATE.start_sll_circular_insert_~last~1#1.base| 1) 0)) (< (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !!(sll_circular_insert_~index#1 > 0);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;call sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset := read~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;havoc sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;sll_circular_insert_#t~post12#1 := sll_circular_insert_~index#1;sll_circular_insert_~index#1 := sll_circular_insert_#t~post12#1 - 1;havoc sll_circular_insert_#t~post12#1; {2355#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (or (<= 1 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) (<= (+ |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 1) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:55:50,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {2355#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (or (<= 1 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) (<= (+ |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 1) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !(sll_circular_insert_~index#1 > 0); {2355#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (or (<= 1 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) (<= (+ |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 1) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:55:50,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {2355#(and (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (or (<= 1 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) (<= (+ |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 1) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !(sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0);call sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4); {2233#false} is VALID [2022-02-20 16:55:50,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {2233#false} assume !(sll_circular_insert_#t~mem13#1.base != 0 || sll_circular_insert_#t~mem13#1.offset != 0);havoc sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset;call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4); {2233#false} is VALID [2022-02-20 16:55:50,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {2233#false} call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4); {2233#false} is VALID [2022-02-20 16:55:50,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {2233#false} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {2233#false} is VALID [2022-02-20 16:55:50,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {2233#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4); {2233#false} is VALID [2022-02-20 16:55:50,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {2233#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {2233#false} is VALID [2022-02-20 16:55:50,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {2233#false} assume !false; {2233#false} is VALID [2022-02-20 16:55:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:55:50,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:55:50,456 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1224 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| v_ArrVal_1224) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)))) is different from false [2022-02-20 16:55:50,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214935205] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:55:50,460 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:55:50,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-02-20 16:55:50,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950839543] [2022-02-20 16:55:50,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:55:50,461 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2022-02-20 16:55:50,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:50,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:55:50,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:50,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 16:55:50,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:55:50,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 16:55:50,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=668, Unknown=1, NotChecked=52, Total=812 [2022-02-20 16:55:50,521 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:55:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:51,347 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-02-20 16:55:51,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 16:55:51,347 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2022-02-20 16:55:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:55:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2022-02-20 16:55:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:55:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2022-02-20 16:55:51,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 46 transitions. [2022-02-20 16:55:51,400 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 16:55:51,401 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:55:51,401 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 16:55:51,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=987, Unknown=1, NotChecked=64, Total=1190 [2022-02-20 16:55:51,402 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:51,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 253 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 227 Invalid, 0 Unknown, 21 Unchecked, 0.2s Time] [2022-02-20 16:55:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 16:55:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-20 16:55:51,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:51,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:51,467 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:51,470 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:51,475 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-02-20 16:55:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-02-20 16:55:51,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:51,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:51,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 41 states. [2022-02-20 16:55:51,476 INFO L87 Difference]: Start difference. First operand has 41 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 41 states. [2022-02-20 16:55:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:51,478 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-02-20 16:55:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-02-20 16:55:51,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:51,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:51,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:51,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:55:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-02-20 16:55:51,482 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 36 [2022-02-20 16:55:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:51,483 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-02-20 16:55:51,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:55:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-02-20 16:55:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 16:55:51,492 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:51,492 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:55:51,511 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 16:55:51,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:51,704 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:51,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:51,704 INFO L85 PathProgramCache]: Analyzing trace with hash 518615240, now seen corresponding path program 1 times [2022-02-20 16:55:51,705 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:51,705 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555087360] [2022-02-20 16:55:51,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:51,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:51,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:52,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {2669#(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; {2640#true} is VALID [2022-02-20 16:55:52,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {2640#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2640#true} is VALID [2022-02-20 16:55:52,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {2640#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2640#true} is VALID [2022-02-20 16:55:52,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {2640#true} assume true; {2640#true} is VALID [2022-02-20 16:55:52,005 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2640#true} {2642#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #112#return; {2642#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:55:52,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:55:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:52,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {2669#(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; {2670#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 16:55:52,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {2670#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2670#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 16:55:52,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {2670#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2671#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:55:52,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {2671#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {2671#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:55:52,068 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2671#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} {2642#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #114#return; {2653#(and (not (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:55:52,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 16:55:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:52,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {2669#(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; {2672#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:52,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2672#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:52,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2673#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:55:52,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {2673#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {2673#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:55:52,159 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2673#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {2656#(and (= |ULTIMATE.start_sll_circular_insert_~head#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_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))} #116#return; {2662#(and (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))} is VALID [2022-02-20 16:55:52,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {2640#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(21, 2); {2640#true} is VALID [2022-02-20 16:55:52,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {2640#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1.base, main_#t~ret16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {2642#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:55:52,161 INFO L272 TraceCheckUtils]: 2: Hoare triple {2642#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:52,161 INFO L290 TraceCheckUtils]: 3: Hoare triple {2669#(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; {2640#true} is VALID [2022-02-20 16:55:52,161 INFO L290 TraceCheckUtils]: 4: Hoare triple {2640#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2640#true} is VALID [2022-02-20 16:55:52,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {2640#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2640#true} is VALID [2022-02-20 16:55:52,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {2640#true} assume true; {2640#true} is VALID [2022-02-20 16:55:52,162 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2640#true} {2642#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #112#return; {2642#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:55:52,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {2642#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#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; {2642#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:55:52,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {2642#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(sll_circular_create_~len#1 > 1); {2642#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:55:52,164 INFO L272 TraceCheckUtils]: 10: Hoare triple {2642#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~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); {2669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:52,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {2669#(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; {2670#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 16:55:52,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {2670#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2670#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 16:55:52,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {2670#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2671#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:55:52,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {2671#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {2671#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:55:52,168 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2671#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} {2642#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #114#return; {2653#(and (not (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:55:52,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {2653#(and (not (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~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;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);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; {2654#(and (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:55:52,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {2654#(and (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !(sll_circular_create_~len#1 > 1); {2654#(and (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:55:52,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {2654#(and (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} 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);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; {2655#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:55:52,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {2655#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} main_#t~ret16#1.base, main_#t~ret16#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;call write~init~$Pointer$(main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret16#1.base, main_#t~ret16#1.offset;assume { :begin_inline_sll_circular_insert } true;sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset, sll_circular_insert_#in~data#1, sll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset, sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset, sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset, sll_circular_insert_#t~post12#1, sll_circular_insert_#t~mem13#1.base, sll_circular_insert_#t~mem13#1.offset, sll_circular_insert_#t~mem14#1.base, sll_circular_insert_#t~mem14#1.offset, sll_circular_insert_#t~mem15#1.base, sll_circular_insert_#t~mem15#1.offset, sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, sll_circular_insert_~data#1, sll_circular_insert_~index#1, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset := sll_circular_insert_#in~head#1.base, sll_circular_insert_#in~head#1.offset;sll_circular_insert_~data#1 := sll_circular_insert_#in~data#1;sll_circular_insert_~index#1 := sll_circular_insert_#in~index#1; {2656#(and (= |ULTIMATE.start_sll_circular_insert_~head#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_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_insert_~head#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 16:55:52,172 INFO L272 TraceCheckUtils]: 20: Hoare triple {2656#(and (= |ULTIMATE.start_sll_circular_insert_~head#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_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))} call sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset := node_create(sll_circular_insert_~data#1); {2669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:55:52,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {2669#(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; {2672#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:52,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {2672#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2672#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:52,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {2672#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2673#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:55:52,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {2673#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {2673#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:55:52,178 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2673#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {2656#(and (= |ULTIMATE.start_sll_circular_insert_~head#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_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))} #116#return; {2662#(and (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))} is VALID [2022-02-20 16:55:52,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {2662#(and (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|) |ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))} sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset := sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;havoc sll_circular_insert_#t~ret9#1.base, sll_circular_insert_#t~ret9#1.offset;sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset := read~$Pointer$(sll_circular_insert_~head#1.base, sll_circular_insert_~head#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset;havoc sll_circular_insert_#t~mem10#1.base, sll_circular_insert_#t~mem10#1.offset; {2663#(and (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:55:52,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {2663#(and (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (not (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!(sll_circular_insert_~index#1 > 0);sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset := sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset;call sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset := read~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, 4);sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset := sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;havoc sll_circular_insert_#t~mem11#1.base, sll_circular_insert_#t~mem11#1.offset;sll_circular_insert_#t~post12#1 := sll_circular_insert_~index#1;sll_circular_insert_~index#1 := sll_circular_insert_#t~post12#1 - 1;havoc sll_circular_insert_#t~post12#1; {2664#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:55:52,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {2664#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !(sll_circular_insert_~index#1 > 0); {2664#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:55:52,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {2664#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume sll_circular_insert_~snd_to_last~0#1.base != 0 || sll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, sll_circular_insert_~snd_to_last~0#1.base, sll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(sll_circular_insert_~last~1#1.base, sll_circular_insert_~last~1#1.offset, sll_circular_insert_~new_node~0#1.base, sll_circular_insert_~new_node~0#1.offset, 4); {2665#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} is VALID [2022-02-20 16:55:52,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {2665#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} assume { :end_inline_sll_circular_insert } true;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;main_~count~0#1 := 0; {2666#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} is VALID [2022-02-20 16:55:52,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {2666#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4); {2666#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} is VALID [2022-02-20 16:55:52,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {2666#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} assume !(main_~data~0#1 != main_#t~mem19#1);havoc main_#t~mem19#1;call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~ptr~0#1.base, main_~ptr~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;main_#t~post21#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; {2667#(not (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} is VALID [2022-02-20 16:55:52,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {2667#(not (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2668#(not (= |ULTIMATE.start_main_#t~mem18#1.base| |ULTIMATE.start_main_~ptr~0#1.base|))} is VALID [2022-02-20 16:55:52,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {2668#(not (= |ULTIMATE.start_main_#t~mem18#1.base| |ULTIMATE.start_main_~ptr~0#1.base|))} assume !(main_~ptr~0#1.base != main_#t~mem18#1.base || main_~ptr~0#1.offset != main_#t~mem18#1.offset);havoc main_#t~mem18#1.base, main_#t~mem18#1.offset; {2641#false} is VALID [2022-02-20 16:55:52,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {2641#false} assume main_~count~0#1 != 1 + main_~len~0#1; {2641#false} is VALID [2022-02-20 16:55:52,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {2641#false} assume !false; {2641#false} is VALID [2022-02-20 16:55:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:55:52,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:52,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555087360] [2022-02-20 16:55:52,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555087360] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:55:52,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185816032] [2022-02-20 16:55:52,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:52,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:52,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:55:52,197 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 16:55:52,199 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 16:55:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:52,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 103 conjunts are in the unsatisfiable core [2022-02-20 16:55:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:52,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:55:52,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 16:55:52,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 16:55:52,559 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 16:55:52,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 16:55:52,747 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:55:52,747 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 7 [2022-02-20 16:55:52,896 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-02-20 16:55:52,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-02-20 16:55:52,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:55:53,133 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 16:55:53,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-02-20 16:55:53,336 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 16:55:53,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2022-02-20 16:55:53,418 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:55:53,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-02-20 16:55:53,472 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 7 treesize of output 3 [2022-02-20 16:55:53,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:53,698 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-02-20 16:55:53,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2022-02-20 16:55:53,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:53,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:53,720 INFO L356 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-02-20 16:55:53,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-02-20 16:55:53,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:53,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 16:55:54,136 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-20 16:55:54,137 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 22 treesize of output 32 [2022-02-20 16:55:54,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:54,266 INFO L356 Elim1Store]: treesize reduction 55, result has 48.6 percent of original size [2022-02-20 16:55:54,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 99 treesize of output 125 [2022-02-20 16:55:54,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:54,326 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-20 16:55:54,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 69 [2022-02-20 16:55:54,376 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2022-02-20 16:55:54,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:54,449 INFO L356 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2022-02-20 16:55:54,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 112 [2022-02-20 16:55:54,690 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 12 treesize of output 11 [2022-02-20 16:55:54,729 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 41 treesize of output 35 [2022-02-20 16:55:55,989 INFO L356 Elim1Store]: treesize reduction 92, result has 23.3 percent of original size [2022-02-20 16:55:55,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 180 treesize of output 246 [2022-02-20 16:56:03,492 INFO L356 Elim1Store]: treesize reduction 171, result has 30.8 percent of original size [2022-02-20 16:56:03,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 981 treesize of output 1098 [2022-02-20 16:56:04,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:56:04,958 INFO L356 Elim1Store]: treesize reduction 118, result has 0.8 percent of original size [2022-02-20 16:56:04,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 89 treesize of output 78 [2022-02-20 16:56:05,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:56:05,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:56:05,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:56:05,109 INFO L356 Elim1Store]: treesize reduction 91, result has 1.1 percent of original size [2022-02-20 16:56:05,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 89 treesize of output 78 [2022-02-20 16:56:05,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:56:05,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:56:05,398 INFO L356 Elim1Store]: treesize reduction 221, result has 5.2 percent of original size [2022-02-20 16:56:05,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 94 treesize of output 93 [2022-02-20 16:56:05,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:56:05,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:56:05,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:56:05,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:56:05,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:56:05,610 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-02-20 16:56:05,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 78 [2022-02-20 16:56:07,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:56:07,232 INFO L356 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-02-20 16:56:07,232 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 3 case distinctions, treesize of input 42 treesize of output 15 [2022-02-20 16:56:08,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:56:08,124 INFO L356 Elim1Store]: treesize reduction 75, result has 9.6 percent of original size [2022-02-20 16:56:08,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 30