./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:59:30,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:59:30,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:59:30,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:59:30,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:59:30,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:59:30,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:59:30,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:59:30,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:59:30,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:59:30,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:59:30,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:59:30,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:59:30,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:59:30,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:59:30,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:59:30,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:59:30,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:59:30,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:59:30,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:59:30,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:59:30,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:59:30,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:59:30,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:59:30,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:59:30,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:59:30,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:59:30,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:59:30,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:59:30,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:59:30,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:59:30,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:59:30,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:59:30,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:59:30,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:59:30,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:59:30,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:59:30,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:59:30,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:59:30,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:59:30,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:59:30,625 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:59:30,654 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:59:30,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:59:30,655 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:59:30,655 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:59:30,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:59:30,656 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:59:30,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:59:30,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:59:30,656 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:59:30,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:59:30,657 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:59:30,657 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:59:30,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:59:30,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:59:30,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:59:30,658 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:59:30,658 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:59:30,658 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:59:30,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:59:30,659 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:59:30,659 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:59:30,659 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:59:30,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:59:30,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:59:30,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:59:30,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:59:30,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:59:30,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:59:30,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:59:30,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:59:30,661 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2022-02-20 23:59:30,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:59:30,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:59:30,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:59:30,840 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:59:30,840 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:59:30,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2022-02-20 23:59:30,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25add3d22/392e67931ab74d49919f7d1609c533e2/FLAG6cfc474e2 [2022-02-20 23:59:31,291 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:59:31,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2022-02-20 23:59:31,310 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25add3d22/392e67931ab74d49919f7d1609c533e2/FLAG6cfc474e2 [2022-02-20 23:59:31,321 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25add3d22/392e67931ab74d49919f7d1609c533e2 [2022-02-20 23:59:31,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:59:31,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:59:31,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:59:31,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:59:31,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:59:31,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:59:31" (1/1) ... [2022-02-20 23:59:31,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50fc1cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:31, skipping insertion in model container [2022-02-20 23:59:31,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:59:31" (1/1) ... [2022-02-20 23:59:31,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:59:31,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:59:31,672 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/sll2n_append_unequal.i[24323,24336] [2022-02-20 23:59:31,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:59:31,687 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:59:31,734 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/sll2n_append_unequal.i[24323,24336] [2022-02-20 23:59:31,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:59:31,753 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:59:31,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:31 WrapperNode [2022-02-20 23:59:31,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:59:31,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:59:31,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:59:31,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:59:31,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:31" (1/1) ... [2022-02-20 23:59:31,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:31" (1/1) ... [2022-02-20 23:59:31,806 INFO L137 Inliner]: procedures = 127, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2022-02-20 23:59:31,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:59:31,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:59:31,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:59:31,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:59:31,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:31" (1/1) ... [2022-02-20 23:59:31,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:31" (1/1) ... [2022-02-20 23:59:31,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:31" (1/1) ... [2022-02-20 23:59:31,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:31" (1/1) ... [2022-02-20 23:59:31,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:31" (1/1) ... [2022-02-20 23:59:31,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:31" (1/1) ... [2022-02-20 23:59:31,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:31" (1/1) ... [2022-02-20 23:59:31,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:59:31,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:59:31,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:59:31,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:59:31,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:31" (1/1) ... [2022-02-20 23:59:31,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:59:31,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:31,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:59:31,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:59:31,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:59:31,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:59:31,921 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 23:59:31,922 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 23:59:31,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:59:31,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:59:31,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:59:31,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:59:31,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:59:31,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:59:31,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:59:31,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:59:31,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:59:31,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:59:32,026 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:59:32,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:59:32,445 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:59:32,451 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:59:32,451 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:59:32,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:59:32 BoogieIcfgContainer [2022-02-20 23:59:32,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:59:32,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:59:32,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:59:32,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:59:32,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:59:31" (1/3) ... [2022-02-20 23:59:32,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc6de8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:59:32, skipping insertion in model container [2022-02-20 23:59:32,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:31" (2/3) ... [2022-02-20 23:59:32,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc6de8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:59:32, skipping insertion in model container [2022-02-20 23:59:32,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:59:32" (3/3) ... [2022-02-20 23:59:32,466 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2022-02-20 23:59:32,474 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:59:32,474 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-02-20 23:59:32,510 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:59:32,522 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:59:32,522 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-02-20 23:59:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:32,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:59:32,570 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:32,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:32,571 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:32,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:32,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520441, now seen corresponding path program 1 times [2022-02-20 23:59:32,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:32,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656268207] [2022-02-20 23:59:32,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:32,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:32,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {99#true} is VALID [2022-02-20 23:59:32,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~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_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {99#true} is VALID [2022-02-20 23:59:32,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume !!(sll_create_~len#1 > 0); {99#true} is VALID [2022-02-20 23:59:32,778 INFO L272 TraceCheckUtils]: 3: Hoare triple {99#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {99#true} is VALID [2022-02-20 23:59:32,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {99#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; {101#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:32,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {101#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {101#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:32,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {101#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(1 == #valid[~temp~0#1.base]); {100#false} is VALID [2022-02-20 23:59:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:32,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:32,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656268207] [2022-02-20 23:59:32,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656268207] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:32,783 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:32,784 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:59:32,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599594527] [2022-02-20 23:59:32,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:32,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:59:32,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:32,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:32,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:32,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:59:32,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:32,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:59:32,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:32,827 INFO L87 Difference]: Start difference. First operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:33,016 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-02-20 23:59:33,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:59:33,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:59:33,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 23:59:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 23:59:33,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-20 23:59:33,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:33,133 INFO L225 Difference]: With dead ends: 94 [2022-02-20 23:59:33,133 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 23:59:33,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:33,136 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:33,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 23:59:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-20 23:59:33,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:33,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:33,159 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:33,159 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:33,164 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-02-20 23:59:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-02-20 23:59:33,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:33,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:33,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 91 states. [2022-02-20 23:59:33,165 INFO L87 Difference]: Start difference. First operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 91 states. [2022-02-20 23:59:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:33,169 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-02-20 23:59:33,169 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-02-20 23:59:33,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:33,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:33,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:33,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-02-20 23:59:33,174 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 7 [2022-02-20 23:59:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:33,174 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-02-20 23:59:33,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-02-20 23:59:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:59:33,175 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:33,175 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:33,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:59:33,175 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:33,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520442, now seen corresponding path program 1 times [2022-02-20 23:59:33,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:33,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405298555] [2022-02-20 23:59:33,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:33,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:33,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {471#true} is VALID [2022-02-20 23:59:33,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~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_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {471#true} is VALID [2022-02-20 23:59:33,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume !!(sll_create_~len#1 > 0); {471#true} is VALID [2022-02-20 23:59:33,240 INFO L272 TraceCheckUtils]: 3: Hoare triple {471#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {471#true} is VALID [2022-02-20 23:59:33,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {471#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; {473#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:59:33,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {473#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {473#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:59:33,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {473#(and (= |node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |node_create_~temp~0#1.base|) (- 8)) 0))} assume !(4 + (4 + ~temp~0#1.offset) <= #length[~temp~0#1.base] && 0 <= 4 + ~temp~0#1.offset); {472#false} is VALID [2022-02-20 23:59:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:33,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:33,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405298555] [2022-02-20 23:59:33,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405298555] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:33,244 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:33,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:59:33,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836724853] [2022-02-20 23:59:33,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:33,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:59:33,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:33,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:33,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:33,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:59:33,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:33,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:59:33,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:33,252 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:33,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:33,379 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-02-20 23:59:33,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:59:33,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:59:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-20 23:59:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-20 23:59:33,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2022-02-20 23:59:33,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:33,446 INFO L225 Difference]: With dead ends: 89 [2022-02-20 23:59:33,447 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 23:59:33,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:33,448 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:33,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 150 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 23:59:33,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 23:59:33,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:33,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:33,453 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:33,453 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:33,455 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-02-20 23:59:33,456 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-02-20 23:59:33,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:33,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:33,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 89 states. [2022-02-20 23:59:33,457 INFO L87 Difference]: Start difference. First operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 89 states. [2022-02-20 23:59:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:33,459 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-02-20 23:59:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-02-20 23:59:33,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:33,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:33,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:33,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-02-20 23:59:33,463 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 7 [2022-02-20 23:59:33,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:33,463 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-02-20 23:59:33,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-02-20 23:59:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:59:33,465 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:33,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:33,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:59:33,465 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:33,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:33,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468992, now seen corresponding path program 1 times [2022-02-20 23:59:33,466 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:33,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196601965] [2022-02-20 23:59:33,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:33,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:33,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:59:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:33,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {843#(and (= |old(#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; {832#true} is VALID [2022-02-20 23:59:33,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {832#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {832#true} is VALID [2022-02-20 23:59:33,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {832#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {844#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:33,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {844#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {844#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:33,607 INFO L290 TraceCheckUtils]: 4: Hoare triple {844#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {845#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:33,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {845#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {845#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:33,609 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {845#(= (select |#valid| |node_create_#res#1.base|) 1)} {832#true} #171#return; {841#(= (select |#valid| |ULTIMATE.start_sll_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:59:33,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {832#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {832#true} is VALID [2022-02-20 23:59:33,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {832#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~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_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {832#true} is VALID [2022-02-20 23:59:33,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {832#true} assume !!(sll_create_~len#1 > 0); {832#true} is VALID [2022-02-20 23:59:33,611 INFO L272 TraceCheckUtils]: 3: Hoare triple {832#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {843#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:33,611 INFO L290 TraceCheckUtils]: 4: Hoare triple {843#(and (= |old(#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; {832#true} is VALID [2022-02-20 23:59:33,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {832#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {832#true} is VALID [2022-02-20 23:59:33,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {832#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {844#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:33,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {844#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {844#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:59:33,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {844#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {845#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:33,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {845#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {845#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:33,614 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {845#(= (select |#valid| |node_create_#res#1.base|) 1)} {832#true} #171#return; {841#(= (select |#valid| |ULTIMATE.start_sll_create_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:59:33,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {841#(= (select |#valid| |ULTIMATE.start_sll_create_#t~ret5#1.base|) 1)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {842#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:59:33,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {842#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} assume !(1 == #valid[sll_create_~new_head~0#1.base]); {833#false} is VALID [2022-02-20 23:59:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:33,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:33,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196601965] [2022-02-20 23:59:33,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196601965] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:33,617 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:33,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:59:33,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067756388] [2022-02-20 23:59:33,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:33,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:59:33,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:33,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:33,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:33,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:59:33,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:33,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:59:33,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:59:33,630 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:34,113 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2022-02-20 23:59:34,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:59:34,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:59:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-02-20 23:59:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-02-20 23:59:34,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 105 transitions. [2022-02-20 23:59:34,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:34,195 INFO L225 Difference]: With dead ends: 93 [2022-02-20 23:59:34,195 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 23:59:34,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:59:34,196 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 11 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:34,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 345 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:59:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 23:59:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-02-20 23:59:34,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:34,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:34,200 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:34,201 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:34,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:34,203 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2022-02-20 23:59:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2022-02-20 23:59:34,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:34,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:34,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-02-20 23:59:34,204 INFO L87 Difference]: Start difference. First operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-02-20 23:59:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:34,206 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2022-02-20 23:59:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2022-02-20 23:59:34,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:34,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:34,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:34,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-02-20 23:59:34,223 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 13 [2022-02-20 23:59:34,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:34,223 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-02-20 23:59:34,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-02-20 23:59:34,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:59:34,224 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:34,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:34,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:59:34,224 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:34,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468991, now seen corresponding path program 1 times [2022-02-20 23:59:34,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:34,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764277699] [2022-02-20 23:59:34,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:34,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:59:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:34,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {1228#(and (= |old(#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; {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:34,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:34,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:34,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:34,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1230#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} is VALID [2022-02-20 23:59:34,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {1230#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} assume true; {1230#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} is VALID [2022-02-20 23:59:34,335 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1230#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} {1217#true} #171#return; {1226#(and (= |ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_sll_create_#t~ret5#1.base|)))} is VALID [2022-02-20 23:59:34,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {1217#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {1217#true} is VALID [2022-02-20 23:59:34,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {1217#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~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_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1217#true} is VALID [2022-02-20 23:59:34,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {1217#true} assume !!(sll_create_~len#1 > 0); {1217#true} is VALID [2022-02-20 23:59:34,337 INFO L272 TraceCheckUtils]: 3: Hoare triple {1217#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {1228#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:34,338 INFO L290 TraceCheckUtils]: 4: Hoare triple {1228#(and (= |old(#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; {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:34,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:34,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:34,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 23:59:34,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#(and (<= |node_create_~temp~0#1.offset| 0) (= (select |#length| |node_create_~temp~0#1.base|) 8) (<= 0 |node_create_~temp~0#1.offset|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1230#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} is VALID [2022-02-20 23:59:34,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {1230#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} assume true; {1230#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} is VALID [2022-02-20 23:59:34,343 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1230#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#length| |node_create_#res#1.base|) 8))} {1217#true} #171#return; {1226#(and (= |ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_sll_create_#t~ret5#1.base|)))} is VALID [2022-02-20 23:59:34,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {1226#(and (= |ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_sll_create_#t~ret5#1.base|)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {1227#(and (= (+ (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 23:59:34,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {1227#(and (= (+ (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} assume !(4 + (4 + sll_create_~new_head~0#1.offset) <= #length[sll_create_~new_head~0#1.base] && 0 <= 4 + sll_create_~new_head~0#1.offset); {1218#false} is VALID [2022-02-20 23:59:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:34,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:34,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764277699] [2022-02-20 23:59:34,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764277699] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:34,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:34,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:59:34,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398058507] [2022-02-20 23:59:34,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:34,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:59:34,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:34,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:34,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:34,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:59:34,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:34,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:59:34,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:59:34,357 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:34,856 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-02-20 23:59:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:59:34,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:59:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:34,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-02-20 23:59:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-02-20 23:59:34,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 104 transitions. [2022-02-20 23:59:34,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:34,930 INFO L225 Difference]: With dead ends: 92 [2022-02-20 23:59:34,931 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 23:59:34,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:59:34,932 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 9 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:34,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 361 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:59:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 23:59:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2022-02-20 23:59:34,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:34,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:34,936 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:34,936 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:34,940 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-02-20 23:59:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-02-20 23:59:34,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:34,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:34,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 92 states. [2022-02-20 23:59:34,941 INFO L87 Difference]: Start difference. First operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 92 states. [2022-02-20 23:59:34,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:34,944 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-02-20 23:59:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-02-20 23:59:34,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:34,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:34,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:34,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-02-20 23:59:34,948 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 13 [2022-02-20 23:59:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:34,949 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-02-20 23:59:34,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-02-20 23:59:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:59:34,949 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:34,949 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:34,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:59:34,950 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:34,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:34,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1633295936, now seen corresponding path program 1 times [2022-02-20 23:59:34,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:34,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030318607] [2022-02-20 23:59:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:34,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:34,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 23:59:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:34,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {1608#(and (= |old(#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; {1598#true} is VALID [2022-02-20 23:59:34,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {1598#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1598#true} is VALID [2022-02-20 23:59:34,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {1598#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {1598#true} is VALID [2022-02-20 23:59:34,986 INFO L290 TraceCheckUtils]: 3: Hoare triple {1598#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {1598#true} is VALID [2022-02-20 23:59:34,986 INFO L290 TraceCheckUtils]: 4: Hoare triple {1598#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1598#true} is VALID [2022-02-20 23:59:34,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {1598#true} assume true; {1598#true} is VALID [2022-02-20 23:59:34,987 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1598#true} {1599#false} #173#return; {1599#false} is VALID [2022-02-20 23:59:34,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {1598#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {1598#true} is VALID [2022-02-20 23:59:34,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {1598#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~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_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1600#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:34,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {1600#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !(sll_create_~len#1 > 0); {1599#false} is VALID [2022-02-20 23:59:34,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {1599#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1599#false} is VALID [2022-02-20 23:59:34,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {1599#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {1599#false} is VALID [2022-02-20 23:59:34,989 INFO L272 TraceCheckUtils]: 5: Hoare triple {1599#false} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {1608#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:34,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {1608#(and (= |old(#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; {1598#true} is VALID [2022-02-20 23:59:34,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {1598#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1598#true} is VALID [2022-02-20 23:59:34,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {1598#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {1598#true} is VALID [2022-02-20 23:59:34,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {1598#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {1598#true} is VALID [2022-02-20 23:59:34,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {1598#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1598#true} is VALID [2022-02-20 23:59:34,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {1598#true} assume true; {1598#true} is VALID [2022-02-20 23:59:34,990 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1598#true} {1599#false} #173#return; {1599#false} is VALID [2022-02-20 23:59:34,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {1599#false} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {1599#false} is VALID [2022-02-20 23:59:34,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {1599#false} assume !(1 == #valid[sll_append_~head#1.base]); {1599#false} is VALID [2022-02-20 23:59:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:34,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:34,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030318607] [2022-02-20 23:59:34,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030318607] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:34,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:34,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:59:34,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617685084] [2022-02-20 23:59:34,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:34,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:59:34,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:34,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:35,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:35,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:59:35,003 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:35,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:59:35,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:59:35,004 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:35,153 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-02-20 23:59:35,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:59:35,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:59:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-02-20 23:59:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-02-20 23:59:35,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-02-20 23:59:35,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:35,218 INFO L225 Difference]: With dead ends: 93 [2022-02-20 23:59:35,218 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 23:59:35,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:59:35,219 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:35,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 222 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 23:59:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-02-20 23:59:35,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:35,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:35,223 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:35,223 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:35,225 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-02-20 23:59:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2022-02-20 23:59:35,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:35,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:35,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-02-20 23:59:35,226 INFO L87 Difference]: Start difference. First operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-02-20 23:59:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:35,228 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-02-20 23:59:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2022-02-20 23:59:35,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:35,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:35,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:35,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-02-20 23:59:35,230 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 15 [2022-02-20 23:59:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:35,231 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-02-20 23:59:35,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-02-20 23:59:35,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:59:35,232 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:35,232 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:35,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:59:35,232 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:35,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1411001534, now seen corresponding path program 1 times [2022-02-20 23:59:35,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:35,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086831022] [2022-02-20 23:59:35,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:35,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:35,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:59:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:35,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {1996#(and (= |old(#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; {1978#true} is VALID [2022-02-20 23:59:35,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1978#true} is VALID [2022-02-20 23:59:35,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {1978#true} is VALID [2022-02-20 23:59:35,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {1978#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {1978#true} is VALID [2022-02-20 23:59:35,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {1978#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1978#true} is VALID [2022-02-20 23:59:35,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-02-20 23:59:35,294 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1978#true} {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} #171#return; {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:35,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 23:59:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:35,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {1996#(and (= |old(#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; {1978#true} is VALID [2022-02-20 23:59:35,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1978#true} is VALID [2022-02-20 23:59:35,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {1978#true} is VALID [2022-02-20 23:59:35,309 INFO L290 TraceCheckUtils]: 3: Hoare triple {1978#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {1978#true} is VALID [2022-02-20 23:59:35,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {1978#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1978#true} is VALID [2022-02-20 23:59:35,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-02-20 23:59:35,310 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1978#true} {1979#false} #173#return; {1979#false} is VALID [2022-02-20 23:59:35,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {1978#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {1978#true} is VALID [2022-02-20 23:59:35,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~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_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:35,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !!(sll_create_~len#1 > 0); {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:35,317 INFO L272 TraceCheckUtils]: 3: Hoare triple {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {1996#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:35,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {1996#(and (= |old(#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; {1978#true} is VALID [2022-02-20 23:59:35,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1978#true} is VALID [2022-02-20 23:59:35,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {1978#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {1978#true} is VALID [2022-02-20 23:59:35,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {1978#true} is VALID [2022-02-20 23:59:35,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1978#true} is VALID [2022-02-20 23:59:35,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-02-20 23:59:35,319 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1978#true} {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} #171#return; {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:35,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:35,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:35,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:35,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {1980#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {1988#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {1988#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {1979#false} is VALID [2022-02-20 23:59:35,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {1979#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1979#false} is VALID [2022-02-20 23:59:35,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {1979#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {1979#false} is VALID [2022-02-20 23:59:35,324 INFO L272 TraceCheckUtils]: 18: Hoare triple {1979#false} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {1996#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:35,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {1996#(and (= |old(#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; {1978#true} is VALID [2022-02-20 23:59:35,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {1978#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1978#true} is VALID [2022-02-20 23:59:35,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {1978#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {1978#true} is VALID [2022-02-20 23:59:35,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {1978#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {1978#true} is VALID [2022-02-20 23:59:35,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {1978#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1978#true} is VALID [2022-02-20 23:59:35,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-02-20 23:59:35,327 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1978#true} {1979#false} #173#return; {1979#false} is VALID [2022-02-20 23:59:35,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {1979#false} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {1979#false} is VALID [2022-02-20 23:59:35,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {1979#false} assume !(1 == #valid[sll_append_~head#1.base]); {1979#false} is VALID [2022-02-20 23:59:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:59:35,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:35,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086831022] [2022-02-20 23:59:35,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086831022] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:35,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286624287] [2022-02-20 23:59:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:35,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:35,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:35,348 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:35,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:59:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:35,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:59:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:35,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:35,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {1978#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {1978#true} is VALID [2022-02-20 23:59:35,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~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_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0); {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,600 INFO L272 TraceCheckUtils]: 3: Hoare triple {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {1978#true} is VALID [2022-02-20 23:59:35,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {1978#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; {1978#true} is VALID [2022-02-20 23:59:35,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1978#true} is VALID [2022-02-20 23:59:35,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {1978#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {1978#true} is VALID [2022-02-20 23:59:35,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {1978#true} is VALID [2022-02-20 23:59:35,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1978#true} is VALID [2022-02-20 23:59:35,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-02-20 23:59:35,601 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1978#true} {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} #171#return; {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {1988#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {1988#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {1979#false} is VALID [2022-02-20 23:59:35,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {1979#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1979#false} is VALID [2022-02-20 23:59:35,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {1979#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {1979#false} is VALID [2022-02-20 23:59:35,604 INFO L272 TraceCheckUtils]: 18: Hoare triple {1979#false} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {1979#false} is VALID [2022-02-20 23:59:35,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {1979#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1979#false} is VALID [2022-02-20 23:59:35,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {1979#false} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1979#false} is VALID [2022-02-20 23:59:35,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {1979#false} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {1979#false} is VALID [2022-02-20 23:59:35,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {1979#false} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {1979#false} is VALID [2022-02-20 23:59:35,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {1979#false} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1979#false} is VALID [2022-02-20 23:59:35,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {1979#false} assume true; {1979#false} is VALID [2022-02-20 23:59:35,605 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1979#false} {1979#false} #173#return; {1979#false} is VALID [2022-02-20 23:59:35,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {1979#false} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {1979#false} is VALID [2022-02-20 23:59:35,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {1979#false} assume !(1 == #valid[sll_append_~head#1.base]); {1979#false} is VALID [2022-02-20 23:59:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:35,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:35,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {1979#false} assume !(1 == #valid[sll_append_~head#1.base]); {1979#false} is VALID [2022-02-20 23:59:35,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {1979#false} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {1979#false} is VALID [2022-02-20 23:59:35,729 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1978#true} {1979#false} #173#return; {1979#false} is VALID [2022-02-20 23:59:35,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-02-20 23:59:35,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {1978#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1978#true} is VALID [2022-02-20 23:59:35,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {1978#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {1978#true} is VALID [2022-02-20 23:59:35,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {1978#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {1978#true} is VALID [2022-02-20 23:59:35,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {1978#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1978#true} is VALID [2022-02-20 23:59:35,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {1978#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; {1978#true} is VALID [2022-02-20 23:59:35,730 INFO L272 TraceCheckUtils]: 18: Hoare triple {1979#false} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {1978#true} is VALID [2022-02-20 23:59:35,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {1979#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {1979#false} is VALID [2022-02-20 23:59:35,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {1979#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1979#false} is VALID [2022-02-20 23:59:35,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {1988#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {1979#false} is VALID [2022-02-20 23:59:35,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {1988#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1978#true} {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} #171#return; {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-02-20 23:59:35,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1978#true} is VALID [2022-02-20 23:59:35,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {1978#true} is VALID [2022-02-20 23:59:35,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {1978#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {1978#true} is VALID [2022-02-20 23:59:35,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1978#true} is VALID [2022-02-20 23:59:35,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {1978#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; {1978#true} is VALID [2022-02-20 23:59:35,734 INFO L272 TraceCheckUtils]: 3: Hoare triple {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {1978#true} is VALID [2022-02-20 23:59:35,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0); {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~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_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2003#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:35,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {1978#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {1978#true} is VALID [2022-02-20 23:59:35,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:59:35,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286624287] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:35,736 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:59:35,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-02-20 23:59:35,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505123097] [2022-02-20 23:59:35,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:35,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-20 23:59:35,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:35,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:35,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:35,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:59:35,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:35,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:59:35,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:59:35,763 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:35,969 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-02-20 23:59:35,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:59:35,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-20 23:59:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:35,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-02-20 23:59:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-02-20 23:59:35,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 104 transitions. [2022-02-20 23:59:36,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:36,054 INFO L225 Difference]: With dead ends: 94 [2022-02-20 23:59:36,054 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 23:59:36,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:59:36,055 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 8 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:36,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 310 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:36,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 23:59:36,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-02-20 23:59:36,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:36,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:36,058 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:36,058 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:36,060 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-02-20 23:59:36,060 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-02-20 23:59:36,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:36,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:36,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 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 94 states. [2022-02-20 23:59:36,063 INFO L87 Difference]: Start difference. First operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 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 94 states. [2022-02-20 23:59:36,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:36,065 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-02-20 23:59:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-02-20 23:59:36,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:36,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:36,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:36,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-02-20 23:59:36,069 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 28 [2022-02-20 23:59:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:36,070 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-02-20 23:59:36,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-02-20 23:59:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:59:36,071 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:36,071 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:36,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:36,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 23:59:36,275 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:36,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:36,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092864, now seen corresponding path program 2 times [2022-02-20 23:59:36,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:36,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95722165] [2022-02-20 23:59:36,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:36,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:36,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:59:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:36,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {2564#(and (= |old(#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; {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:36,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:36,467 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #171#return; {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:36,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 23:59:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:36,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {2564#(and (= |old(#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; {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,495 INFO L290 TraceCheckUtils]: 4: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:36,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:36,497 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #171#return; {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:36,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-20 23:59:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:36,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {2564#(and (= |old(#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; {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:36,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:36,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:36,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:36,559 INFO L290 TraceCheckUtils]: 4: Hoare triple {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2568#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:36,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {2568#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {2568#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:36,561 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2568#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} #173#return; {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} is VALID [2022-02-20 23:59:36,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {2538#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {2538#true} is VALID [2022-02-20 23:59:36,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {2538#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~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_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:36,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !!(sll_create_~len#1 > 0); {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:36,563 INFO L272 TraceCheckUtils]: 3: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2564#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:36,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {2564#(and (= |old(#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; {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:36,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:36,570 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #171#return; {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:36,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:36,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:36,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:36,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:36,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !!(sll_create_~len#1 > 0); {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:36,574 INFO L272 TraceCheckUtils]: 16: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2564#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:36,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {2564#(and (= |old(#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; {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:59:36,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {2565#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:36,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:36,578 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #171#return; {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:36,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:36,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:36,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:36,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:36,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(sll_create_~len#1 > 0); {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:36,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:36,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} is VALID [2022-02-20 23:59:36,582 INFO L272 TraceCheckUtils]: 31: Hoare triple {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {2564#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:36,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {2564#(and (= |old(#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; {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:36,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:36,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:36,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:36,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {2567#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2568#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:36,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {2568#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {2568#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:36,586 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2568#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} #173#return; {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} is VALID [2022-02-20 23:59:36,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} is VALID [2022-02-20 23:59:36,587 INFO L290 TraceCheckUtils]: 40: Hoare triple {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} assume !(1 == #valid[sll_append_~head#1.base]); {2539#false} is VALID [2022-02-20 23:59:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 23:59:36,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:36,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95722165] [2022-02-20 23:59:36,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95722165] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:36,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643329350] [2022-02-20 23:59:36,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:59:36,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:36,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:36,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:36,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:59:36,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:59:36,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:59:36,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 23:59:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:36,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:36,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:36,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:59:36,892 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:59:36,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:59:36,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:59:37,274 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:59:37,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:59:37,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {2538#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {2538#true} is VALID [2022-02-20 23:59:37,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {2538#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~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_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:37,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !!(sll_create_~len#1 > 0); {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:37,305 INFO L272 TraceCheckUtils]: 3: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2581#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:59:37,311 INFO L290 TraceCheckUtils]: 4: Hoare triple {2581#(= |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; {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:59:37,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:59:37,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:59:37,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:59:37,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:59:37,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} assume true; {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:59:37,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #171#return; {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:37,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:37,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:37,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:37,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:37,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !!(sll_create_~len#1 > 0); {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:37,320 INFO L272 TraceCheckUtils]: 16: Hoare triple {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2581#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:59:37,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {2581#(= |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; {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:37,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:37,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:37,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:37,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:37,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:59:37,327 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2566#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {2540#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #171#return; {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:37,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:37,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:37,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:37,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:37,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(sll_create_~len#1 > 0); {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:37,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:37,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {2555#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} is VALID [2022-02-20 23:59:37,330 INFO L272 TraceCheckUtils]: 31: Hoare triple {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {2581#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:59:37,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {2581#(= |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; {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:59:37,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:59:37,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:59:37,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:59:37,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:59:37,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} assume true; {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} is VALID [2022-02-20 23:59:37,335 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2585#(exists ((|node_create_~temp~0#1.base| Int)) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|))} {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} #173#return; {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} is VALID [2022-02-20 23:59:37,335 INFO L290 TraceCheckUtils]: 39: Hoare triple {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} is VALID [2022-02-20 23:59:37,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {2556#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)} assume !(1 == #valid[sll_append_~head#1.base]); {2539#false} is VALID [2022-02-20 23:59:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 23:59:37,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:37,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643329350] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:37,685 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:59:37,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2022-02-20 23:59:37,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473988943] [2022-02-20 23:59:37,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:37,686 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-02-20 23:59:37,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:37,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 23:59:37,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:37,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:59:37,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:37,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:59:37,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:59:37,723 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 23:59:38,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:38,291 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:59:38,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:59:38,291 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-02-20 23:59:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 23:59:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-02-20 23:59:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 23:59:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-02-20 23:59:38,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-02-20 23:59:38,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:38,369 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:59:38,369 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:59:38,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:59:38,370 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 114 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:38,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 328 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 250 Invalid, 0 Unknown, 49 Unchecked, 0.2s Time] [2022-02-20 23:59:38,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:59:38,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2022-02-20 23:59:38,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:38,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 90 states, 57 states have (on average 1.631578947368421) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:38,373 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 90 states, 57 states have (on average 1.631578947368421) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:38,373 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 90 states, 57 states have (on average 1.631578947368421) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:38,374 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:59:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:59:38,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:38,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:38,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 57 states have (on average 1.631578947368421) internal successors, (93), 85 states have internal predecessors, (93), 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 102 states. [2022-02-20 23:59:38,375 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.631578947368421) internal successors, (93), 85 states have internal predecessors, (93), 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 102 states. [2022-02-20 23:59:38,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:38,377 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:59:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:59:38,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:38,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:38,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:38,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.631578947368421) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:38,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-02-20 23:59:38,379 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 41 [2022-02-20 23:59:38,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:38,379 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-02-20 23:59:38,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 23:59:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-02-20 23:59:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:59:38,380 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:38,380 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:38,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:38,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-02-20 23:59:38,596 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092863, now seen corresponding path program 1 times [2022-02-20 23:59:38,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:38,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495812237] [2022-02-20 23:59:38,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:38,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:38,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:59:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:38,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {3181#(and (= |old(#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; {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:59:38,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} assume true; {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:59:38,750 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} {3156#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} #171#return; {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 23:59:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:38,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {3181#(and (= |old(#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; {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,774 INFO L290 TraceCheckUtils]: 3: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,774 INFO L290 TraceCheckUtils]: 4: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:59:38,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} assume true; {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:59:38,776 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} #171#return; {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-20 23:59:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:38,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {3181#(and (= |old(#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; {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:59:38,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} assume true; {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:59:38,830 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} {3172#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_append_~head#1.base|) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= 4 (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)))} #173#return; {3180#(and (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= 4 (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)))} is VALID [2022-02-20 23:59:38,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {3154#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {3154#true} is VALID [2022-02-20 23:59:38,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {3154#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~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_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {3156#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {3156#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} assume !!(sll_create_~len#1 > 0); {3156#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,833 INFO L272 TraceCheckUtils]: 3: Hoare triple {3156#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {3181#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:38,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {3181#(and (= |old(#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; {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:59:38,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} assume true; {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:59:38,838 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} {3156#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} #171#return; {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} assume !!(sll_create_~len#1 > 0); {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,841 INFO L272 TraceCheckUtils]: 16: Hoare triple {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {3181#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:38,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {3181#(and (= |old(#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; {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:59:38,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} assume true; {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:59:38,845 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} #171#return; {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} assume !(sll_create_~len#1 > 0); {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} is VALID [2022-02-20 23:59:38,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {3164#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {3172#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_append_~head#1.base|) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= 4 (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)))} is VALID [2022-02-20 23:59:38,848 INFO L272 TraceCheckUtils]: 31: Hoare triple {3172#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_append_~head#1.base|) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= 4 (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)))} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {3181#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:59:38,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {3181#(and (= |old(#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; {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L576-1 {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,855 INFO L290 TraceCheckUtils]: 35: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L579 {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} is VALID [2022-02-20 23:59:38,856 INFO L290 TraceCheckUtils]: 36: Hoare triple {3182#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:59:38,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} assume true; {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:59:38,858 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3183#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (+ (@diff |old(#length)| |#length|) 1) |#StackHeapBarrier|)))} {3172#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_append_~head#1.base|) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= 4 (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)))} #173#return; {3180#(and (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= 4 (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)))} is VALID [2022-02-20 23:59:38,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#(and (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= 4 (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)))} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {3180#(and (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= 4 (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)))} is VALID [2022-02-20 23:59:38,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#(and (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= 4 (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)))} assume !(4 + sll_append_~head#1.offset <= #length[sll_append_~head#1.base] && 0 <= sll_append_~head#1.offset); {3155#false} is VALID [2022-02-20 23:59:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-20 23:59:38,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:38,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495812237] [2022-02-20 23:59:38,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495812237] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:38,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749600663] [2022-02-20 23:59:38,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:38,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:38,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:38,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:38,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:59:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:38,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 23:59:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:38,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:39,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:39,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:59:39,247 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 23:59:39,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:39,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:39,448 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 128023 column 46: unknown constant v_#length_BEFORE_CALL_2 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 23:59:39,452 INFO L158 Benchmark]: Toolchain (without parser) took 8127.72ms. Allocated memory was 107.0MB in the beginning and 165.7MB in the end (delta: 58.7MB). Free memory was 74.7MB in the beginning and 100.0MB in the end (delta: -25.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2022-02-20 23:59:39,452 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory was 62.9MB in the beginning and 62.8MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:59:39,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.31ms. Allocated memory is still 107.0MB. Free memory was 74.7MB in the beginning and 72.4MB in the end (delta: 2.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-20 23:59:39,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.84ms. Allocated memory is still 107.0MB. Free memory was 72.4MB in the beginning and 69.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:59:39,453 INFO L158 Benchmark]: Boogie Preprocessor took 41.81ms. Allocated memory is still 107.0MB. Free memory was 69.9MB in the beginning and 67.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:59:39,453 INFO L158 Benchmark]: RCFGBuilder took 603.16ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 67.4MB in the beginning and 99.3MB in the end (delta: -31.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-20 23:59:39,453 INFO L158 Benchmark]: TraceAbstraction took 6997.66ms. Allocated memory was 130.0MB in the beginning and 165.7MB in the end (delta: 35.7MB). Free memory was 98.7MB in the beginning and 101.1MB in the end (delta: -2.4MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2022-02-20 23:59:39,454 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory was 62.9MB in the beginning and 62.8MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.31ms. Allocated memory is still 107.0MB. Free memory was 74.7MB in the beginning and 72.4MB in the end (delta: 2.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.84ms. Allocated memory is still 107.0MB. Free memory was 72.4MB in the beginning and 69.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.81ms. Allocated memory is still 107.0MB. Free memory was 69.9MB in the beginning and 67.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 603.16ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 67.4MB in the beginning and 99.3MB in the end (delta: -31.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6997.66ms. Allocated memory was 130.0MB in the beginning and 165.7MB in the end (delta: 35.7MB). Free memory was 98.7MB in the beginning and 101.1MB in the end (delta: -2.4MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 128023 column 46: unknown constant v_#length_BEFORE_CALL_2 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 128023 column 46: unknown constant v_#length_BEFORE_CALL_2: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:59:39,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:59:41,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:59:41,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:59:41,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:59:41,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:59:41,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:59:41,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:59:41,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:59:41,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:59:41,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:59:41,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:59:41,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:59:41,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:59:41,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:59:41,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:59:41,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:59:41,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:59:41,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:59:41,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:59:41,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:59:41,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:59:41,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:59:41,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:59:41,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:59:41,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:59:41,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:59:41,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:59:41,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:59:41,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:59:41,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:59:41,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:59:41,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:59:41,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:59:41,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:59:41,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:59:41,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:59:41,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:59:41,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:59:41,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:59:41,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:59:41,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:59:41,233 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:59:41,263 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:59:41,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:59:41,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:59:41,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:59:41,264 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:59:41,264 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:59:41,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:59:41,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:59:41,265 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:59:41,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:59:41,265 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:59:41,265 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:59:41,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:59:41,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:59:41,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:59:41,266 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:59:41,266 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:59:41,266 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:59:41,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:59:41,266 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:59:41,266 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:59:41,266 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:59:41,266 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:59:41,266 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:59:41,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:59:41,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:59:41,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:59:41,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:59:41,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:59:41,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:59:41,275 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:59:41,275 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:59:41,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:59:41,275 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2022-02-20 23:59:41,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:59:41,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:59:41,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:59:41,521 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:59:41,521 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:59:41,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2022-02-20 23:59:41,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3c099367/c0aa07fccf014cd3af9d39e9f2cbd33e/FLAG31d41b25f [2022-02-20 23:59:42,033 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:59:42,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2022-02-20 23:59:42,043 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3c099367/c0aa07fccf014cd3af9d39e9f2cbd33e/FLAG31d41b25f [2022-02-20 23:59:42,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3c099367/c0aa07fccf014cd3af9d39e9f2cbd33e [2022-02-20 23:59:42,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:59:42,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:59:42,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:59:42,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:59:42,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:59:42,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:59:42" (1/1) ... [2022-02-20 23:59:42,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac64491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:42, skipping insertion in model container [2022-02-20 23:59:42,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:59:42" (1/1) ... [2022-02-20 23:59:42,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:59:42,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:59:42,417 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/sll2n_append_unequal.i[24323,24336] [2022-02-20 23:59:42,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:59:42,440 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:59:42,478 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/sll2n_append_unequal.i[24323,24336] [2022-02-20 23:59:42,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:59:42,519 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:59:42,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:42 WrapperNode [2022-02-20 23:59:42,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:59:42,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:59:42,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:59:42,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:59:42,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:42" (1/1) ... [2022-02-20 23:59:42,554 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:42" (1/1) ... [2022-02-20 23:59:42,585 INFO L137 Inliner]: procedures = 130, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2022-02-20 23:59:42,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:59:42,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:59:42,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:59:42,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:59:42,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:42" (1/1) ... [2022-02-20 23:59:42,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:42" (1/1) ... [2022-02-20 23:59:42,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:42" (1/1) ... [2022-02-20 23:59:42,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:42" (1/1) ... [2022-02-20 23:59:42,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:42" (1/1) ... [2022-02-20 23:59:42,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:42" (1/1) ... [2022-02-20 23:59:42,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:42" (1/1) ... [2022-02-20 23:59:42,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:59:42,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:59:42,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:59:42,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:59:42,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:42" (1/1) ... [2022-02-20 23:59:42,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:59:42,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:42,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:59:42,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:59:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:59:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 23:59:42,693 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 23:59:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:59:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:59:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:59:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:59:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:59:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:59:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:59:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:59:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:59:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:59:42,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:59:42,837 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:59:42,852 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:59:43,271 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:59:43,276 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:59:43,276 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:59:43,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:59:43 BoogieIcfgContainer [2022-02-20 23:59:43,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:59:43,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:59:43,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:59:43,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:59:43,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:59:42" (1/3) ... [2022-02-20 23:59:43,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebe1fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:59:43, skipping insertion in model container [2022-02-20 23:59:43,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:42" (2/3) ... [2022-02-20 23:59:43,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebe1fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:59:43, skipping insertion in model container [2022-02-20 23:59:43,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:59:43" (3/3) ... [2022-02-20 23:59:43,282 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2022-02-20 23:59:43,292 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:59:43,292 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-02-20 23:59:43,327 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:59:43,332 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:59:43,332 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-02-20 23:59:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:59:43,352 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:43,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:43,353 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:43,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:43,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520441, now seen corresponding path program 1 times [2022-02-20 23:59:43,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:43,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35032112] [2022-02-20 23:59:43,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:43,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:43,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:43,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:59:43,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:59:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:43,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:59:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:43,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:43,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:43,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {99#true} is VALID [2022-02-20 23:59:43,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {99#true} is VALID [2022-02-20 23:59:43,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {99#true} is VALID [2022-02-20 23:59:43,567 INFO L272 TraceCheckUtils]: 3: Hoare triple {99#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {99#true} is VALID [2022-02-20 23:59:43,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {99#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {116#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:43,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {116#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {116#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:43,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {116#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[~temp~0#1.base]); {100#false} is VALID [2022-02-20 23:59:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:43,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:43,570 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:43,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35032112] [2022-02-20 23:59:43,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35032112] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:43,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:43,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:59:43,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60577852] [2022-02-20 23:59:43,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:43,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:59:43,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:43,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:43,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:43,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:59:43,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:43,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:59:43,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:43,609 INFO L87 Difference]: Start difference. First operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:43,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:43,931 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-02-20 23:59:43,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:59:43,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:59:43,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 23:59:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 23:59:43,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-20 23:59:44,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:44,072 INFO L225 Difference]: With dead ends: 94 [2022-02-20 23:59:44,072 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 23:59:44,073 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 23:59:44,075 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:44,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:59:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 23:59:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-20 23:59:44,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:44,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:44,102 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:44,102 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:44,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:44,107 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-02-20 23:59:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-02-20 23:59:44,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:44,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:44,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 91 states. [2022-02-20 23:59:44,109 INFO L87 Difference]: Start difference. First operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 91 states. [2022-02-20 23:59:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:44,113 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-02-20 23:59:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-02-20 23:59:44,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:44,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:44,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:44,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-02-20 23:59:44,117 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 7 [2022-02-20 23:59:44,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:44,118 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-02-20 23:59:44,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-02-20 23:59:44,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:59:44,118 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:44,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:44,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:59:44,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:59:44,326 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:44,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:44,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520442, now seen corresponding path program 1 times [2022-02-20 23:59:44,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:44,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657272409] [2022-02-20 23:59:44,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:44,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:44,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:44,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:59:44,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:59:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:44,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:59:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:44,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:44,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 23:59:44,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {489#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {489#true} is VALID [2022-02-20 23:59:44,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {489#true} is VALID [2022-02-20 23:59:44,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#true} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {489#true} is VALID [2022-02-20 23:59:44,437 INFO L272 TraceCheckUtils]: 3: Hoare triple {489#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {489#true} is VALID [2022-02-20 23:59:44,438 INFO L290 TraceCheckUtils]: 4: Hoare triple {489#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {506#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:44,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {506#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:44,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ~temp~0#1.offset)), #length[~temp~0#1.base]) && ~bvule32(~bvadd32(4bv32, ~temp~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ~temp~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ~temp~0#1.offset))); {490#false} is VALID [2022-02-20 23:59:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:44,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:44,440 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:44,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657272409] [2022-02-20 23:59:44,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657272409] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:44,442 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:44,442 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:59:44,443 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424709750] [2022-02-20 23:59:44,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:44,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:59:44,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:44,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:44,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:44,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:59:44,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:44,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:59:44,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:44,452 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:44,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:44,770 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-02-20 23:59:44,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:59:44,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:59:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-20 23:59:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-20 23:59:44,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2022-02-20 23:59:44,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:44,871 INFO L225 Difference]: With dead ends: 89 [2022-02-20 23:59:44,871 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 23:59:44,871 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 23:59:44,872 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:44,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 150 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:59:44,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 23:59:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 23:59:44,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:44,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:44,876 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:44,877 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:44,879 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-02-20 23:59:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-02-20 23:59:44,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:44,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:44,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 89 states. [2022-02-20 23:59:44,880 INFO L87 Difference]: Start difference. First operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 89 states. [2022-02-20 23:59:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:44,882 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-02-20 23:59:44,882 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-02-20 23:59:44,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:44,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:44,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:44,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:44,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-02-20 23:59:44,885 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 7 [2022-02-20 23:59:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:44,885 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-02-20 23:59:44,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:59:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-02-20 23:59:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:59:44,886 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:44,886 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:44,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:45,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:59:45,099 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:45,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:45,099 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468992, now seen corresponding path program 1 times [2022-02-20 23:59:45,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:45,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704023450] [2022-02-20 23:59:45,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:45,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:45,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:45,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:59:45,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:59:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:45,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:59:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:45,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:45,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:45,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {868#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {868#true} is VALID [2022-02-20 23:59:45,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {868#true} is VALID [2022-02-20 23:59:45,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {868#true} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {868#true} is VALID [2022-02-20 23:59:45,254 INFO L272 TraceCheckUtils]: 3: Hoare triple {868#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {868#true} is VALID [2022-02-20 23:59:45,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {868#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {885#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:45,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {885#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {885#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:45,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {885#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {885#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:45,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {885#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {885#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:45,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {885#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {898#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:45,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {898#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} assume true; {898#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:45,258 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {898#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} {868#true} #171#return; {905#(= (select |#valid| |ULTIMATE.start_sll_create_#t~ret5#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:45,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {905#(= (select |#valid| |ULTIMATE.start_sll_create_#t~ret5#1.base|) (_ bv1 1))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {909#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:45,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {909#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[sll_create_~new_head~0#1.base]); {869#false} is VALID [2022-02-20 23:59:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:45,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:45,276 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:45,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704023450] [2022-02-20 23:59:45,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704023450] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:45,277 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:45,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:59:45,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138371987] [2022-02-20 23:59:45,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:45,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:59:45,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:45,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:45,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:45,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:59:45,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:45,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:59:45,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:59:45,293 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:46,142 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2022-02-20 23:59:46,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:59:46,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:59:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-02-20 23:59:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-02-20 23:59:46,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 105 transitions. [2022-02-20 23:59:46,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:46,236 INFO L225 Difference]: With dead ends: 93 [2022-02-20 23:59:46,236 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 23:59:46,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:59:46,237 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 10 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:46,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 309 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:59:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 23:59:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-02-20 23:59:46,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:46,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:46,251 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:46,252 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:46,254 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2022-02-20 23:59:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2022-02-20 23:59:46,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:46,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:46,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-02-20 23:59:46,255 INFO L87 Difference]: Start difference. First operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-02-20 23:59:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:46,258 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2022-02-20 23:59:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2022-02-20 23:59:46,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:46,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:46,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:46,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:46,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-02-20 23:59:46,260 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 13 [2022-02-20 23:59:46,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:46,261 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-02-20 23:59:46,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-02-20 23:59:46,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:59:46,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:46,261 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:46,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:46,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:59:46,467 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:46,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468991, now seen corresponding path program 1 times [2022-02-20 23:59:46,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:46,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770721986] [2022-02-20 23:59:46,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:46,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:46,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:46,469 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:59:46,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:59:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:46,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:59:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:46,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:46,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:46,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {1281#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {1281#true} is VALID [2022-02-20 23:59:46,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {1281#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {1281#true} is VALID [2022-02-20 23:59:46,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {1281#true} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {1281#true} is VALID [2022-02-20 23:59:46,673 INFO L272 TraceCheckUtils]: 3: Hoare triple {1281#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {1281#true} is VALID [2022-02-20 23:59:46,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {1281#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1298#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:46,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {1298#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1298#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:46,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {1298#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {1298#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:46,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {1298#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {1298#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:59:46,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {1298#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1311#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)))} is VALID [2022-02-20 23:59:46,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {1311#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)))} assume true; {1311#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)))} is VALID [2022-02-20 23:59:46,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1311#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)))} {1281#true} #171#return; {1318#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= |ULTIMATE.start_sll_create_#t~ret5#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:59:46,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {1318#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= |ULTIMATE.start_sll_create_#t~ret5#1.offset| (_ bv0 32)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {1322#(and (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:59:46,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {1322#(and (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset)), #length[sll_create_~new_head~0#1.base]) && ~bvule32(~bvadd32(4bv32, sll_create_~new_head~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset))); {1282#false} is VALID [2022-02-20 23:59:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:46,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:46,680 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:46,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770721986] [2022-02-20 23:59:46,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770721986] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:46,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:46,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:59:46,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004564820] [2022-02-20 23:59:46,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:46,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:59:46,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:46,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:46,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:46,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:59:46,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:46,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:59:46,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:59:46,703 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:47,624 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-02-20 23:59:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:59:47,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:59:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-02-20 23:59:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-02-20 23:59:47,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 104 transitions. [2022-02-20 23:59:47,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:47,721 INFO L225 Difference]: With dead ends: 92 [2022-02-20 23:59:47,721 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 23:59:47,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:59:47,722 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 9 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:47,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 325 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:59:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 23:59:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2022-02-20 23:59:47,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:47,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:47,725 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:47,725 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:47,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:47,727 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-02-20 23:59:47,727 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-02-20 23:59:47,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:47,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:47,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 92 states. [2022-02-20 23:59:47,728 INFO L87 Difference]: Start difference. First operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 92 states. [2022-02-20 23:59:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:47,730 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-02-20 23:59:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-02-20 23:59:47,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:47,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:47,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:47,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-02-20 23:59:47,732 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 13 [2022-02-20 23:59:47,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:47,733 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-02-20 23:59:47,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-02-20 23:59:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:59:47,733 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:47,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:47,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:47,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:59:47,940 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:47,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:47,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1633295936, now seen corresponding path program 1 times [2022-02-20 23:59:47,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:47,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036038143] [2022-02-20 23:59:47,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:47,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:47,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:47,942 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:59:47,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:59:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:48,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:59:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:48,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:48,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {1690#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {1690#true} is VALID [2022-02-20 23:59:48,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {1690#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {1698#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 23:59:48,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {1698#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {1691#false} is VALID [2022-02-20 23:59:48,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {1691#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1691#false} is VALID [2022-02-20 23:59:48,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {1691#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {1691#false} is VALID [2022-02-20 23:59:48,053 INFO L272 TraceCheckUtils]: 5: Hoare triple {1691#false} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {1691#false} is VALID [2022-02-20 23:59:48,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {1691#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1691#false} is VALID [2022-02-20 23:59:48,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {1691#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1691#false} is VALID [2022-02-20 23:59:48,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {1691#false} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {1691#false} is VALID [2022-02-20 23:59:48,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {1691#false} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {1691#false} is VALID [2022-02-20 23:59:48,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {1691#false} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1691#false} is VALID [2022-02-20 23:59:48,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {1691#false} assume true; {1691#false} is VALID [2022-02-20 23:59:48,057 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1691#false} {1691#false} #173#return; {1691#false} is VALID [2022-02-20 23:59:48,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {1691#false} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {1691#false} is VALID [2022-02-20 23:59:48,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {1691#false} assume !(1bv1 == #valid[sll_append_~head#1.base]); {1691#false} is VALID [2022-02-20 23:59:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:48,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:48,058 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:48,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036038143] [2022-02-20 23:59:48,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036038143] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:48,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:48,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:59:48,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322745957] [2022-02-20 23:59:48,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:48,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:59:48,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:48,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:48,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:48,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:59:48,073 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:48,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:59:48,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:48,074 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:48,277 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-02-20 23:59:48,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:59:48,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:59:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-20 23:59:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-20 23:59:48,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2022-02-20 23:59:48,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:48,363 INFO L225 Difference]: With dead ends: 93 [2022-02-20 23:59:48,363 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 23:59:48,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:48,364 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:48,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 185 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 23:59:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-02-20 23:59:48,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:48,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:48,366 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:48,367 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:48,368 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-02-20 23:59:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2022-02-20 23:59:48,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:48,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:48,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-02-20 23:59:48,369 INFO L87 Difference]: Start difference. First operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-02-20 23:59:48,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:48,371 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-02-20 23:59:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2022-02-20 23:59:48,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:48,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:48,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:48,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:59:48,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-02-20 23:59:48,374 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 15 [2022-02-20 23:59:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:48,374 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-02-20 23:59:48,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:59:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-02-20 23:59:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:59:48,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:48,375 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:48,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:48,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:59:48,582 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:48,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1411001534, now seen corresponding path program 1 times [2022-02-20 23:59:48,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:48,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463601325] [2022-02-20 23:59:48,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:48,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:48,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:48,584 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:59:48,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:59:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:48,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:59:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:48,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:48,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {2104#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {2104#true} is VALID [2022-02-20 23:59:48,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {2104#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {2112#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 23:59:48,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {2112#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2112#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 23:59:48,775 INFO L272 TraceCheckUtils]: 3: Hoare triple {2112#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2104#true} is VALID [2022-02-20 23:59:48,775 INFO L290 TraceCheckUtils]: 4: Hoare triple {2104#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2104#true} is VALID [2022-02-20 23:59:48,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {2104#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2104#true} is VALID [2022-02-20 23:59:48,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {2104#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {2104#true} is VALID [2022-02-20 23:59:48,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {2104#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {2104#true} is VALID [2022-02-20 23:59:48,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {2104#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2104#true} is VALID [2022-02-20 23:59:48,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {2104#true} assume true; {2104#true} is VALID [2022-02-20 23:59:48,776 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2104#true} {2112#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} #171#return; {2112#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 23:59:48,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {2112#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2112#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 23:59:48,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {2112#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {2112#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 23:59:48,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {2112#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2112#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 23:59:48,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {2112#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2152#(= (bvadd |ULTIMATE.start_sll_create_~len#1| (_ bv1 32)) (_ bv2 32))} is VALID [2022-02-20 23:59:48,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {2152#(= (bvadd |ULTIMATE.start_sll_create_~len#1| (_ bv1 32)) (_ bv2 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {2105#false} is VALID [2022-02-20 23:59:48,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {2105#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2105#false} is VALID [2022-02-20 23:59:48,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {2105#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {2105#false} is VALID [2022-02-20 23:59:48,778 INFO L272 TraceCheckUtils]: 18: Hoare triple {2105#false} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {2105#false} is VALID [2022-02-20 23:59:48,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {2105#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2105#false} is VALID [2022-02-20 23:59:48,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {2105#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2105#false} is VALID [2022-02-20 23:59:48,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {2105#false} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {2105#false} is VALID [2022-02-20 23:59:48,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {2105#false} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {2105#false} is VALID [2022-02-20 23:59:48,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {2105#false} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2105#false} is VALID [2022-02-20 23:59:48,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {2105#false} assume true; {2105#false} is VALID [2022-02-20 23:59:48,779 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2105#false} {2105#false} #173#return; {2105#false} is VALID [2022-02-20 23:59:48,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {2105#false} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {2105#false} is VALID [2022-02-20 23:59:48,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {2105#false} assume !(1bv1 == #valid[sll_append_~head#1.base]); {2105#false} is VALID [2022-02-20 23:59:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:48,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:48,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {2105#false} assume !(1bv1 == #valid[sll_append_~head#1.base]); {2105#false} is VALID [2022-02-20 23:59:48,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {2105#false} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {2105#false} is VALID [2022-02-20 23:59:48,892 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2104#true} {2105#false} #173#return; {2105#false} is VALID [2022-02-20 23:59:48,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {2104#true} assume true; {2104#true} is VALID [2022-02-20 23:59:48,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {2104#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2104#true} is VALID [2022-02-20 23:59:48,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {2104#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {2104#true} is VALID [2022-02-20 23:59:48,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {2104#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {2104#true} is VALID [2022-02-20 23:59:48,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2104#true} is VALID [2022-02-20 23:59:48,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2104#true} is VALID [2022-02-20 23:59:48,893 INFO L272 TraceCheckUtils]: 18: Hoare triple {2105#false} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {2104#true} is VALID [2022-02-20 23:59:48,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {2105#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {2105#false} is VALID [2022-02-20 23:59:48,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {2105#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2105#false} is VALID [2022-02-20 23:59:48,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {2228#(bvsgt |ULTIMATE.start_sll_create_~len#1| (_ bv0 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {2105#false} is VALID [2022-02-20 23:59:48,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {2232#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2228#(bvsgt |ULTIMATE.start_sll_create_~len#1| (_ bv0 32))} is VALID [2022-02-20 23:59:48,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {2232#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2232#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 23:59:48,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {2232#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {2232#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 23:59:48,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {2232#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2232#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 23:59:48,898 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2104#true} {2232#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} #171#return; {2232#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 23:59:48,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {2104#true} assume true; {2104#true} is VALID [2022-02-20 23:59:48,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {2104#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2104#true} is VALID [2022-02-20 23:59:48,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {2104#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {2104#true} is VALID [2022-02-20 23:59:48,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {2104#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {2104#true} is VALID [2022-02-20 23:59:48,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {2104#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2104#true} is VALID [2022-02-20 23:59:48,899 INFO L290 TraceCheckUtils]: 4: Hoare triple {2104#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2104#true} is VALID [2022-02-20 23:59:48,899 INFO L272 TraceCheckUtils]: 3: Hoare triple {2232#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2104#true} is VALID [2022-02-20 23:59:48,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {2232#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2232#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 23:59:48,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {2104#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {2232#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 23:59:48,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {2104#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {2104#true} is VALID [2022-02-20 23:59:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:59:48,902 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:48,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463601325] [2022-02-20 23:59:48,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463601325] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:48,902 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:59:48,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-02-20 23:59:48,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746848675] [2022-02-20 23:59:48,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:48,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-20 23:59:48,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:48,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:48,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:48,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:59:48,938 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:48,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:59:48,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:59:48,939 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:49,392 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2022-02-20 23:59:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:59:49,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-20 23:59:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-02-20 23:59:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-02-20 23:59:49,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2022-02-20 23:59:49,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:49,488 INFO L225 Difference]: With dead ends: 99 [2022-02-20 23:59:49,488 INFO L226 Difference]: Without dead ends: 99 [2022-02-20 23:59:49,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:59:49,489 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 15 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:49,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 372 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-20 23:59:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2022-02-20 23:59:49,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:49,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:49,492 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:49,493 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:49,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:49,495 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2022-02-20 23:59:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2022-02-20 23:59:49,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:49,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:49,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 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 99 states. [2022-02-20 23:59:49,496 INFO L87 Difference]: Start difference. First operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 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 99 states. [2022-02-20 23:59:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:49,498 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2022-02-20 23:59:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2022-02-20 23:59:49,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:49,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:49,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:49,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:59:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-02-20 23:59:49,501 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 28 [2022-02-20 23:59:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:49,501 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-02-20 23:59:49,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:59:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-02-20 23:59:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:59:49,502 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:49,502 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:49,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:49,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:59:49,709 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-20 23:59:49,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092864, now seen corresponding path program 2 times [2022-02-20 23:59:49,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:59:49,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557753263] [2022-02-20 23:59:49,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:59:49,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:59:49,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:59:49,711 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:59:49,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:59:49,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:59:49,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:59:49,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:59:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:49,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:49,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:49,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:59:50,126 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:59:50,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-20 23:59:50,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:59:50,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:50,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-02-20 23:59:51,062 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:59:51,063 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 17 [2022-02-20 23:59:51,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {2665#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {2665#true} is VALID [2022-02-20 23:59:51,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {2665#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,140 INFO L272 TraceCheckUtils]: 3: Hoare triple {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2680#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:51,142 INFO L290 TraceCheckUtils]: 4: Hoare triple {2680#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2684#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:51,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {2684#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2684#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:51,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {2684#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {2684#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:51,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {2684#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {2684#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:51,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {2684#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2684#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:51,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {2684#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {2684#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:51,169 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2684#(and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} #171#return; {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,173 INFO L272 TraceCheckUtils]: 16: Hoare triple {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2680#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:51,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {2680#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2724#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:51,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {2724#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2724#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:51,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {2724#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {2724#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:51,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {2724#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:51,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {2724#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2724#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:51,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {2724#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {2724#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:59:51,190 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2724#(and (exists ((v_ArrVal_155 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_155)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {2673#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} #171#return; {2743#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {2743#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2743#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {2743#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {2743#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {2743#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2743#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {2743#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2743#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {2743#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {2743#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {2743#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2743#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:51,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {2743#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {2765#(and (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:59:51,234 INFO L272 TraceCheckUtils]: 31: Hoare triple {2765#(and (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {2769#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:59:51,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {2769#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:51,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:51,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:51,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:51,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:51,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} assume true; {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:51,242 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} {2765#(and (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} #173#return; {2765#(and (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:59:51,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {2765#(and (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {2765#(and (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:59:51,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {2765#(and (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} assume !(1bv1 == #valid[sll_append_~head#1.base]); {2666#false} is VALID [2022-02-20 23:59:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:59:51,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:51,615 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:59:51,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557753263] [2022-02-20 23:59:51,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557753263] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:51,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2102527019] [2022-02-20 23:59:51,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:59:51,615 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:59:51,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:59:51,617 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:59:51,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-02-20 23:59:51,778 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:59:51,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631096417] [2022-02-20 23:59:51,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:59:51,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:51,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:51,780 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:51,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 1 [2022-02-20 23:59:51,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 23:59:51,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:59:51,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:59:51,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:59:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:51,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:51,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:54,071 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:59:54,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-20 23:59:56,212 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:59:56,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-20 23:59:56,349 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:59:56,349 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 17 [2022-02-20 23:59:56,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {2665#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {2665#true} is VALID [2022-02-20 23:59:56,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {2665#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,375 INFO L272 TraceCheckUtils]: 3: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2769#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:59:56,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {2769#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} is VALID [2022-02-20 23:59:56,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} is VALID [2022-02-20 23:59:56,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} is VALID [2022-02-20 23:59:56,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} is VALID [2022-02-20 23:59:56,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} is VALID [2022-02-20 23:59:56,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} assume true; {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} is VALID [2022-02-20 23:59:56,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} #171#return; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,385 INFO L272 TraceCheckUtils]: 16: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2769#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:59:56,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {2769#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} is VALID [2022-02-20 23:59:56,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} is VALID [2022-02-20 23:59:56,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} is VALID [2022-02-20 23:59:56,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} is VALID [2022-02-20 23:59:56,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} is VALID [2022-02-20 23:59:56,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} assume true; {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} is VALID [2022-02-20 23:59:56,392 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2868#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_274 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274) |#valid|))))} {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} #171#return; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {2798#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:56,395 INFO L272 TraceCheckUtils]: 31: Hoare triple {2798#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {2769#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:59:56,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {2769#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2953#(exists ((v_ArrVal_276 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_276) |#valid|))} is VALID [2022-02-20 23:59:56,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {2953#(exists ((v_ArrVal_276 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_276) |#valid|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2953#(exists ((v_ArrVal_276 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_276) |#valid|))} is VALID [2022-02-20 23:59:56,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {2953#(exists ((v_ArrVal_276 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_276) |#valid|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:56,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:56,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:56,401 INFO L290 TraceCheckUtils]: 37: Hoare triple {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} assume true; {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:59:56,416 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2773#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} {2798#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} #173#return; {2798#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:56,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {2798#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {2798#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:56,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {2798#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[sll_append_~head#1.base]); {2666#false} is VALID [2022-02-20 23:59:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 8 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-20 23:59:56,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:59,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {2798#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[sll_append_~head#1.base]); {2666#false} is VALID [2022-02-20 23:59:59,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {2798#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {2798#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:59,064 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} {2798#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} #173#return; {2798#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:59,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume true; {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {2999#(or (not (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))) (forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1))))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {2999#(or (not (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))) (forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1))))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2999#(or (not (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))) (forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1))))))} is VALID [2022-02-20 23:59:59,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2999#(or (not (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))) (forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1))))))} is VALID [2022-02-20 23:59:59,074 INFO L272 TraceCheckUtils]: 31: Hoare triple {2798#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {2798#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:59:59,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,078 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} #171#return; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume true; {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,082 INFO L272 TraceCheckUtils]: 16: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,085 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} #171#return; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume true; {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,088 INFO L272 TraceCheckUtils]: 3: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {2808#(forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:59:59,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {2665#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {2830#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:59,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {2665#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {2665#true} is VALID [2022-02-20 23:59:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-20 23:59:59,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631096417] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:59,091 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:59:59,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 5] total 15 [2022-02-20 23:59:59,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457549771] [2022-02-20 23:59:59,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:59,091 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 41 [2022-02-20 23:59:59,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:59,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 23:59:59,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:59,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:59:59,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:59:59,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:59:59,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=220, Unknown=1, NotChecked=0, Total=272 [2022-02-20 23:59:59,216 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-21 00:00:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:08,769 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-02-21 00:00:08,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 00:00:08,770 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 41 [2022-02-21 00:00:08,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-21 00:00:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 117 transitions. [2022-02-21 00:00:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-21 00:00:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 117 transitions. [2022-02-21 00:00:08,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 117 transitions. [2022-02-21 00:00:08,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:08,983 INFO L225 Difference]: With dead ends: 111 [2022-02-21 00:00:08,983 INFO L226 Difference]: Without dead ends: 111 [2022-02-21 00:00:08,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 107 SyntacticMatches, 18 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=96, Invalid=409, Unknown=1, NotChecked=0, Total=506 [2022-02-21 00:00:08,984 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 108 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:08,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 434 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 224 Unchecked, 0.2s Time] [2022-02-21 00:00:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-21 00:00:08,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2022-02-21 00:00:08,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:08,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 99 states, 63 states have (on average 1.6031746031746033) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:08,989 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 99 states, 63 states have (on average 1.6031746031746033) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:08,989 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 99 states, 63 states have (on average 1.6031746031746033) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:08,992 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-02-21 00:00:08,992 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2022-02-21 00:00:08,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:08,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:08,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 63 states have (on average 1.6031746031746033) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 111 states. [2022-02-21 00:00:08,994 INFO L87 Difference]: Start difference. First operand has 99 states, 63 states have (on average 1.6031746031746033) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 111 states. [2022-02-21 00:00:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:08,997 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-02-21 00:00:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2022-02-21 00:00:08,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:08,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:08,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:08,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.6031746031746033) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-02-21 00:00:09,001 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 41 [2022-02-21 00:00:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:09,001 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-02-21 00:00:09,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-21 00:00:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-02-21 00:00:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-21 00:00:09,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:09,003 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:09,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:09,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:09,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:09,415 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-21 00:00:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:09,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092863, now seen corresponding path program 1 times [2022-02-21 00:00:09,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:00:09,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580261393] [2022-02-21 00:00:09,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:09,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:00:09,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:00:09,417 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 00:00:09,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-21 00:00:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:09,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-21 00:00:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:09,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:09,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 00:00:09,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 00:00:09,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-21 00:00:09,736 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-21 00:00:11,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:11,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 00:00:11,962 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 00:00:11,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 00:00:12,092 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-21 00:00:14,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:14,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-02-21 00:00:15,180 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-21 00:00:15,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-21 00:00:15,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {3544#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {3544#true} is VALID [2022-02-21 00:00:15,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {3544#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {3552#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {3552#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {3552#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,320 INFO L272 TraceCheckUtils]: 3: Hoare triple {3552#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {3559#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:15,321 INFO L290 TraceCheckUtils]: 4: Hoare triple {3559#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3563#(and (exists ((v_ArrVal_344 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_344)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:15,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {3563#(and (exists ((v_ArrVal_344 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_344)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3563#(and (exists ((v_ArrVal_344 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_344)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:15,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {3563#(and (exists ((v_ArrVal_344 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_344)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {3563#(and (exists ((v_ArrVal_344 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_344)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:15,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {3563#(and (exists ((v_ArrVal_344 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_344)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {3563#(and (exists ((v_ArrVal_344 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_344)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:15,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {3563#(and (exists ((v_ArrVal_344 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_344)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3563#(and (exists ((v_ArrVal_344 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_344)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:15,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {3563#(and (exists ((v_ArrVal_344 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_344)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {3563#(and (exists ((v_ArrVal_344 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_344)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:15,333 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3563#(and (exists ((v_ArrVal_344 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_344)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {3552#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} #171#return; {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,337 INFO L272 TraceCheckUtils]: 16: Hoare triple {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {3601#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:15,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {3601#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3605#(and (exists ((v_ArrVal_345 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_345) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:15,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {3605#(and (exists ((v_ArrVal_345 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_345) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3605#(and (exists ((v_ArrVal_345 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_345) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:15,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {3605#(and (exists ((v_ArrVal_345 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_345) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {3605#(and (exists ((v_ArrVal_345 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_345) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:15,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {3605#(and (exists ((v_ArrVal_345 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_345) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {3605#(and (exists ((v_ArrVal_345 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_345) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:15,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {3605#(and (exists ((v_ArrVal_345 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_345) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3605#(and (exists ((v_ArrVal_345 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_345) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:15,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {3605#(and (exists ((v_ArrVal_345 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_345) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {3605#(and (exists ((v_ArrVal_345 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_345) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:15,355 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3605#(and (exists ((v_ArrVal_345 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_345) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} #171#return; {3624#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {3624#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3624#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {3624#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {3624#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {3624#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3624#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {3624#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {3624#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {3624#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {3624#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {3624#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {3624#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:15,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {3624#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {3646#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-21 00:00:15,408 INFO L272 TraceCheckUtils]: 31: Hoare triple {3646#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {3650#(= |#length| |old(#length)|)} is VALID [2022-02-21 00:00:15,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {3650#(= |#length| |old(#length)|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3654#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} is VALID [2022-02-21 00:00:15,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {3654#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3654#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} is VALID [2022-02-21 00:00:15,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {3654#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {3654#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} is VALID [2022-02-21 00:00:15,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {3654#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {3654#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} is VALID [2022-02-21 00:00:15,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {3654#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3654#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} is VALID [2022-02-21 00:00:15,411 INFO L290 TraceCheckUtils]: 37: Hoare triple {3654#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} assume true; {3654#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} is VALID [2022-02-21 00:00:15,413 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3654#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|))} {3646#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} #173#return; {3673#(and (exists ((|v_node_create_~temp~0#1.base_37| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |v_node_create_~temp~0#1.base_37|)) (or (= |v_node_create_~temp~0#1.base_37| |ULTIMATE.start_sll_append_~head#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|))))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-21 00:00:15,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {3673#(and (exists ((|v_node_create_~temp~0#1.base_37| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |v_node_create_~temp~0#1.base_37|)) (or (= |v_node_create_~temp~0#1.base_37| |ULTIMATE.start_sll_append_~head#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|))))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {3673#(and (exists ((|v_node_create_~temp~0#1.base_37| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |v_node_create_~temp~0#1.base_37|)) (or (= |v_node_create_~temp~0#1.base_37| |ULTIMATE.start_sll_append_~head#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|))))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-21 00:00:15,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {3673#(and (exists ((|v_node_create_~temp~0#1.base_37| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |v_node_create_~temp~0#1.base_37|)) (or (= |v_node_create_~temp~0#1.base_37| |ULTIMATE.start_sll_append_~head#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|))))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, sll_append_~head#1.offset), #length[sll_append_~head#1.base]) && ~bvule32(sll_append_~head#1.offset, ~bvadd32(4bv32, sll_append_~head#1.offset))) && ~bvule32(0bv32, sll_append_~head#1.offset)); {3545#false} is VALID [2022-02-21 00:00:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:15,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:15,715 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:00:15,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580261393] [2022-02-21 00:00:15,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580261393] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:15,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1460798225] [2022-02-21 00:00:15,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:15,715 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-21 00:00:15,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-21 00:00:15,716 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-21 00:00:15,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-02-21 00:00:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:15,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 00:00:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:16,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:16,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 00:00:16,100 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-21 00:00:16,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:16,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 00:00:16,427 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-21 00:00:18,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:18,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 00:00:19,207 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-21 00:00:19,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:19,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 00:00:19,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {3544#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {3544#true} is VALID [2022-02-21 00:00:19,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {3544#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,683 INFO L272 TraceCheckUtils]: 3: Hoare triple {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {3601#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,684 INFO L290 TraceCheckUtils]: 4: Hoare triple {3601#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,704 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {3582#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} #171#return; {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,708 INFO L272 TraceCheckUtils]: 16: Hoare triple {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {3741#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {3741#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3745#(and (exists ((v_ArrVal_406 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_406))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:19,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {3745#(and (exists ((v_ArrVal_406 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_406))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3745#(and (exists ((v_ArrVal_406 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_406))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:19,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {3745#(and (exists ((v_ArrVal_406 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_406))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {3745#(and (exists ((v_ArrVal_406 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_406))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:19,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {3745#(and (exists ((v_ArrVal_406 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_406))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {3745#(and (exists ((v_ArrVal_406 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_406))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:19,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {3745#(and (exists ((v_ArrVal_406 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_406))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3758#(and (exists ((v_ArrVal_406 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_#res#1.base| v_ArrVal_406))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_#res#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:19,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {3758#(and (exists ((v_ArrVal_406 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_#res#1.base| v_ArrVal_406))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_#res#1.base| |#StackHeapBarrier|))} assume true; {3758#(and (exists ((v_ArrVal_406 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_#res#1.base| v_ArrVal_406))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_#res#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:19,727 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3758#(and (exists ((v_ArrVal_406 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_#res#1.base| v_ArrVal_406))) (not (= (bvadd |#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |node_create_#res#1.base| |#StackHeapBarrier|))} {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} #171#return; {3765#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (bvult |ULTIMATE.start_sll_create_#t~ret5#1.base| |#StackHeapBarrier|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {3765#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (bvult |ULTIMATE.start_sll_create_#t~ret5#1.base| |#StackHeapBarrier|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:19,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {3722#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {3787#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-21 00:00:19,733 INFO L272 TraceCheckUtils]: 31: Hoare triple {3787#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {3741#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {3741#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:19,768 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3703#(and (exists ((v_ArrVal_405 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_405)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {3787#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} #173#return; {3812#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-21 00:00:19,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {3812#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {3812#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-21 00:00:19,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {3812#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, sll_append_~head#1.offset), #length[sll_append_~head#1.base]) && ~bvule32(sll_append_~head#1.offset, ~bvadd32(4bv32, sll_append_~head#1.offset))) && ~bvule32(0bv32, sll_append_~head#1.offset)); {3545#false} is VALID [2022-02-21 00:00:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 00:00:19,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:24,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1460798225] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:24,906 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 00:00:24,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-02-21 00:00:24,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914364720] [2022-02-21 00:00:24,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 00:00:24,907 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-02-21 00:00:24,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:24,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 00:00:25,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:25,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-21 00:00:25,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:00:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-21 00:00:25,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=477, Unknown=5, NotChecked=0, Total=552 [2022-02-21 00:00:25,114 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 00:00:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:31,743 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-02-21 00:00:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:00:31,744 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-02-21 00:00:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 00:00:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2022-02-21 00:00:31,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 00:00:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2022-02-21 00:00:31,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 103 transitions. [2022-02-21 00:00:31,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:31,966 INFO L225 Difference]: With dead ends: 105 [2022-02-21 00:00:31,966 INFO L226 Difference]: Without dead ends: 105 [2022-02-21 00:00:31,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=115, Invalid=809, Unknown=6, NotChecked=0, Total=930 [2022-02-21 00:00:31,967 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 4 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:31,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 639 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 232 Unchecked, 0.5s Time] [2022-02-21 00:00:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-21 00:00:31,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-02-21 00:00:31,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:31,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 105 states, 69 states have (on average 1.536231884057971) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:31,970 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 105 states, 69 states have (on average 1.536231884057971) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:31,970 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 105 states, 69 states have (on average 1.536231884057971) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:31,972 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-02-21 00:00:31,972 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2022-02-21 00:00:31,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:31,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:31,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 69 states have (on average 1.536231884057971) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 105 states. [2022-02-21 00:00:31,973 INFO L87 Difference]: Start difference. First operand has 105 states, 69 states have (on average 1.536231884057971) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 105 states. [2022-02-21 00:00:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:31,982 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-02-21 00:00:31,982 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2022-02-21 00:00:31,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:31,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:31,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:31,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.536231884057971) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2022-02-21 00:00:31,986 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 41 [2022-02-21 00:00:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:31,986 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2022-02-21 00:00:31,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 00:00:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2022-02-21 00:00:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-21 00:00:31,987 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:31,988 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:32,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:32,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:32,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-02-21 00:00:32,398 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-21 00:00:32,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash 483750337, now seen corresponding path program 1 times [2022-02-21 00:00:32,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:00:32,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766333593] [2022-02-21 00:00:32,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:32,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:00:32,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:00:32,400 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 00:00:32,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-21 00:00:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:32,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 00:00:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:32,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:32,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {4263#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {4263#true} is VALID [2022-02-21 00:00:32,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {4263#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {4263#true} is VALID [2022-02-21 00:00:32,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {4263#true} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {4263#true} is VALID [2022-02-21 00:00:32,619 INFO L272 TraceCheckUtils]: 3: Hoare triple {4263#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {4263#true} is VALID [2022-02-21 00:00:32,619 INFO L290 TraceCheckUtils]: 4: Hoare triple {4263#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4263#true} is VALID [2022-02-21 00:00:32,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {4263#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4263#true} is VALID [2022-02-21 00:00:32,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {4263#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {4263#true} is VALID [2022-02-21 00:00:32,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {4263#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {4263#true} is VALID [2022-02-21 00:00:32,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {4263#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4263#true} is VALID [2022-02-21 00:00:32,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {4263#true} assume true; {4263#true} is VALID [2022-02-21 00:00:32,619 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4263#true} {4263#true} #171#return; {4263#true} is VALID [2022-02-21 00:00:32,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {4263#true} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {4263#true} is VALID [2022-02-21 00:00:32,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {4263#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {4263#true} is VALID [2022-02-21 00:00:32,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {4263#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {4263#true} is VALID [2022-02-21 00:00:32,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {4263#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {4263#true} is VALID [2022-02-21 00:00:32,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {4263#true} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {4263#true} is VALID [2022-02-21 00:00:32,620 INFO L272 TraceCheckUtils]: 16: Hoare triple {4263#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {4263#true} is VALID [2022-02-21 00:00:32,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {4263#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4263#true} is VALID [2022-02-21 00:00:32,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {4263#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4263#true} is VALID [2022-02-21 00:00:32,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {4263#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {4263#true} is VALID [2022-02-21 00:00:32,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {4263#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {4263#true} is VALID [2022-02-21 00:00:32,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {4263#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4263#true} is VALID [2022-02-21 00:00:32,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {4263#true} assume true; {4263#true} is VALID [2022-02-21 00:00:32,620 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4263#true} {4263#true} #171#return; {4263#true} is VALID [2022-02-21 00:00:32,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {4263#true} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {4263#true} is VALID [2022-02-21 00:00:32,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {4263#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {4263#true} is VALID [2022-02-21 00:00:32,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {4263#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {4263#true} is VALID [2022-02-21 00:00:32,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {4263#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {4263#true} is VALID [2022-02-21 00:00:32,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {4263#true} assume !~bvsgt32(sll_create_~len#1, 0bv32); {4263#true} is VALID [2022-02-21 00:00:32,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {4263#true} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {4263#true} is VALID [2022-02-21 00:00:32,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {4263#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {4263#true} is VALID [2022-02-21 00:00:32,621 INFO L272 TraceCheckUtils]: 31: Hoare triple {4263#true} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {4263#true} is VALID [2022-02-21 00:00:32,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {4263#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4263#true} is VALID [2022-02-21 00:00:32,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {4263#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4263#true} is VALID [2022-02-21 00:00:32,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {4263#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {4263#true} is VALID [2022-02-21 00:00:32,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {4263#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {4263#true} is VALID [2022-02-21 00:00:32,622 INFO L290 TraceCheckUtils]: 36: Hoare triple {4263#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4263#true} is VALID [2022-02-21 00:00:32,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {4263#true} assume true; {4263#true} is VALID [2022-02-21 00:00:32,622 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4263#true} {4263#true} #173#return; {4263#true} is VALID [2022-02-21 00:00:32,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {4263#true} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {4263#true} is VALID [2022-02-21 00:00:32,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {4263#true} SUMMARY for call sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset := read~$Pointer$(sll_append_~head#1.base, sll_append_~head#1.offset, 4bv32); srcloc: L601 {4388#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} is VALID [2022-02-21 00:00:32,630 INFO L290 TraceCheckUtils]: 41: Hoare triple {4388#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} assume 0bv32 == sll_append_#t~mem8#1.base && 0bv32 == sll_append_#t~mem8#1.offset;havoc sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset; {4388#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} is VALID [2022-02-21 00:00:32,630 INFO L290 TraceCheckUtils]: 42: Hoare triple {4388#(= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[sll_append_~head#1.base]); {4264#false} is VALID [2022-02-21 00:00:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-02-21 00:00:32,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:00:32,631 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:00:32,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766333593] [2022-02-21 00:00:32,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766333593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:32,631 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:00:32,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:00:32,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444344849] [2022-02-21 00:00:32,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:32,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-02-21 00:00:32,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:32,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 00:00:32,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:32,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:00:32,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:00:32,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:00:32,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:00:32,655 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 00:00:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:32,962 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-02-21 00:00:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:00:32,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-02-21 00:00:32,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 00:00:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-02-21 00:00:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 00:00:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-02-21 00:00:32,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2022-02-21 00:00:33,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:33,070 INFO L225 Difference]: With dead ends: 115 [2022-02-21 00:00:33,070 INFO L226 Difference]: Without dead ends: 115 [2022-02-21 00:00:33,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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-21 00:00:33,071 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 64 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:33,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 84 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:00:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-21 00:00:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 103. [2022-02-21 00:00:33,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:33,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 103 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:33,073 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 103 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:33,074 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 103 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:33,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:33,076 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-02-21 00:00:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2022-02-21 00:00:33,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:33,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:33,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 115 states. [2022-02-21 00:00:33,077 INFO L87 Difference]: Start difference. First operand has 103 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 115 states. [2022-02-21 00:00:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:33,079 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-02-21 00:00:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2022-02-21 00:00:33,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:33,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:33,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:33,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-02-21 00:00:33,081 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 43 [2022-02-21 00:00:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:33,082 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-02-21 00:00:33,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 00:00:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-02-21 00:00:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-21 00:00:33,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:33,082 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:33,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:33,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:00:33,295 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-21 00:00:33,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:33,295 INFO L85 PathProgramCache]: Analyzing trace with hash 483750338, now seen corresponding path program 1 times [2022-02-21 00:00:33,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:00:33,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165383115] [2022-02-21 00:00:33,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:33,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:00:33,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:00:33,297 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 00:00:33,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-21 00:00:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:33,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 00:00:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:33,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:33,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {4842#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {4842#true} is VALID [2022-02-21 00:00:33,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {4842#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,564 INFO L272 TraceCheckUtils]: 3: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {4842#true} is VALID [2022-02-21 00:00:33,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {4842#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4842#true} is VALID [2022-02-21 00:00:33,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {4842#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4842#true} is VALID [2022-02-21 00:00:33,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {4842#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {4842#true} is VALID [2022-02-21 00:00:33,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {4842#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {4842#true} is VALID [2022-02-21 00:00:33,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {4842#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4842#true} is VALID [2022-02-21 00:00:33,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-02-21 00:00:33,565 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4842#true} {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} #171#return; {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,572 INFO L272 TraceCheckUtils]: 16: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {4842#true} is VALID [2022-02-21 00:00:33,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {4842#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4842#true} is VALID [2022-02-21 00:00:33,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {4842#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4842#true} is VALID [2022-02-21 00:00:33,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {4842#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {4842#true} is VALID [2022-02-21 00:00:33,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {4842#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {4842#true} is VALID [2022-02-21 00:00:33,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {4842#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4842#true} is VALID [2022-02-21 00:00:33,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-02-21 00:00:33,574 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4842#true} {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} #171#return; {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {4850#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {4938#(= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,576 INFO L272 TraceCheckUtils]: 31: Hoare triple {4938#(= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32))} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {4842#true} is VALID [2022-02-21 00:00:33,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {4842#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4842#true} is VALID [2022-02-21 00:00:33,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {4842#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4842#true} is VALID [2022-02-21 00:00:33,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {4842#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {4842#true} is VALID [2022-02-21 00:00:33,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {4842#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {4842#true} is VALID [2022-02-21 00:00:33,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {4842#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4842#true} is VALID [2022-02-21 00:00:33,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-02-21 00:00:33,578 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4842#true} {4938#(= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32))} #173#return; {4938#(= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {4938#(= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32))} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {4938#(= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:33,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {4938#(= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32))} SUMMARY for call sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset := read~$Pointer$(sll_append_~head#1.base, sll_append_~head#1.offset, 4bv32); srcloc: L601 {4969#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_sll_append_~head#1.offset|) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-21 00:00:33,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {4969#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_sll_append_~head#1.offset|) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} assume 0bv32 == sll_append_#t~mem8#1.base && 0bv32 == sll_append_#t~mem8#1.offset;havoc sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset; {4969#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_sll_append_~head#1.offset|) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-21 00:00:33,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {4969#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_sll_append_~head#1.offset|) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, sll_append_~head#1.offset), #length[sll_append_~head#1.base]) && ~bvule32(sll_append_~head#1.offset, ~bvadd32(4bv32, sll_append_~head#1.offset))) && ~bvule32(0bv32, sll_append_~head#1.offset)); {4843#false} is VALID [2022-02-21 00:00:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-02-21 00:00:33,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:00:33,580 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:00:33,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165383115] [2022-02-21 00:00:33,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165383115] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:33,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:00:33,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 00:00:33,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568623127] [2022-02-21 00:00:33,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:33,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 43 [2022-02-21 00:00:33,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:33,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:33,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:33,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 00:00:33,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:00:33,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 00:00:33,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 00:00:33,605 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:33,956 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-02-21 00:00:33,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 00:00:33,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 43 [2022-02-21 00:00:33,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-02-21 00:00:33,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-02-21 00:00:33,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2022-02-21 00:00:34,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:34,068 INFO L225 Difference]: With dead ends: 101 [2022-02-21 00:00:34,068 INFO L226 Difference]: Without dead ends: 101 [2022-02-21 00:00:34,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-21 00:00:34,069 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 134 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:34,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 103 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:00:34,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-21 00:00:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-02-21 00:00:34,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:34,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:34,071 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:34,071 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:34,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:34,072 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-02-21 00:00:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-02-21 00:00:34,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:34,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:34,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 101 states. [2022-02-21 00:00:34,078 INFO L87 Difference]: Start difference. First operand has 101 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 101 states. [2022-02-21 00:00:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:34,080 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-02-21 00:00:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-02-21 00:00:34,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:34,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:34,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:34,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2022-02-21 00:00:34,081 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 43 [2022-02-21 00:00:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:34,081 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2022-02-21 00:00:34,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-02-21 00:00:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 00:00:34,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:34,082 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:34,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:34,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:00:34,282 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-21 00:00:34,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:34,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1027607010, now seen corresponding path program 1 times [2022-02-21 00:00:34,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:00:34,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687178086] [2022-02-21 00:00:34,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:34,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:00:34,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:00:34,285 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 00:00:34,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-21 00:00:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:34,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 00:00:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:34,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:34,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {5383#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {5383#true} is VALID [2022-02-21 00:00:34,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {5383#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {5383#true} is VALID [2022-02-21 00:00:34,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {5383#true} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {5383#true} is VALID [2022-02-21 00:00:34,526 INFO L272 TraceCheckUtils]: 3: Hoare triple {5383#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {5383#true} is VALID [2022-02-21 00:00:34,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {5383#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5383#true} is VALID [2022-02-21 00:00:34,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {5383#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5383#true} is VALID [2022-02-21 00:00:34,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {5383#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {5383#true} is VALID [2022-02-21 00:00:34,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {5383#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {5383#true} is VALID [2022-02-21 00:00:34,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {5383#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5383#true} is VALID [2022-02-21 00:00:34,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {5383#true} assume true; {5383#true} is VALID [2022-02-21 00:00:34,527 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5383#true} {5383#true} #171#return; {5383#true} is VALID [2022-02-21 00:00:34,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {5383#true} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {5383#true} is VALID [2022-02-21 00:00:34,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {5383#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {5383#true} is VALID [2022-02-21 00:00:34,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {5383#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {5383#true} is VALID [2022-02-21 00:00:34,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {5383#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {5383#true} is VALID [2022-02-21 00:00:34,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {5383#true} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {5383#true} is VALID [2022-02-21 00:00:34,527 INFO L272 TraceCheckUtils]: 16: Hoare triple {5383#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {5383#true} is VALID [2022-02-21 00:00:34,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {5383#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5383#true} is VALID [2022-02-21 00:00:34,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {5383#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5383#true} is VALID [2022-02-21 00:00:34,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {5383#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {5383#true} is VALID [2022-02-21 00:00:34,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {5383#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {5383#true} is VALID [2022-02-21 00:00:34,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {5383#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5383#true} is VALID [2022-02-21 00:00:34,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {5383#true} assume true; {5383#true} is VALID [2022-02-21 00:00:34,528 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5383#true} {5383#true} #171#return; {5383#true} is VALID [2022-02-21 00:00:34,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {5383#true} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {5383#true} is VALID [2022-02-21 00:00:34,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {5383#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {5383#true} is VALID [2022-02-21 00:00:34,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {5383#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {5383#true} is VALID [2022-02-21 00:00:34,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {5383#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {5383#true} is VALID [2022-02-21 00:00:34,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {5383#true} assume !~bvsgt32(sll_create_~len#1, 0bv32); {5383#true} is VALID [2022-02-21 00:00:34,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {5383#true} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {5383#true} is VALID [2022-02-21 00:00:34,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {5383#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {5478#(= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|)} is VALID [2022-02-21 00:00:34,529 INFO L272 TraceCheckUtils]: 31: Hoare triple {5478#(= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|)} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {5383#true} is VALID [2022-02-21 00:00:34,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {5383#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5383#true} is VALID [2022-02-21 00:00:34,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {5383#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5383#true} is VALID [2022-02-21 00:00:34,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {5383#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {5383#true} is VALID [2022-02-21 00:00:34,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {5383#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {5383#true} is VALID [2022-02-21 00:00:34,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {5383#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5383#true} is VALID [2022-02-21 00:00:34,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {5383#true} assume true; {5383#true} is VALID [2022-02-21 00:00:34,531 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5383#true} {5478#(= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|)} #173#return; {5478#(= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|)} is VALID [2022-02-21 00:00:34,531 INFO L290 TraceCheckUtils]: 39: Hoare triple {5478#(= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|)} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {5478#(= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|)} is VALID [2022-02-21 00:00:34,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {5478#(= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|)} SUMMARY for call sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset := read~$Pointer$(sll_append_~head#1.base, sll_append_~head#1.offset, 4bv32); srcloc: L601 {5509#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:34,532 INFO L290 TraceCheckUtils]: 41: Hoare triple {5509#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume 0bv32 == sll_append_#t~mem8#1.base && 0bv32 == sll_append_#t~mem8#1.offset;havoc sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset; {5509#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:34,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {5509#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, 4bv32); srcloc: L602 {5509#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:34,533 INFO L290 TraceCheckUtils]: 43: Hoare triple {5509#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume { :end_inline_sll_append } true; {5509#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:34,533 INFO L290 TraceCheckUtils]: 44: Hoare triple {5509#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))} assume !(1bv1 == #valid[main_~#s~0#1.base]); {5384#false} is VALID [2022-02-21 00:00:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-02-21 00:00:34,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:00:34,534 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:00:34,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687178086] [2022-02-21 00:00:34,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687178086] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:34,534 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:00:34,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:00:34,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367716650] [2022-02-21 00:00:34,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:34,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 45 [2022-02-21 00:00:34,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:34,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:34,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:34,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 00:00:34,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:00:34,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 00:00:34,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 00:00:34,561 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:34,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:34,861 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-02-21 00:00:34,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 00:00:34,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 45 [2022-02-21 00:00:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-02-21 00:00:34,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-02-21 00:00:34,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 104 transitions. [2022-02-21 00:00:34,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:34,958 INFO L225 Difference]: With dead ends: 112 [2022-02-21 00:00:34,959 INFO L226 Difference]: Without dead ends: 112 [2022-02-21 00:00:34,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 00:00:34,959 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 135 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:34,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 98 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:00:34,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-21 00:00:34,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2022-02-21 00:00:34,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:34,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 100 states, 69 states have (on average 1.463768115942029) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:34,962 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 100 states, 69 states have (on average 1.463768115942029) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:34,962 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 100 states, 69 states have (on average 1.463768115942029) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:34,963 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-02-21 00:00:34,963 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2022-02-21 00:00:34,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:34,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:34,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 69 states have (on average 1.463768115942029) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 112 states. [2022-02-21 00:00:34,964 INFO L87 Difference]: Start difference. First operand has 100 states, 69 states have (on average 1.463768115942029) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 112 states. [2022-02-21 00:00:34,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:34,965 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-02-21 00:00:34,965 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2022-02-21 00:00:34,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:34,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:34,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:34,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.463768115942029) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2022-02-21 00:00:34,967 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 45 [2022-02-21 00:00:34,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:34,967 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2022-02-21 00:00:34,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2022-02-21 00:00:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 00:00:34,968 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:34,968 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:34,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:35,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:00:35,176 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-21 00:00:35,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1027607011, now seen corresponding path program 1 times [2022-02-21 00:00:35,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:00:35,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735473848] [2022-02-21 00:00:35,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:35,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:00:35,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:00:35,178 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 00:00:35,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-21 00:00:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:35,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 00:00:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:35,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:35,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {5959#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {5959#true} is VALID [2022-02-21 00:00:35,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {5959#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,495 INFO L272 TraceCheckUtils]: 3: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {5959#true} is VALID [2022-02-21 00:00:35,495 INFO L290 TraceCheckUtils]: 4: Hoare triple {5959#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5959#true} is VALID [2022-02-21 00:00:35,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {5959#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5959#true} is VALID [2022-02-21 00:00:35,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {5959#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {5959#true} is VALID [2022-02-21 00:00:35,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {5959#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {5959#true} is VALID [2022-02-21 00:00:35,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {5959#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5959#true} is VALID [2022-02-21 00:00:35,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {5959#true} assume true; {5959#true} is VALID [2022-02-21 00:00:35,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5959#true} {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} #171#return; {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,497 INFO L272 TraceCheckUtils]: 16: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {5959#true} is VALID [2022-02-21 00:00:35,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {5959#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5959#true} is VALID [2022-02-21 00:00:35,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {5959#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5959#true} is VALID [2022-02-21 00:00:35,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {5959#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {5959#true} is VALID [2022-02-21 00:00:35,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {5959#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {5959#true} is VALID [2022-02-21 00:00:35,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {5959#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5959#true} is VALID [2022-02-21 00:00:35,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {5959#true} assume true; {5959#true} is VALID [2022-02-21 00:00:35,500 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5959#true} {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} #171#return; {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-21 00:00:35,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {5967#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {6055#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_append_~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|))} is VALID [2022-02-21 00:00:35,503 INFO L272 TraceCheckUtils]: 31: Hoare triple {6055#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_append_~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|))} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {5959#true} is VALID [2022-02-21 00:00:35,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {5959#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5959#true} is VALID [2022-02-21 00:00:35,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {5959#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5959#true} is VALID [2022-02-21 00:00:35,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {5959#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {5959#true} is VALID [2022-02-21 00:00:35,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {5959#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {5959#true} is VALID [2022-02-21 00:00:35,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {5959#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5959#true} is VALID [2022-02-21 00:00:35,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {5959#true} assume true; {5959#true} is VALID [2022-02-21 00:00:35,504 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5959#true} {6055#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_append_~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|))} #173#return; {6055#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_append_~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|))} is VALID [2022-02-21 00:00:35,504 INFO L290 TraceCheckUtils]: 39: Hoare triple {6055#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_append_~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|))} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {6055#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_append_~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|))} is VALID [2022-02-21 00:00:35,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {6055#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_append_~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_append_~head#1.base|))} SUMMARY for call sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset := read~$Pointer$(sll_append_~head#1.base, sll_append_~head#1.offset, 4bv32); srcloc: L601 {6086#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (bvule (bvadd |ULTIMATE.start_main_~#s~0#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:35,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {6086#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (bvule (bvadd |ULTIMATE.start_main_~#s~0#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume 0bv32 == sll_append_#t~mem8#1.base && 0bv32 == sll_append_#t~mem8#1.offset;havoc sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset; {6086#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (bvule (bvadd |ULTIMATE.start_main_~#s~0#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:35,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {6086#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (bvule (bvadd |ULTIMATE.start_main_~#s~0#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, 4bv32); srcloc: L602 {6086#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (bvule (bvadd |ULTIMATE.start_main_~#s~0#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:35,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {6086#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (bvule (bvadd |ULTIMATE.start_main_~#s~0#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume { :end_inline_sll_append } true; {6086#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (bvule (bvadd |ULTIMATE.start_main_~#s~0#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:35,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {6086#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (bvule (bvadd |ULTIMATE.start_main_~#s~0#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, main_~#s~0#1.offset), #length[main_~#s~0#1.base]) && ~bvule32(main_~#s~0#1.offset, ~bvadd32(4bv32, main_~#s~0#1.offset))) && ~bvule32(0bv32, main_~#s~0#1.offset)); {5960#false} is VALID [2022-02-21 00:00:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-02-21 00:00:35,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:00:35,508 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 00:00:35,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735473848] [2022-02-21 00:00:35,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735473848] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:35,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:00:35,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 00:00:35,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435224440] [2022-02-21 00:00:35,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:35,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 45 [2022-02-21 00:00:35,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:35,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:35,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:35,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 00:00:35,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 00:00:35,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 00:00:35,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 00:00:35,537 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:35,881 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2022-02-21 00:00:35,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 00:00:35,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 45 [2022-02-21 00:00:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-02-21 00:00:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-02-21 00:00:35,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2022-02-21 00:00:35,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:35,986 INFO L225 Difference]: With dead ends: 98 [2022-02-21 00:00:35,986 INFO L226 Difference]: Without dead ends: 98 [2022-02-21 00:00:35,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-21 00:00:35,987 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 127 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:35,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 90 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:00:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-21 00:00:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-02-21 00:00:35,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:35,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 69 states have (on average 1.434782608695652) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:35,990 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 69 states have (on average 1.434782608695652) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:35,990 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 69 states have (on average 1.434782608695652) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:35,992 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2022-02-21 00:00:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-02-21 00:00:35,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:35,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:35,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 69 states have (on average 1.434782608695652) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 98 states. [2022-02-21 00:00:35,993 INFO L87 Difference]: Start difference. First operand has 98 states, 69 states have (on average 1.434782608695652) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 98 states. [2022-02-21 00:00:35,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:35,995 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2022-02-21 00:00:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-02-21 00:00:35,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:35,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:35,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:35,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:35,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.434782608695652) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 00:00:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-02-21 00:00:35,997 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 45 [2022-02-21 00:00:35,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:35,998 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-02-21 00:00:35,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 00:00:35,998 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-02-21 00:00:35,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 00:00:35,999 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:35,999 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:36,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:36,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 00:00:36,219 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2022-02-21 00:00:36,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:36,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1027760007, now seen corresponding path program 1 times [2022-02-21 00:00:36,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 00:00:36,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780707018] [2022-02-21 00:00:36,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:36,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 00:00:36,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 00:00:36,221 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 00:00:36,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-21 00:00:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:36,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 40 conjunts are in the unsatisfiable core [2022-02-21 00:00:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:36,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:36,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 00:00:36,638 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 6 treesize of output 5 [2022-02-21 00:00:36,780 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 9 treesize of output 5 [2022-02-21 00:00:36,784 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-21 00:00:37,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:37,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-21 00:00:37,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:37,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-21 00:00:37,153 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-21 00:00:37,153 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 16 treesize of output 18 [2022-02-21 00:00:37,365 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-21 00:00:37,370 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-21 00:00:37,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {6492#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {6492#true} is VALID [2022-02-21 00:00:37,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {6492#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~post17#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:37,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:37,604 INFO L272 TraceCheckUtils]: 3: Hoare triple {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-21 00:00:37,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-21 00:00:37,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-21 00:00:37,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-21 00:00:37,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-21 00:00:37,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-21 00:00:37,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-21 00:00:37,608 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #171#return; {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:37,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:37,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:37,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:37,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:37,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:37,609 INFO L272 TraceCheckUtils]: 16: Hoare triple {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-21 00:00:37,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {6507#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6550#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:37,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {6550#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6550#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:37,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {6550#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {6550#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:37,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {6550#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {6550#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:37,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {6550#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6563#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:37,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {6563#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {6563#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:37,613 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6563#(and (= |node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |node_create_#res#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {6500#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #171#return; {6570#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= |ULTIMATE.start_sll_create_#t~ret5#1.offset| (_ bv0 32)))} is VALID [2022-02-21 00:00:37,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {6570#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= |ULTIMATE.start_sll_create_#t~ret5#1.offset| (_ bv0 32)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {6574#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} is VALID [2022-02-21 00:00:37,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {6574#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32); srcloc: L587 {6574#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} is VALID [2022-02-21 00:00:37,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {6574#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {6581#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv8 32)))} is VALID [2022-02-21 00:00:37,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {6581#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv8 32)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {6581#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv8 32)))} is VALID [2022-02-21 00:00:37,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {6581#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv8 32)))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {6581#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv8 32)))} is VALID [2022-02-21 00:00:37,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {6581#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv8 32)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {6591#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_sll_create_#res#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_#res#1.base|)))} is VALID [2022-02-21 00:00:37,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {6591#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_sll_create_#res#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_sll_create_#res#1.base|)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_sll_append } true;sll_append_#in~head#1.base, sll_append_#in~head#1.offset, sll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset, sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset, sll_append_#t~mem9#1.base, sll_append_#t~mem9#1.offset, sll_append_#t~mem10#1.base, sll_append_#t~mem10#1.offset, sll_append_#t~mem11#1.base, sll_append_#t~mem11#1.offset, sll_append_~last~0#1.base, sll_append_~last~0#1.offset, sll_append_~head#1.base, sll_append_~head#1.offset, sll_append_~data#1, sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset;sll_append_~head#1.base, sll_append_~head#1.offset := sll_append_#in~head#1.base, sll_append_#in~head#1.offset;sll_append_~data#1 := sll_append_#in~data#1; {6595#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))))} is VALID [2022-02-21 00:00:37,617 INFO L272 TraceCheckUtils]: 31: Hoare triple {6595#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))))} call sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset := node_create(sll_append_~data#1); {6599#(and (= |#length| |old(#length)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-21 00:00:37,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {6599#(and (= |#length| |old(#length)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6603#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-21 00:00:37,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {6603#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6603#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-21 00:00:37,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {6603#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L576-1 {6610#(and (exists ((v_ArrVal_706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_706) |#memory_$Pointer$.base|)) (exists ((v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_707) |#memory_$Pointer$.offset|)) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-21 00:00:37,635 WARN L290 TraceCheckUtils]: 35: Hoare triple {6610#(and (exists ((v_ArrVal_706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_706) |#memory_$Pointer$.base|)) (exists ((v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_707) |#memory_$Pointer$.offset|)) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L579 {6614#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_709) |#memory_$Pointer$.offset|) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_708) |#memory_$Pointer$.base|) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} is UNKNOWN [2022-02-21 00:00:37,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {6614#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_709) |#memory_$Pointer$.offset|) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_708) |#memory_$Pointer$.base|) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6614#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_709) |#memory_$Pointer$.offset|) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_708) |#memory_$Pointer$.base|) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} is VALID [2022-02-21 00:00:37,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {6614#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_709) |#memory_$Pointer$.offset|) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_708) |#memory_$Pointer$.base|) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} assume true; {6614#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_709) |#memory_$Pointer$.offset|) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_708) |#memory_$Pointer$.base|) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} is VALID [2022-02-21 00:00:37,652 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6614#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_709) |#memory_$Pointer$.offset|) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_708) |#memory_$Pointer$.base|) (= (store |old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |#length|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} {6595#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))))} #173#return; {6624#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))))} is VALID [2022-02-21 00:00:37,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {6624#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))))} sll_append_~new_last~0#1.base, sll_append_~new_last~0#1.offset := sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset;havoc sll_append_#t~ret7#1.base, sll_append_#t~ret7#1.offset; {6624#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))))} is VALID [2022-02-21 00:00:37,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {6624#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))))} SUMMARY for call sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset := read~$Pointer$(sll_append_~head#1.base, sll_append_~head#1.offset, 4bv32); srcloc: L601 {6624#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))))} is VALID [2022-02-21 00:00:39,673 WARN L290 TraceCheckUtils]: 41: Hoare triple {6624#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))))} assume !(0bv32 == sll_append_#t~mem8#1.base && 0bv32 == sll_append_#t~mem8#1.offset);havoc sll_append_#t~mem8#1.base, sll_append_#t~mem8#1.offset; {6624#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (= (_ bv8 32) (select |#length| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))))} is UNKNOWN